{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F76WM5LMM7OVO4WC44O6HOMXJW","short_pith_number":"pith:F76WM5LM","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"},"canonical_sha256":"2ffd66756c67dd5772c2e71de3b9974d8fcc4cb7fb4e593308cb16f63a97fa5a","source":{"kind":"arxiv","id":"1301.2880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2880","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2880v1","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2880","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"pith_short_12","alias_value":"F76WM5LMM7OV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F76WM5LMM7OVO4WC","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F76WM5LM","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F76WM5LMM7OVO4WC44O6HOMXJW","target":"record","payload":{"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"},"canonical_sha256":"2ffd66756c67dd5772c2e71de3b9974d8fcc4cb7fb4e593308cb16f63a97fa5a","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"},"source_kind":"arxiv","source_id":"1301.2880","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sK7VcNX/OZD+T0ENNonZ1rqoir90RgZqOaKxug7sORXZYIlXlxV38UidE3+c1etOk7+XCdp+9MfrcYL9YWdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:01:04.527252Z"},"content_sha256":"9d3898b14c358babac4b9340ce42428e54f925fba23ff847b12e797296f06d9e","schema_version":"1.0","event_id":"sha256:9d3898b14c358babac4b9340ce42428e54f925fba23ff847b12e797296f06d9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F76WM5LMM7OVO4WC44O6HOMXJW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:36:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XamVU5Ck57A150rUqGVTYyJP/oSiXrQyRIaeDb81PO3n9AheqWYOA8K25QOBuy+cW+FRiG48IrutasTV3aU+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:01:04.527625Z"},"content_sha256":"a03fa087a2c73a341a1942ffcc23f0b6dfe8c34975fce3bf73b84844365efbdd","schema_version":"1.0","event_id":"sha256:a03fa087a2c73a341a1942ffcc23f0b6dfe8c34975fce3bf73b84844365efbdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/bundle.json","state_url":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F76WM5LMM7OVO4WC44O6HOMXJW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T04:01:04Z","links":{"resolver":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW","bundle":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/bundle.json","state":"https://pith.science/pith/F76WM5LMM7OVO4WC44O6HOMXJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F76WM5LMM7OVO4WC44O6HOMXJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F76WM5LMM7OVO4WC44O6HOMXJW","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":"df50e30373bb7fba0d1fde7f1e537cf8b2e6ada0e59401e759e1c3d9b55656c1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-14T08:02:59Z","title_canon_sha256":"f843d963454d3514b4c30fa1ffc746d976697f6e8dcd653274269fca70278993"},"schema_version":"1.0","source":{"id":"1301.2880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2880","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2880v1","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2880","created_at":"2026-05-18T03:36:34Z"},{"alias_kind":"pith_short_12","alias_value":"F76WM5LMM7OV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F76WM5LMM7OVO4WC","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F76WM5LM","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:a03fa087a2c73a341a1942ffcc23f0b6dfe8c34975fce3bf73b84844365efbdd","target":"graph","created_at":"2026-05-18T03:36:34Z","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":"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","authors_text":"Colin McQuillan","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-14T08:02:59Z","title":"Approximating Holant problems by winding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2880","kind":"arxiv","version":1},"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:9d3898b14c358babac4b9340ce42428e54f925fba23ff847b12e797296f06d9e","target":"record","created_at":"2026-05-18T03:36:34Z","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":"df50e30373bb7fba0d1fde7f1e537cf8b2e6ada0e59401e759e1c3d9b55656c1","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-14T08:02:59Z","title_canon_sha256":"f843d963454d3514b4c30fa1ffc746d976697f6e8dcd653274269fca70278993"},"schema_version":"1.0","source":{"id":"1301.2880","kind":"arxiv","version":1}},"canonical_sha256":"2ffd66756c67dd5772c2e71de3b9974d8fcc4cb7fb4e593308cb16f63a97fa5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ffd66756c67dd5772c2e71de3b9974d8fcc4cb7fb4e593308cb16f63a97fa5a","first_computed_at":"2026-05-18T03:36:34.844335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:34.844335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PhJc3VGfMTnc89+2SLEXmjufpWKhBgovk5wDI9+of7VaXMulDAXoBswShlVob0zghRGPrRfq1dlBHqVx7C2ZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:34.845101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d3898b14c358babac4b9340ce42428e54f925fba23ff847b12e797296f06d9e","sha256:a03fa087a2c73a341a1942ffcc23f0b6dfe8c34975fce3bf73b84844365efbdd"],"state_sha256":"b673424a7991e96d6cbcbaef55a1f69f05e09e8133a7ad274b7260330f42989d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvCQLQWVcI/ZCxk1R49mG7AuDCezUAUD5HqCpzNCoyDxUh/goYpqjmeXwbhx9OPGjZtH6b/SgGOxJsjC9V1PDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T04:01:04.529561Z","bundle_sha256":"6093cc59424c6158044f74b151e069dfd46d2174a1c479e3c5981446b11e3385"}}