{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L5KJDOJZGVDA27PIGSSHM24DFN","short_pith_number":"pith:L5KJDOJZ","schema_version":"1.0","canonical_sha256":"5f5491b93935460d7de834a4766b832b5906f6afba1eba8aee749a11ee948d6d","source":{"kind":"arxiv","id":"1501.07539","version":4},"attestation_state":"computed","paper":{"title":"Counting Homomorphisms to Square-Free Graphs, Modulo 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Andreas G\\\"obel, David Richerby, Leslie Ann Goldberg","submitted_at":"2015-01-29T18:35:52Z","abstract_excerpt":"We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than is the case for exact (non-modular) counting, so subtle dichotomy theorems can arise. We show the following dichotomy: for any $H$ that contains no 4-cycles, HomsTo$H$ is either in polynomial time or is $\\oplus P$-complete. This confirms a conjecture of Faben and Jerrum that was previously only known to hold for trees and for a restricted class of treewidth-2"},"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":"1501.07539","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-29T18:35:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"89a45066c926f461e07404ee5572ae407fedb011d498c245df580c60fcd6e18c","abstract_canon_sha256":"cd5765b829f0c5855e899ed285e79dce545b6e374972fd98137369ca4e8bc2e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.366449Z","signature_b64":"hFXBVfUHIuBrQPolPng54h2C8PkNbjNdfELb0TZGakQ33ZUEv05xZQ/BocA6ezLAoWYh48RkfnAlyF+HODgBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f5491b93935460d7de834a4766b832b5906f6afba1eba8aee749a11ee948d6d","last_reissued_at":"2026-05-18T01:34:45.365778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.365778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Homomorphisms to Square-Free Graphs, Modulo 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Andreas G\\\"obel, David Richerby, Leslie Ann Goldberg","submitted_at":"2015-01-29T18:35:52Z","abstract_excerpt":"We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than is the case for exact (non-modular) counting, so subtle dichotomy theorems can arise. We show the following dichotomy: for any $H$ that contains no 4-cycles, HomsTo$H$ is either in polynomial time or is $\\oplus P$-complete. This confirms a conjecture of Faben and Jerrum that was previously only known to hold for trees and for a restricted class of treewidth-2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07539","kind":"arxiv","version":4},"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":"1501.07539","created_at":"2026-05-18T01:34:45.365872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07539v4","created_at":"2026-05-18T01:34:45.365872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07539","created_at":"2026-05-18T01:34:45.365872+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5KJDOJZGVDA","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5KJDOJZGVDA27PI","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5KJDOJZ","created_at":"2026-05-18T12:29:29.992203+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/L5KJDOJZGVDA27PIGSSHM24DFN","json":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN.json","graph_json":"https://pith.science/api/pith-number/L5KJDOJZGVDA27PIGSSHM24DFN/graph.json","events_json":"https://pith.science/api/pith-number/L5KJDOJZGVDA27PIGSSHM24DFN/events.json","paper":"https://pith.science/paper/L5KJDOJZ"},"agent_actions":{"view_html":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN","download_json":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN.json","view_paper":"https://pith.science/paper/L5KJDOJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07539&json=true","fetch_graph":"https://pith.science/api/pith-number/L5KJDOJZGVDA27PIGSSHM24DFN/graph.json","fetch_events":"https://pith.science/api/pith-number/L5KJDOJZGVDA27PIGSSHM24DFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN/action/storage_attestation","attest_author":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN/action/author_attestation","sign_citation":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN/action/citation_signature","submit_replication":"https://pith.science/pith/L5KJDOJZGVDA27PIGSSHM24DFN/action/replication_record"}},"created_at":"2026-05-18T01:34:45.365872+00:00","updated_at":"2026-05-18T01:34:45.365872+00:00"}