{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5ITR6V5C3U5SWOKAONYFAULHXY","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":"dfa029729613bd0d90b5da1258cd2e7de10eb0f090e3cd25b6c67077dc5e8231","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-10T12:31:27Z","title_canon_sha256":"151948b9c652f2b4c5921093b101325e74098316312a402ec122dfac5081f391"},"schema_version":"1.0","source":{"id":"1204.2124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2124","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2124v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2124","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"5ITR6V5C3U5S","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5ITR6V5C3U5SWOKA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5ITR6V5C","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:3db0dbd74fa7609e3f618b39b2ba2d7cdd20646a072dbd5d62eccbe660de9123","target":"graph","created_at":"2026-05-18T00:54:58Z","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 Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can be formulated in terms of spanning subgraphs and subgraphs, and as such their computational complexity has been extensively studied. What about the surjective variant? Because this problem is NP-complete in general, we restrict the guest and the host graph to belong to graph classes G and H, respectively. We determine to what extent a certain choice of G and ","authors_text":"Barnaby Martin, Bernard Lidick\\'y, Dani\\\"el Paulusma, Petr A. Golovach","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-10T12:31:27Z","title":"Finding vertex-surjective graph homomorphisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2124","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:ca50dfced12857bac96cfbaa253bf2dbfc5813952cad23df619a3f876456390d","target":"record","created_at":"2026-05-18T00:54:58Z","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":"dfa029729613bd0d90b5da1258cd2e7de10eb0f090e3cd25b6c67077dc5e8231","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-10T12:31:27Z","title_canon_sha256":"151948b9c652f2b4c5921093b101325e74098316312a402ec122dfac5081f391"},"schema_version":"1.0","source":{"id":"1204.2124","kind":"arxiv","version":1}},"canonical_sha256":"ea271f57a2dd3b2b39407370505167be288178cfc2678d1d6a33944a24816006","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea271f57a2dd3b2b39407370505167be288178cfc2678d1d6a33944a24816006","first_computed_at":"2026-05-18T00:54:58.478435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.478435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS65O/X5Zgu/qPUhhbpIwllhGnQzqmf2Q3W2qe6Gw8B65c1vig/K+G+d+YAwHIyklPt298wCf7ZVPffReKxhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.479082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca50dfced12857bac96cfbaa253bf2dbfc5813952cad23df619a3f876456390d","sha256:3db0dbd74fa7609e3f618b39b2ba2d7cdd20646a072dbd5d62eccbe660de9123"],"state_sha256":"a650e84794d6f3a91a6ca184a81a27daf1f4981464e42df72ab4250a0ee79351"}