{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7H5EO2IXCXQVI3LOU4OE3MKIRA","short_pith_number":"pith:7H5EO2IX","canonical_record":{"source":{"id":"1701.02188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T14:17:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8d0406a77600a131ecd79b74ab63cb19d55fc5543c80d25f0ce81be78ddef382","abstract_canon_sha256":"de4262ac668e2567b786081eef0a8f17402524ee0064da32a14a4b6a24057302"},"schema_version":"1.0"},"canonical_sha256":"f9fa47691715e1546d6ea71c4db148881ad54e8373d4dd98fbfb0be3de3bf48f","source":{"kind":"arxiv","id":"1701.02188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02188","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02188v2","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02188","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"7H5EO2IXCXQV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7H5EO2IXCXQVI3LO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7H5EO2IX","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7H5EO2IXCXQVI3LOU4OE3MKIRA","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T14:17:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8d0406a77600a131ecd79b74ab63cb19d55fc5543c80d25f0ce81be78ddef382","abstract_canon_sha256":"de4262ac668e2567b786081eef0a8f17402524ee0064da32a14a4b6a24057302"},"schema_version":"1.0"},"canonical_sha256":"f9fa47691715e1546d6ea71c4db148881ad54e8373d4dd98fbfb0be3de3bf48f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.545079Z","signature_b64":"jziOTYxiZGpzdRwv5Z6fGz/lAAvrfI8scWqkAmK3U4IrcBiw0kYTBVegCJWcxJ48wLYZPwfA+K6Ig705OGhvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9fa47691715e1546d6ea71c4db148881ad54e8373d4dd98fbfb0be3de3bf48f","last_reissued_at":"2026-05-18T00:47:56.544679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.544679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02188","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPQkv/PzsY/VDZ+CBP8bTpCzPOCUd3jVVif6rVLunBX8e8FZSBkw2UGTDXxotHtWDHvLGaXm4xHAZMNzin3iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:53:16.825704Z"},"content_sha256":"fa4227ae7362c00b9da2433fb4c814ccae3cfd7c8518aaf32f400dbd0fabb965","schema_version":"1.0","event_id":"sha256:fa4227ae7362c00b9da2433fb4c814ccae3cfd7c8518aaf32f400dbd0fabb965"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7H5EO2IXCXQVI3LOU4OE3MKIRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surjective H-Colouring: New Hardness Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Anthony Stewart, Daniel Paulusma, Matthew Johnson. Barnaby Martin, Petr Golovach","submitted_at":"2017-01-09T14:17:28Z","abstract_excerpt":"A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide whether or not a graph G allows a homomorphism to a fixed graph H. We continue a study on a variant of this problem, namely the Surjective H-Colouring problem, which imposes the homomorphism to be vertex-surjective. We build upon previous results and show that this problem is NP-complete for every connected graph H that has exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02188","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WQLiqx8na8BgahMAxL/SScH3O4AdjbH7WkbMRPW86qZvxug1n/qH42sY8SLv5OJOSMt3Ax8Lv9dFgnfO3oZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:53:16.826063Z"},"content_sha256":"0961f3909a0a7bd17c85c99bcd36c730eb581e2df9f76878061668c009885c7e","schema_version":"1.0","event_id":"sha256:0961f3909a0a7bd17c85c99bcd36c730eb581e2df9f76878061668c009885c7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA/bundle.json","state_url":"https://pith.science/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA/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-31T13:53:16Z","links":{"resolver":"https://pith.science/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA","bundle":"https://pith.science/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA/bundle.json","state":"https://pith.science/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7H5EO2IXCXQVI3LOU4OE3MKIRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7H5EO2IXCXQVI3LOU4OE3MKIRA","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":"de4262ac668e2567b786081eef0a8f17402524ee0064da32a14a4b6a24057302","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T14:17:28Z","title_canon_sha256":"8d0406a77600a131ecd79b74ab63cb19d55fc5543c80d25f0ce81be78ddef382"},"schema_version":"1.0","source":{"id":"1701.02188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02188","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02188v2","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02188","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"7H5EO2IXCXQV","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7H5EO2IXCXQVI3LO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7H5EO2IX","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:0961f3909a0a7bd17c85c99bcd36c730eb581e2df9f76878061668c009885c7e","target":"graph","created_at":"2026-05-18T00:47:56Z","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":"A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide whether or not a graph G allows a homomorphism to a fixed graph H. We continue a study on a variant of this problem, namely the Surjective H-Colouring problem, which imposes the homomorphism to be vertex-surjective. We build upon previous results and show that this problem is NP-complete for every connected graph H that has exac","authors_text":"Anthony Stewart, Daniel Paulusma, Matthew Johnson. Barnaby Martin, Petr Golovach","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T14:17:28Z","title":"Surjective H-Colouring: New Hardness Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02188","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:fa4227ae7362c00b9da2433fb4c814ccae3cfd7c8518aaf32f400dbd0fabb965","target":"record","created_at":"2026-05-18T00:47:56Z","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":"de4262ac668e2567b786081eef0a8f17402524ee0064da32a14a4b6a24057302","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-09T14:17:28Z","title_canon_sha256":"8d0406a77600a131ecd79b74ab63cb19d55fc5543c80d25f0ce81be78ddef382"},"schema_version":"1.0","source":{"id":"1701.02188","kind":"arxiv","version":2}},"canonical_sha256":"f9fa47691715e1546d6ea71c4db148881ad54e8373d4dd98fbfb0be3de3bf48f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9fa47691715e1546d6ea71c4db148881ad54e8373d4dd98fbfb0be3de3bf48f","first_computed_at":"2026-05-18T00:47:56.544679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:56.544679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jziOTYxiZGpzdRwv5Z6fGz/lAAvrfI8scWqkAmK3U4IrcBiw0kYTBVegCJWcxJ48wLYZPwfA+K6Ig705OGhvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:56.545079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa4227ae7362c00b9da2433fb4c814ccae3cfd7c8518aaf32f400dbd0fabb965","sha256:0961f3909a0a7bd17c85c99bcd36c730eb581e2df9f76878061668c009885c7e"],"state_sha256":"ca9962a57f53783248c8c56c73949cca8189278daa97fc7fb9e4cf0d6754ab9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHU1ZBYuBv3FBVRDGR9uqmh5o4RhTEis5RgPujZEeYrGk6kc2+FcQQgRbNR8MGHSIoozWoARY7qIFup+mxz+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:53:16.828653Z","bundle_sha256":"3e2c61ac9a9fa7e3e6c83ff18ff5a1310f0a4bcafa615fb23ce59e1ac51944f5"}}