{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RGKLN2DGOSSUDK4P54F5OMYSR3","short_pith_number":"pith:RGKLN2DG","schema_version":"1.0","canonical_sha256":"8994b6e86674a541ab8fef0bd733128edd6eef156ceb6f82449d819bbf375dec","source":{"kind":"arxiv","id":"1706.08786","version":5},"attestation_state":"computed","paper":{"title":"The Complexity of Counting Surjective Homomorphisms and Compactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny","submitted_at":"2017-06-27T11:25:11Z","abstract_excerpt":"A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the vertices of H and all of the non-loop edges of H. Hell and Nesetril gave a complete characterisation of the complexity of deciding whether there is a homomorphism from an input graph G to a fixed graph H. A complete characterisation is not known for surjective homomorphisms or for compactions, though there are many interesting results. Dyer and Greenhill gave a com"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1706.08786","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-27T11:25:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ba825fa0c3b24592debd440cb6bf2c94cc468e49ce16473ae999cf6339a2e5af","abstract_canon_sha256":"a24994ee757f8342bb84ed7317085c129540ea09afbab9537fc158501da894e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:08.990357Z","signature_b64":"osC/+lzY9TBMethxFrcFfZOGXS4LokAMBChxUDoSdFfImTm5HU/pVuoDYIbwBMKniUuYgbhYj8eCF3IscO9sDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8994b6e86674a541ab8fef0bd733128edd6eef156ceb6f82449d819bbf375dec","last_reissued_at":"2026-05-17T23:42:08.989706Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:08.989706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Counting Surjective Homomorphisms and Compactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Jacob Focke, Leslie Ann Goldberg, Stanislav Zivny","submitted_at":"2017-06-27T11:25:11Z","abstract_excerpt":"A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the vertices of H and all of the non-loop edges of H. Hell and Nesetril gave a complete characterisation of the complexity of deciding whether there is a homomorphism from an input graph G to a fixed graph H. A complete characterisation is not known for surjective homomorphisms or for compactions, though there are many interesting results. Dyer and Greenhill gave a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08786","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08786","created_at":"2026-05-17T23:42:08.989788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08786v5","created_at":"2026-05-17T23:42:08.989788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08786","created_at":"2026-05-17T23:42:08.989788+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGKLN2DGOSSU","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGKLN2DGOSSUDK4P","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGKLN2DG","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3","json":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3.json","graph_json":"https://pith.science/api/pith-number/RGKLN2DGOSSUDK4P54F5OMYSR3/graph.json","events_json":"https://pith.science/api/pith-number/RGKLN2DGOSSUDK4P54F5OMYSR3/events.json","paper":"https://pith.science/paper/RGKLN2DG"},"agent_actions":{"view_html":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3","download_json":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3.json","view_paper":"https://pith.science/paper/RGKLN2DG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08786&json=true","fetch_graph":"https://pith.science/api/pith-number/RGKLN2DGOSSUDK4P54F5OMYSR3/graph.json","fetch_events":"https://pith.science/api/pith-number/RGKLN2DGOSSUDK4P54F5OMYSR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3/action/storage_attestation","attest_author":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3/action/author_attestation","sign_citation":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3/action/citation_signature","submit_replication":"https://pith.science/pith/RGKLN2DGOSSUDK4P54F5OMYSR3/action/replication_record"}},"created_at":"2026-05-17T23:42:08.989788+00:00","updated_at":"2026-05-17T23:42:08.989788+00:00"}