{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SAO4YEYNUZMCWA5XP33SXLCUWE","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":"82935e2046911d49d308ef58aab61302f6416e43ac0f71e76b2c345ea26ed135","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-01T23:02:31Z","title_canon_sha256":"aedc8f8342ee88ab7d4a52491614b1e1419e09561e6317758c3a6dbc252e6f04"},"schema_version":"1.0","source":{"id":"1307.0556","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0556","created_at":"2026-05-18T02:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0556v4","created_at":"2026-05-18T02:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0556","created_at":"2026-05-18T02:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"SAO4YEYNUZMC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SAO4YEYNUZMCWA5X","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SAO4YEYN","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:27145d2134ada1a782f67cee6ebc3e208ab8ced3f68916447a5b8a5aef61a530","target":"graph","created_at":"2026-05-18T02:41:58Z","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 function from V(G) to V(H) that preserves edges. Many combinatorial structures that arise in mathematics and computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this paper, we study the complexity of counting homomorphisms modulo 2. The complexity of modular counting was introduced by Papadimitriou and Zachos and it has been pioneered by Valiant who famously introduced a problem for which counting modulo 7 is easy but counting modulo 2 is intractable. Modular counting provides a ric","authors_text":"Andreas G\\\"obel, David Richerby, Leslie Ann Goldberg","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-01T23:02:31Z","title":"The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0556","kind":"arxiv","version":4},"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:2b5b7591ce29529d22b2f0d15857413c7209a1fd1c406d95460f51e13c000dd9","target":"record","created_at":"2026-05-18T02:41:58Z","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":"82935e2046911d49d308ef58aab61302f6416e43ac0f71e76b2c345ea26ed135","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-01T23:02:31Z","title_canon_sha256":"aedc8f8342ee88ab7d4a52491614b1e1419e09561e6317758c3a6dbc252e6f04"},"schema_version":"1.0","source":{"id":"1307.0556","kind":"arxiv","version":4}},"canonical_sha256":"901dcc130da6582b03b77ef72bac54b13be957de0461383d8c041009d4b42392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901dcc130da6582b03b77ef72bac54b13be957de0461383d8c041009d4b42392","first_computed_at":"2026-05-18T02:41:58.391648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:58.391648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3mS6qXL/V571ZmAZOwoIIXWBo/SO5W/rV1t+sTRsJdxAdQ2m1mBZ1e0boNQIILm9nlgpu8hmidSjlIOp/m2aAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:58.392076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0556","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b5b7591ce29529d22b2f0d15857413c7209a1fd1c406d95460f51e13c000dd9","sha256:27145d2134ada1a782f67cee6ebc3e208ab8ced3f68916447a5b8a5aef61a530"],"state_sha256":"9fd070f115098cf625662606b728cc5aa56018278e6720ff12209f5b5e21ea9a"}