{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PVNXQN7D6IGBEUPURLTNTBCRQF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"72b1c0c41409d2f313c83eeade95e86020e7a11f42ca6fe29b70f89cdd2cf8e5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-13T20:20:31Z","title_canon_sha256":"f66b268a24aef4b72b307f75f9c6a6acde487aa5306b7e12d97edc5843ce6f90"},"schema_version":"1.0","source":{"id":"1607.03918","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03918","created_at":"2026-05-18T01:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03918v2","created_at":"2026-05-18T01:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03918","created_at":"2026-05-18T01:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"PVNXQN7D6IGB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PVNXQN7D6IGBEUPU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PVNXQN7D","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:f69dc3bda85cd70eb05c1987b93f2097d8da6dbff5cd336e8a985b898497e6a7","target":"graph","created_at":"2026-05-18T01:00:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Du\\v{s}an Knop, Pavel Klavik, Peter Zeman","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-13T20:20:31Z","title":"Graph Isomorphism Restricted by Lists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03918","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6df6aa3e1589d545dcdf132674f9ae0fab94b9323384aa455d8a7c27ff18b81a","target":"record","created_at":"2026-05-18T01:00:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"72b1c0c41409d2f313c83eeade95e86020e7a11f42ca6fe29b70f89cdd2cf8e5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-07-13T20:20:31Z","title_canon_sha256":"f66b268a24aef4b72b307f75f9c6a6acde487aa5306b7e12d97edc5843ce6f90"},"schema_version":"1.0","source":{"id":"1607.03918","kind":"arxiv","version":2}},"canonical_sha256":"7d5b7837e3f20c1251f48ae6d98451814ddfa9b2138f756b692f5a0e75a79d6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d5b7837e3f20c1251f48ae6d98451814ddfa9b2138f756b692f5a0e75a79d6a","first_computed_at":"2026-05-18T01:00:34.244473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:34.244473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0b3jbJTC/13nwF+b36aXqR8ZM5itxS4vyStpV6+9ppzZ7sMZTPB1g7QXZVwcCF9Tlvvvuytyj+7uP4/LLTzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:34.245116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03918","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6df6aa3e1589d545dcdf132674f9ae0fab94b9323384aa455d8a7c27ff18b81a","sha256:f69dc3bda85cd70eb05c1987b93f2097d8da6dbff5cd336e8a985b898497e6a7"],"state_sha256":"53d86b65414667d2f84e8995d8ebdb2595ec35b1d91343198778aff04444a869"}