{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7WUES3GHL574FGAUTGQS6ZZ6QJ","short_pith_number":"pith:7WUES3GH","canonical_record":{"source":{"id":"1709.09486","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-27T13:15:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2aeab9ae36ae18040dc924e0f3c18dd2bb42c2d288f473653acf0af8e700b6fa","abstract_canon_sha256":"d31afe11476370a85d431c8cbb904b00c2b057ac9c637e4380ab54fbbbea94d5"},"schema_version":"1.0"},"canonical_sha256":"fda8496cc75f7fc2981499a12f673e8257be462232c5054965d819d6c7b592ef","source":{"kind":"arxiv","id":"1709.09486","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09486","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09486v2","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09486","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"pith_short_12","alias_value":"7WUES3GHL574","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7WUES3GHL574FGAU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7WUES3GH","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7WUES3GHL574FGAUTGQS6ZZ6QJ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.09486","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-27T13:15:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2aeab9ae36ae18040dc924e0f3c18dd2bb42c2d288f473653acf0af8e700b6fa","abstract_canon_sha256":"d31afe11476370a85d431c8cbb904b00c2b057ac9c637e4380ab54fbbbea94d5"},"schema_version":"1.0"},"canonical_sha256":"fda8496cc75f7fc2981499a12f673e8257be462232c5054965d819d6c7b592ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:09.172562Z","signature_b64":"CRWGvDYvJ8dghC1K5ciSvRXFCWnmzN05j0mKFQWLdZHJSHApcsCQ6ZzDDqaqT2i7e+KY+Ug1U0kDFZNqY6OUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda8496cc75f7fc2981499a12f673e8257be462232c5054965d819d6c7b592ef","last_reissued_at":"2026-05-18T00:27:09.172011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:09.172011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.09486","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:27:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7YF65Ij1iEFlllS3QEzU5GusYD6gmmzA7obAyS9nz/aaV90rgbFtKyjxF9LxVSsDy9pTn+/P1dr2YhRL5VkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:33:48.356182Z"},"content_sha256":"60531d090fa53140be95264d85dc36a0cfa4070738e508b943b8c414516ab185","schema_version":"1.0","event_id":"sha256:60531d090fa53140be95264d85dc36a0cfa4070738e508b943b8c414516ab185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7WUES3GHL574FGAUTGQS6ZZ6QJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surjective H-Colouring over Reflexive Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Benoit Larose, Daniel Paulusma","submitted_at":"2017-09-27T13:15:38Z","abstract_excerpt":"The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theoretic classifications of Surjective H-Colouring in the case of reflexive digraphs.\n  Chen [2014] proved, in the setting of constraint satisfaction problems, that Surjective H-Colouring is NP-complete if "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09486","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:27:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItnUFNYRlfXRGJiF7kqF5WGdNMofAkKnbl+0aam/mdvzcZTToliH/IxSZ++pRwQ6AUJ/N5sWx+nC7XqKU6BJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:33:48.356540Z"},"content_sha256":"8bcccf7f4efc5d6c0ef8abf336361c19074d4fac6826273f0609b1c2a88a890b","schema_version":"1.0","event_id":"sha256:8bcccf7f4efc5d6c0ef8abf336361c19074d4fac6826273f0609b1c2a88a890b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ/bundle.json","state_url":"https://pith.science/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ/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-06-03T01:33:48Z","links":{"resolver":"https://pith.science/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ","bundle":"https://pith.science/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ/bundle.json","state":"https://pith.science/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WUES3GHL574FGAUTGQS6ZZ6QJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7WUES3GHL574FGAUTGQS6ZZ6QJ","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":"d31afe11476370a85d431c8cbb904b00c2b057ac9c637e4380ab54fbbbea94d5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-27T13:15:38Z","title_canon_sha256":"2aeab9ae36ae18040dc924e0f3c18dd2bb42c2d288f473653acf0af8e700b6fa"},"schema_version":"1.0","source":{"id":"1709.09486","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09486","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09486v2","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09486","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"pith_short_12","alias_value":"7WUES3GHL574","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7WUES3GHL574FGAU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7WUES3GH","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:8bcccf7f4efc5d6c0ef8abf336361c19074d4fac6826273f0609b1c2a88a890b","target":"graph","created_at":"2026-05-18T00:27:09Z","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 H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theoretic classifications of Surjective H-Colouring in the case of reflexive digraphs.\n  Chen [2014] proved, in the setting of constraint satisfaction problems, that Surjective H-Colouring is NP-complete if ","authors_text":"Barnaby Martin, Benoit Larose, Daniel Paulusma","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-27T13:15:38Z","title":"Surjective H-Colouring over Reflexive Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09486","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:60531d090fa53140be95264d85dc36a0cfa4070738e508b943b8c414516ab185","target":"record","created_at":"2026-05-18T00:27:09Z","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":"d31afe11476370a85d431c8cbb904b00c2b057ac9c637e4380ab54fbbbea94d5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-27T13:15:38Z","title_canon_sha256":"2aeab9ae36ae18040dc924e0f3c18dd2bb42c2d288f473653acf0af8e700b6fa"},"schema_version":"1.0","source":{"id":"1709.09486","kind":"arxiv","version":2}},"canonical_sha256":"fda8496cc75f7fc2981499a12f673e8257be462232c5054965d819d6c7b592ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fda8496cc75f7fc2981499a12f673e8257be462232c5054965d819d6c7b592ef","first_computed_at":"2026-05-18T00:27:09.172011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:09.172011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CRWGvDYvJ8dghC1K5ciSvRXFCWnmzN05j0mKFQWLdZHJSHApcsCQ6ZzDDqaqT2i7e+KY+Ug1U0kDFZNqY6OUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:09.172562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09486","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60531d090fa53140be95264d85dc36a0cfa4070738e508b943b8c414516ab185","sha256:8bcccf7f4efc5d6c0ef8abf336361c19074d4fac6826273f0609b1c2a88a890b"],"state_sha256":"153fb90ee809e187575263ad1183d007753a698c1467450576c047a7ab49b290"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ccx7Dl0M8l738mOTL7cTGBD8q7NZOkO9bm/L2ep5VaIPByPCGc/o0cQhJMBUebnSA474cX7DTpdUw5d5UPKCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:33:48.358740Z","bundle_sha256":"8d48f48f8df233b74e1b17682cce557dd9f55a6347d9df2fd2b3114c9ea8f3b2"}}