{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PVNXQN7D6IGBEUPURLTNTBCRQF","short_pith_number":"pith:PVNXQN7D","schema_version":"1.0","canonical_sha256":"7d5b7837e3f20c1251f48ae6d98451814ddfa9b2138f756b692f5a0e75a79d6a","source":{"kind":"arxiv","id":"1607.03918","version":2},"attestation_state":"computed","paper":{"title":"Graph Isomorphism Restricted by Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop, Pavel Klavik, Peter Zeman","submitted_at":"2016-07-13T20:20:31Z","abstract_excerpt":"The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs $G$ and $H$, it asks whether they are the same up to a relabeling of vertices. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each $u \\in V(G)$, we are given a list ${\\mathfrak L}(u) \\subseteq V(H)$ of possible images of $u$. After 35 years, we revive the study of this problem and consider which results for GraphIso translate to ListIso.\n  We prove the following: 1) When GraphIso is GI-complete for a class of graphs, it translates"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.03918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-13T20:20:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f66b268a24aef4b72b307f75f9c6a6acde487aa5306b7e12d97edc5843ce6f90","abstract_canon_sha256":"72b1c0c41409d2f313c83eeade95e86020e7a11f42ca6fe29b70f89cdd2cf8e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:34.245116Z","signature_b64":"Z0b3jbJTC/13nwF+b36aXqR8ZM5itxS4vyStpV6+9ppzZ7sMZTPB1g7QXZVwcCF9Tlvvvuytyj+7uP4/LLTzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d5b7837e3f20c1251f48ae6d98451814ddfa9b2138f756b692f5a0e75a79d6a","last_reissued_at":"2026-05-18T01:00:34.244473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:34.244473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Isomorphism Restricted by Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop, Pavel Klavik, Peter Zeman","submitted_at":"2016-07-13T20:20:31Z","abstract_excerpt":"The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs $G$ and $H$, it asks whether they are the same up to a relabeling of vertices. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each $u \\in V(G)$, we are given a list ${\\mathfrak L}(u) \\subseteq V(H)$ of possible images of $u$. After 35 years, we revive the study of this problem and consider which results for GraphIso translate to ListIso.\n  We prove the following: 1) When GraphIso is GI-complete for a class of graphs, it translates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03918","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.03918","created_at":"2026-05-18T01:00:34.244568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03918v2","created_at":"2026-05-18T01:00:34.244568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03918","created_at":"2026-05-18T01:00:34.244568+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVNXQN7D6IGB","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVNXQN7D6IGBEUPU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVNXQN7D","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF","json":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF.json","graph_json":"https://pith.science/api/pith-number/PVNXQN7D6IGBEUPURLTNTBCRQF/graph.json","events_json":"https://pith.science/api/pith-number/PVNXQN7D6IGBEUPURLTNTBCRQF/events.json","paper":"https://pith.science/paper/PVNXQN7D"},"agent_actions":{"view_html":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF","download_json":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF.json","view_paper":"https://pith.science/paper/PVNXQN7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03918&json=true","fetch_graph":"https://pith.science/api/pith-number/PVNXQN7D6IGBEUPURLTNTBCRQF/graph.json","fetch_events":"https://pith.science/api/pith-number/PVNXQN7D6IGBEUPURLTNTBCRQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/action/storage_attestation","attest_author":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/action/author_attestation","sign_citation":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/action/citation_signature","submit_replication":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/action/replication_record"}},"created_at":"2026-05-18T01:00:34.244568+00:00","updated_at":"2026-05-18T01:00:34.244568+00:00"}