{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PFHKKKEX3QD5SV4YKWFVBZRCVG","short_pith_number":"pith:PFHKKKEX","canonical_record":{"source":{"id":"1408.2812","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2014-08-12T19:19:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"96dee0572b290051ffa3b9988509ee5a51e025968a729ca77f6e0c197b487b05","abstract_canon_sha256":"5f930f3a2d2f20b655f5da02724d665b9e7630ab397f99f51d93ed51d9003884"},"schema_version":"1.0"},"canonical_sha256":"794ea52897dc07d95798558b50e622a9a8897cabb6121b26174d77a6eb9e10ea","source":{"kind":"arxiv","id":"1408.2812","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2812","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2812v2","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2812","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"PFHKKKEX3QD5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PFHKKKEX3QD5SV4Y","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PFHKKKEX","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PFHKKKEX3QD5SV4YKWFVBZRCVG","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2812","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2014-08-12T19:19:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"96dee0572b290051ffa3b9988509ee5a51e025968a729ca77f6e0c197b487b05","abstract_canon_sha256":"5f930f3a2d2f20b655f5da02724d665b9e7630ab397f99f51d93ed51d9003884"},"schema_version":"1.0"},"canonical_sha256":"794ea52897dc07d95798558b50e622a9a8897cabb6121b26174d77a6eb9e10ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.540110Z","signature_b64":"0WaVRbwoNQAizVPvRoDD9s6i2TiFkBDTDDjrJii5dc11ZetzvMuCsJ8ddClxyXivaXIZ8bPzVxL2MmKL13pRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"794ea52897dc07d95798558b50e622a9a8897cabb6121b26174d77a6eb9e10ea","last_reissued_at":"2026-05-18T00:47:59.539536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.539536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2812","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-18T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCfCPqSlFBbzYaHV74+oBkde52z2N+4uyxx4cRwsw1GM+zzh9Sm6R2PpYCMZX1mYbpHkLlZSL+BOTwcmm0AJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:12:57.927278Z"},"content_sha256":"202eec17232a9937b086c43a826ad73cb06f99d08f17c609f3a832bb4e016135","schema_version":"1.0","event_id":"sha256:202eec17232a9937b086c43a826ad73cb06f99d08f17c609f3a832bb4e016135"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PFHKKKEX3QD5SV4YKWFVBZRCVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homomorphism reconfiguration via homotopy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Marcin Wrochna","submitted_at":"2014-08-12T19:19:08Z","abstract_excerpt":"We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring throughout. This is the same as finding a path in the Hom(G,H) complex. For H=K_k this is the problem of finding paths between k-colorings, which was shown to be in P for k<=3 and PSPACE-complete otherwise by Cereceda et al. 2011. We generalize the positive side of this dichotomy by providing an algorithm that solves the problem in polynomial time for any H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2812","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-18T00:47:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVPNN8TXFo6qMKmwD6HBZlNNQx+zN6v+hHYgZc8rTBQBjjsCVfpom/atf4CLzMhzFk+pKFaBzJavbYlbe+LKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:12:57.927693Z"},"content_sha256":"b81f2d1f7d39d936cfa3b7b0449b0cf1de3f4c48a834af15098f6a26b9903272","schema_version":"1.0","event_id":"sha256:b81f2d1f7d39d936cfa3b7b0449b0cf1de3f4c48a834af15098f6a26b9903272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG/bundle.json","state_url":"https://pith.science/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG/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-28T23:12:57Z","links":{"resolver":"https://pith.science/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG","bundle":"https://pith.science/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG/bundle.json","state":"https://pith.science/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFHKKKEX3QD5SV4YKWFVBZRCVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PFHKKKEX3QD5SV4YKWFVBZRCVG","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":"5f930f3a2d2f20b655f5da02724d665b9e7630ab397f99f51d93ed51d9003884","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2014-08-12T19:19:08Z","title_canon_sha256":"96dee0572b290051ffa3b9988509ee5a51e025968a729ca77f6e0c197b487b05"},"schema_version":"1.0","source":{"id":"1408.2812","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2812","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2812v2","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2812","created_at":"2026-05-18T00:47:59Z"},{"alias_kind":"pith_short_12","alias_value":"PFHKKKEX3QD5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PFHKKKEX3QD5SV4Y","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PFHKKKEX","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b81f2d1f7d39d936cfa3b7b0449b0cf1de3f4c48a834af15098f6a26b9903272","target":"graph","created_at":"2026-05-18T00:47:59Z","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":"We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring throughout. This is the same as finding a path in the Hom(G,H) complex. For H=K_k this is the problem of finding paths between k-colorings, which was shown to be in P for k<=3 and PSPACE-complete otherwise by Cereceda et al. 2011. We generalize the positive side of this dichotomy by providing an algorithm that solves the problem in polynomial time for any H","authors_text":"Marcin Wrochna","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2014-08-12T19:19:08Z","title":"Homomorphism reconfiguration via homotopy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2812","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:202eec17232a9937b086c43a826ad73cb06f99d08f17c609f3a832bb4e016135","target":"record","created_at":"2026-05-18T00:47:59Z","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":"5f930f3a2d2f20b655f5da02724d665b9e7630ab397f99f51d93ed51d9003884","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2014-08-12T19:19:08Z","title_canon_sha256":"96dee0572b290051ffa3b9988509ee5a51e025968a729ca77f6e0c197b487b05"},"schema_version":"1.0","source":{"id":"1408.2812","kind":"arxiv","version":2}},"canonical_sha256":"794ea52897dc07d95798558b50e622a9a8897cabb6121b26174d77a6eb9e10ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"794ea52897dc07d95798558b50e622a9a8897cabb6121b26174d77a6eb9e10ea","first_computed_at":"2026-05-18T00:47:59.539536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:59.539536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0WaVRbwoNQAizVPvRoDD9s6i2TiFkBDTDDjrJii5dc11ZetzvMuCsJ8ddClxyXivaXIZ8bPzVxL2MmKL13pRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:59.540110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2812","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:202eec17232a9937b086c43a826ad73cb06f99d08f17c609f3a832bb4e016135","sha256:b81f2d1f7d39d936cfa3b7b0449b0cf1de3f4c48a834af15098f6a26b9903272"],"state_sha256":"519376bf1b18e5f1ca0a2e4f301894912aaf93645c4d657f9ab659a9609ea14b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjbjN9O97uMDWfVPTrmrMfpzWyz1EPxcKfG3Hz9vNLcPG0mWFZAEzw5MDydcDQ5s5zxeUxyTgipDl3ZbL4/dBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:12:57.930167Z","bundle_sha256":"8a35ac03f15cd6526b31a364bbdde98873059382b58535bad28c4ce7053e0050"}}