{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F76WM5LMM7OVO4WC44O6HOMXJW","short_pith_number":"pith:F76WM5LM","schema_version":"1.0","canonical_sha256":"2ffd66756c67dd5772c2e71de3b9974d8fcc4cb7fb4e593308cb16f63a97fa5a","source":{"kind":"arxiv","id":"1301.2880","version":1},"attestation_state":"computed","paper":{"title":"Approximating Holant problems by winding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Colin McQuillan","submitted_at":"2013-01-14T08:02:59Z","abstract_excerpt":"We give an FPRAS for Holant problems with parity constraints and not-all-equal constraints, a generalisation of the problem of counting sink-free-orientations. The approach combines a sampler for near-assignments of \"windable\" functions -- using the cycle-unwinding canonical paths technique of Jerrum and Sinclair -- with a bound on the weight of near-assignments. The proof generalises to a larger class of Holant problems; we characterise this class and show that it cannot be extended by expressibility reductions.\n  We then ask whether windability is equivalent to expressibility by matchings ci"},"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":"1301.2880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-14T08:02:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f843d963454d3514b4c30fa1ffc746d976697f6e8dcd653274269fca70278993","abstract_canon_sha256":"df50e30373bb7fba0d1fde7f1e537cf8b2e6ada0e59401e759e1c3d9b55656c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:34.845101Z","signature_b64":"PhJc3VGfMTnc89+2SLEXmjufpWKhBgovk5wDI9+of7VaXMulDAXoBswShlVob0zghRGPrRfq1dlBHqVx7C2ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ffd66756c67dd5772c2e71de3b9974d8fcc4cb7fb4e593308cb16f63a97fa5a","last_reissued_at":"2026-05-18T03:36:34.844335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:34.844335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Holant problems by winding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Colin McQuillan","submitted_at":"2013-01-14T08:02:59Z","abstract_excerpt":"We give an FPRAS for Holant problems with parity constraints and not-all-equal constraints, a generalisation of the problem of counting sink-free-orientations. The approach combines a sampler for near-assignments of \"windable\" functions -- using the cycle-unwinding canonical paths technique of Jerrum and Sinclair -- with a bound on the weight of near-assignments. The proof generalises to a larger class of Holant problems; we characterise this class and show that it cannot be extended by expressibility reductions.\n  We then ask whether windability is equivalent to expressibility by matchings ci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2880","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":"1301.2880","created_at":"2026-05-18T03:36:34.844463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2880v1","created_at":"2026-05-18T03:36:34.844463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2880","created_at":"2026-05-18T03:36:34.844463+00:00"},{"alias_kind":"pith_short_12","alias_value":"F76WM5LMM7OV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"F76WM5LMM7OVO4WC","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"F76WM5LM","created_at":"2026-05-18T12:27:45.050594+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/F76WM5LMM7OVO4WC44O6HOMXJW","json":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW.json","graph_json":"https://pith.science/api/pith-number/F76WM5LMM7OVO4WC44O6HOMXJW/graph.json","events_json":"https://pith.science/api/pith-number/F76WM5LMM7OVO4WC44O6HOMXJW/events.json","paper":"https://pith.science/paper/F76WM5LM"},"agent_actions":{"view_html":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW","download_json":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW.json","view_paper":"https://pith.science/paper/F76WM5LM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2880&json=true","fetch_graph":"https://pith.science/api/pith-number/F76WM5LMM7OVO4WC44O6HOMXJW/graph.json","fetch_events":"https://pith.science/api/pith-number/F76WM5LMM7OVO4WC44O6HOMXJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/action/storage_attestation","attest_author":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/action/author_attestation","sign_citation":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/action/citation_signature","submit_replication":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/action/replication_record"}},"created_at":"2026-05-18T03:36:34.844463+00:00","updated_at":"2026-05-18T03:36:34.844463+00:00"}