{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PVNXQN7D6IGBEUPURLTNTBCRQF","short_pith_number":"pith:PVNXQN7D","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"},"canonical_sha256":"7d5b7837e3f20c1251f48ae6d98451814ddfa9b2138f756b692f5a0e75a79d6a","source":{"kind":"arxiv","id":"1607.03918","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PVNXQN7D6IGBEUPURLTNTBCRQF","target":"record","payload":{"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"},"canonical_sha256":"7d5b7837e3f20c1251f48ae6d98451814ddfa9b2138f756b692f5a0e75a79d6a","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"},"source_kind":"arxiv","source_id":"1607.03918","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/WJDRo8zS45uLj2TiyqRTvnvrG2XK5+xYaHBiKictpZPYz6m/YCSpVXPbPW/lRvscYG3djjNnajRAW5CYJiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:06:58.649782Z"},"content_sha256":"6df6aa3e1589d545dcdf132674f9ae0fab94b9323384aa455d8a7c27ff18b81a","schema_version":"1.0","event_id":"sha256:6df6aa3e1589d545dcdf132674f9ae0fab94b9323384aa455d8a7c27ff18b81a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PVNXQN7D6IGBEUPURLTNTBCRQF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT6EyfgI9z3w++6zeZ/S1vJEgoQ0LdO8lu0HvpyEb7VExvY9ESY+yq+qwWNhMwfq36mlgZsoR5APbUszFFmpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:06:58.650528Z"},"content_sha256":"f69dc3bda85cd70eb05c1987b93f2097d8da6dbff5cd336e8a985b898497e6a7","schema_version":"1.0","event_id":"sha256:f69dc3bda85cd70eb05c1987b93f2097d8da6dbff5cd336e8a985b898497e6a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/bundle.json","state_url":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T19:06:58Z","links":{"resolver":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF","bundle":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/bundle.json","state":"https://pith.science/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVNXQN7D6IGBEUPURLTNTBCRQF/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+t8nSK+QHojOVLt2fR796NvJhP/vks55EKLEPhfEiS57fPlzevD+SKmBkCuhAORj0HfpbdD81W21oIQE7s2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:06:58.653937Z","bundle_sha256":"0c03dff56b48a9b4ca7ad1406ed76d433129ed4a7f740d47364afcaec0b0f786"}}