{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OOEM4BX4IDJQ6MJDLS2YUMSO3W","short_pith_number":"pith:OOEM4BX4","schema_version":"1.0","canonical_sha256":"7388ce06fc40d30f31235cb58a324eddb96729e947f4d171ec90eae9e57fb5b3","source":{"kind":"arxiv","id":"1412.0423","version":1},"attestation_state":"computed","paper":{"title":"Dichotomy Theorems for Homomorphism Polynomials of Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christian Engels","submitted_at":"2014-12-01T11:01:14Z","abstract_excerpt":"In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class, homomorphic to this $H$. These graphs will be encoded by a family of polynomials.\n  We give dichotomies for the polynomials for cycles, cliques, trees, outerplanar graphs, planar graphs and graphs of bounded genus."},"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":"1412.0423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-01T11:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"5eb3885bb4c5b11787a24e8e9a063e85324b19b393ee0efda2aa62b00d00590d","abstract_canon_sha256":"725d66afe013331c9e1824e8a5af0d8b4df2e17886df9d291b6b5d6c50e78df7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:27.906662Z","signature_b64":"9Cq8+Jo6FHnO7oOPi9nKLUr4y8Tr6LteyynzO82JjF9ABxRQksB+z/14NuWos5XPXPn8MIcESqg1T9zGVfgxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7388ce06fc40d30f31235cb58a324eddb96729e947f4d171ec90eae9e57fb5b3","last_reissued_at":"2026-05-18T02:32:27.906273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:27.906273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dichotomy Theorems for Homomorphism Polynomials of Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christian Engels","submitted_at":"2014-12-01T11:01:14Z","abstract_excerpt":"In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class, homomorphic to this $H$. These graphs will be encoded by a family of polynomials.\n  We give dichotomies for the polynomials for cycles, cliques, trees, outerplanar graphs, planar graphs and graphs of bounded genus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0423","kind":"arxiv","version":1},"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":"1412.0423","created_at":"2026-05-18T02:32:27.906345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0423v1","created_at":"2026-05-18T02:32:27.906345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0423","created_at":"2026-05-18T02:32:27.906345+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOEM4BX4IDJQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOEM4BX4IDJQ6MJD","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOEM4BX4","created_at":"2026-05-18T12:28:41.024544+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/OOEM4BX4IDJQ6MJDLS2YUMSO3W","json":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W.json","graph_json":"https://pith.science/api/pith-number/OOEM4BX4IDJQ6MJDLS2YUMSO3W/graph.json","events_json":"https://pith.science/api/pith-number/OOEM4BX4IDJQ6MJDLS2YUMSO3W/events.json","paper":"https://pith.science/paper/OOEM4BX4"},"agent_actions":{"view_html":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W","download_json":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W.json","view_paper":"https://pith.science/paper/OOEM4BX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0423&json=true","fetch_graph":"https://pith.science/api/pith-number/OOEM4BX4IDJQ6MJDLS2YUMSO3W/graph.json","fetch_events":"https://pith.science/api/pith-number/OOEM4BX4IDJQ6MJDLS2YUMSO3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W/action/storage_attestation","attest_author":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W/action/author_attestation","sign_citation":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W/action/citation_signature","submit_replication":"https://pith.science/pith/OOEM4BX4IDJQ6MJDLS2YUMSO3W/action/replication_record"}},"created_at":"2026-05-18T02:32:27.906345+00:00","updated_at":"2026-05-18T02:32:27.906345+00:00"}