{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JBL3JF67ZQPFVG6GT2T5CA7O4P","short_pith_number":"pith:JBL3JF67","canonical_record":{"source":{"id":"1712.00200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T05:45:40Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"eb84df0e33c7b71e5378f5def835b64721c104051dd0ad9679277657b2ef2963","abstract_canon_sha256":"e61f085901e7ec4023f60fe97e697176ffa0f06604484a1a0bfefbd969f165d1"},"schema_version":"1.0"},"canonical_sha256":"4857b497dfcc1e5a9bc69ea7d103eee3cdbcb3a01d5d8d6f8ea9aed6f3523e70","source":{"kind":"arxiv","id":"1712.00200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00200","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00200v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00200","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"JBL3JF67ZQPF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JBL3JF67ZQPFVG6G","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JBL3JF67","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JBL3JF67ZQPFVG6GT2T5CA7O4P","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T05:45:40Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"eb84df0e33c7b71e5378f5def835b64721c104051dd0ad9679277657b2ef2963","abstract_canon_sha256":"e61f085901e7ec4023f60fe97e697176ffa0f06604484a1a0bfefbd969f165d1"},"schema_version":"1.0"},"canonical_sha256":"4857b497dfcc1e5a9bc69ea7d103eee3cdbcb3a01d5d8d6f8ea9aed6f3523e70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.992965Z","signature_b64":"LIha7jA7QHqaIwoTcnPde1ggLdI74XQ63VEKvZCssUuStz3AfU76vaBLKYdrHBv+4+opSi9ovwZNau0v8/RJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4857b497dfcc1e5a9bc69ea7d103eee3cdbcb3a01d5d8d6f8ea9aed6f3523e70","last_reissued_at":"2026-05-18T00:29:06.992232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.992232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00200","source_version":1,"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-18T00:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgDBDB1+W9C8vRDx4zJdq12wielk0sCCDvIpe3GPA9AAIHUDPLVGZV1kJfdxIOcr5i7giaEm3cUmrkBKsH3aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:17.354709Z"},"content_sha256":"c4100957d7797a13942c0f676e8d1bcd73095a3fc09a26a4132ccda2011bc295","schema_version":"1.0","event_id":"sha256:c4100957d7797a13942c0f676e8d1bcd73095a3fc09a26a4132ccda2011bc295"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JBL3JF67ZQPFVG6GT2T5CA7O4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Homomorphism Reconfiguration and Frozen $H$-Colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Benjamin Moore, Jae-Baek Lee, Jonathan A. Noel, Mark Siggers, Richard C. Brewster","submitted_at":"2017-12-01T05:45:40Z","abstract_excerpt":"For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\\varphi$ and $\\psi$ of $G$, does there exist a sequence $f_0,\\dots,f_m$ of $H$-colourings such that $f_0=\\varphi$, $f_m=\\psi$ and $f_i(u)f_{i+1}(v)\\in E(H)$ for every $0\\leq i<m$ and $uv\\in E(G)$? If the graph $G$ is loop-free, then this is the equivalent to asking whether it possible to transform $\\varphi$ into $\\psi$ by changing the colour of one vertex at a time such that all intermediate mappings are $H$-colourings. In the affirmative, we say tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00200","kind":"arxiv","version":1},"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-18T00:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sY8GNPX1vFAAzmckdKIQ55TeFD0DkjoqNNV9tonKNY97FDL0XUv52nIDWo75TUj/gUh/01lE7K3VpnvzvHD7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:17.355074Z"},"content_sha256":"57bad9904715d761e60d160088b946f3f18847067fe52671f86c41643be76692","schema_version":"1.0","event_id":"sha256:57bad9904715d761e60d160088b946f3f18847067fe52671f86c41643be76692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P/bundle.json","state_url":"https://pith.science/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P/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-28T12:15:17Z","links":{"resolver":"https://pith.science/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P","bundle":"https://pith.science/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P/bundle.json","state":"https://pith.science/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBL3JF67ZQPFVG6GT2T5CA7O4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JBL3JF67ZQPFVG6GT2T5CA7O4P","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":"e61f085901e7ec4023f60fe97e697176ffa0f06604484a1a0bfefbd969f165d1","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T05:45:40Z","title_canon_sha256":"eb84df0e33c7b71e5378f5def835b64721c104051dd0ad9679277657b2ef2963"},"schema_version":"1.0","source":{"id":"1712.00200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00200","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00200v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00200","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"JBL3JF67ZQPF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JBL3JF67ZQPFVG6G","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JBL3JF67","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:57bad9904715d761e60d160088b946f3f18847067fe52671f86c41643be76692","target":"graph","created_at":"2026-05-18T00:29:06Z","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":"For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\\varphi$ and $\\psi$ of $G$, does there exist a sequence $f_0,\\dots,f_m$ of $H$-colourings such that $f_0=\\varphi$, $f_m=\\psi$ and $f_i(u)f_{i+1}(v)\\in E(H)$ for every $0\\leq i<m$ and $uv\\in E(G)$? If the graph $G$ is loop-free, then this is the equivalent to asking whether it possible to transform $\\varphi$ into $\\psi$ by changing the colour of one vertex at a time such that all intermediate mappings are $H$-colourings. In the affirmative, we say tha","authors_text":"Benjamin Moore, Jae-Baek Lee, Jonathan A. Noel, Mark Siggers, Richard C. Brewster","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T05:45:40Z","title":"Graph Homomorphism Reconfiguration and Frozen $H$-Colourings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00200","kind":"arxiv","version":1},"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:c4100957d7797a13942c0f676e8d1bcd73095a3fc09a26a4132ccda2011bc295","target":"record","created_at":"2026-05-18T00:29:06Z","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":"e61f085901e7ec4023f60fe97e697176ffa0f06604484a1a0bfefbd969f165d1","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T05:45:40Z","title_canon_sha256":"eb84df0e33c7b71e5378f5def835b64721c104051dd0ad9679277657b2ef2963"},"schema_version":"1.0","source":{"id":"1712.00200","kind":"arxiv","version":1}},"canonical_sha256":"4857b497dfcc1e5a9bc69ea7d103eee3cdbcb3a01d5d8d6f8ea9aed6f3523e70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4857b497dfcc1e5a9bc69ea7d103eee3cdbcb3a01d5d8d6f8ea9aed6f3523e70","first_computed_at":"2026-05-18T00:29:06.992232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:06.992232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LIha7jA7QHqaIwoTcnPde1ggLdI74XQ63VEKvZCssUuStz3AfU76vaBLKYdrHBv+4+opSi9ovwZNau0v8/RJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:06.992965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4100957d7797a13942c0f676e8d1bcd73095a3fc09a26a4132ccda2011bc295","sha256:57bad9904715d761e60d160088b946f3f18847067fe52671f86c41643be76692"],"state_sha256":"31c778c782e76f393301c579ce324b256faf4a904c4771e51a71e55f5b40b8ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQl2TOdh9YN7A0oSWDAGxc+GTCD0RX3NAUOj6hWX1UlDYCK1yNlSFalD7lUT6BAMjgsFMGmM9/7kXM7Bnyq7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:17.357187Z","bundle_sha256":"9935cb8bb7183a658b935d5c7b080a359cb60872c798e113ecccb678f481c85f"}}