{"schema_version":"4ort.packet/1","entity":{"entity_id":"graph-isomorphism-problem","kg_uuid":"25b47411-0feb-46c5-8ba3-817e66fc43f2","wikidata_id":"Q3738036","name":"graph isomorphism problem","description":"computational problem of determining whether two finite graphs are isomorphic","type":"Thing","url":"https://4ort.xyz/entity/graph-isomorphism-problem"},"status":"complete","as_of":{"copy_written_at":"2026-11-15T16:28:26Z","last_source_edit_seen":null,"stale_possible":true,"claims_refreshed_at":null,"source_revision":null},"facts":[{"field":"P31","label":"instance of","value":"computational problem","value_id":"Q3435924","value_raw":"Q3435924","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P31","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P1269","label":"facet of","value":"graph isomorphism","value_id":"Q303100","value_raw":"Q303100","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P1269","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P2579","label":"studied by","value":"category theory","value_id":"Q217413","value_raw":"Q217413","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P2579","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P2579","label":"studied by","value":"computational complexity theory","value_id":"Q205084","value_raw":"Q205084","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P2579","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P6366","label":"Microsoft Academic ID (discontinued)","value":"124605251","value_id":null,"value_raw":"124605251","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P6366","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P10374","label":"computational complexity","value":"GI-complete","value_id":"Q115425721","value_raw":"Q115425721","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P10374","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[{"url":"https://cs.uwaterloo.ca/research/tr/2006/CS-2006-32.pdf"}]},"trust":{"band":"high","basis":"wikidata-reference-support/2","calibrated":false}},{"field":"P10565","label":"Encyclopedia of China (Third Edition) old ID (2021)","value":"403042","value_id":null,"value_raw":"403042","rank":"normal","current":null,"qualifiers":[],"layer":"source","citation":{"source":"wikidata","source_name":"Wikidata","source_record":"https://www.wikidata.org/wiki/Q3738036#P10565","source_edition":null,"edition_basis":"unknown","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"references":[]},"trust":{"band":"unscored","basis":"wikidata-reference-support/2","calibrated":false}}],"unknowns":[],"omitted":{"facts":0,"reason":null},"licences":[{"source":"wikidata","source_name":"Wikidata","licence":"CC0 1.0 Universal","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/","attribution":null,"fields":["P31","P1269","P2579","P6366","P10374","P10565"]}],"routes":{"entity_page":"https://4ort.xyz/entity/graph-isomorphism-problem","packet_api":"https://4ort.xyz/api/v1/entities/graph-isomorphism-problem/packet","facts_jsonld":"https://4ort.xyz/entity/graph-isomorphism-problem/facts.json","changes_api":"https://4ort.xyz/api/v1/knowledge/get_entity_changes?entity=graph-isomorphism-problem","attention_api":"https://4ort.xyz/api/v1/knowledge/get_attention?entity=graph-isomorphism-problem","wikidata":"https://www.wikidata.org/wiki/Q3738036","official_website":null},"trust_rules":{"wikidata-reference-support/2":"From the references in our copy of the statement: high = it cites a source (stated in P248, or a reference URL that is not Wikipedia); medium = only 'imported from Wikimedia project' or a Wikipedia URL; unscored = our copy holds no reference (older copies dropped references, so this is not evidence that Wikidata has none). Wikidata may hold more references than our copy shows. Reference support, not a probability."},"notes":["Our copy of this item's statements has not been checked against Wikidata since tracking began (2026-10-25); a newer value may exist."]}