{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JWL7J3L2EZ3ANHNQAR3GNKGZWI","short_pith_number":"pith:JWL7J3L2","canonical_record":{"source":{"id":"1611.00975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T12:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"860afd5bd94528de5427d579c7b24c4d5ccc128140415f6a83e84edb0469a493","abstract_canon_sha256":"a914451cef7ce4070ab9eb2183131da4f07a7084dabf55b3b97a04fe5d8765d6"},"schema_version":"1.0"},"canonical_sha256":"4d97f4ed7a2676069db0047666a8d9b2071ecc28dc28891f393e4948aef3cd48","source":{"kind":"arxiv","id":"1611.00975","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00975","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00975v2","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00975","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"JWL7J3L2EZ3A","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JWL7J3L2EZ3ANHNQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JWL7J3L2","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JWL7J3L2EZ3ANHNQAR3GNKGZWI","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T12:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"860afd5bd94528de5427d579c7b24c4d5ccc128140415f6a83e84edb0469a493","abstract_canon_sha256":"a914451cef7ce4070ab9eb2183131da4f07a7084dabf55b3b97a04fe5d8765d6"},"schema_version":"1.0"},"canonical_sha256":"4d97f4ed7a2676069db0047666a8d9b2071ecc28dc28891f393e4948aef3cd48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:30.838110Z","signature_b64":"3R+UewJJKCoK1a8MSE5Oq21j/DkYJT8e1MUx1SViDXDs2bokqGxJJmAyYGVTmAqYd0aI4rQgOSyN7Kje8Ff+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d97f4ed7a2676069db0047666a8d9b2071ecc28dc28891f393e4948aef3cd48","last_reissued_at":"2026-05-18T00:50:30.837437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:30.837437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00975","source_version":2,"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-18T00:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSLrFuHNpdqTmQxrRXpazaxWMuxKJbJbCou57S4Icgaml4hGFoEII++xDGZT6ShnubO/Xugo8adSOFTa2mVZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:23:02.967025Z"},"content_sha256":"0b33f89626eaac76b4090c115a6a51fe0176a31299d7003cfb2440d9c92e28f8","schema_version":"1.0","event_id":"sha256:0b33f89626eaac76b4090c115a6a51fe0176a31299d7003cfb2440d9c92e28f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JWL7J3L2EZ3ANHNQAR3GNKGZWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Holant Problems over Boolean Domain with Non-negative Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hanpin Wang, Jiabao Lin","submitted_at":"2016-11-03T12:23:59Z","abstract_excerpt":"Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain with non-negative weights. It is the first complete Holant dichotomy where constraint functions are not necessarily symmetric.\n  Holant problems are indeed read-twice $\\#$CSPs. Intuitively, some $\\#$CSPs that are $\\#$P-hard become tractable when restricting to read-twice instances. To capture them, we introduce the Block-rank-one condition. It turns out that the condition leads to a clear separation. If a function set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00975","kind":"arxiv","version":2},"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-18T00:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sB0o6MAr+WpHd7ZGZq7k+oJ2tKT7WyoMHL7bDR3OQP9Pb9387FwBwU4ui0el9smCZfy6xeyj32S6meaOc8zKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:23:02.967381Z"},"content_sha256":"f3b58645d3d76a00d24750b9d4e56a144b800537a96dfc32eed49ed82cc7a385","schema_version":"1.0","event_id":"sha256:f3b58645d3d76a00d24750b9d4e56a144b800537a96dfc32eed49ed82cc7a385"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI/bundle.json","state_url":"https://pith.science/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI/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-05-30T19:23:02Z","links":{"resolver":"https://pith.science/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI","bundle":"https://pith.science/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI/bundle.json","state":"https://pith.science/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWL7J3L2EZ3ANHNQAR3GNKGZWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JWL7J3L2EZ3ANHNQAR3GNKGZWI","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":"a914451cef7ce4070ab9eb2183131da4f07a7084dabf55b3b97a04fe5d8765d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T12:23:59Z","title_canon_sha256":"860afd5bd94528de5427d579c7b24c4d5ccc128140415f6a83e84edb0469a493"},"schema_version":"1.0","source":{"id":"1611.00975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00975","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00975v2","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00975","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"JWL7J3L2EZ3A","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JWL7J3L2EZ3ANHNQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JWL7J3L2","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:f3b58645d3d76a00d24750b9d4e56a144b800537a96dfc32eed49ed82cc7a385","target":"graph","created_at":"2026-05-18T00:50:30Z","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":"Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain with non-negative weights. It is the first complete Holant dichotomy where constraint functions are not necessarily symmetric.\n  Holant problems are indeed read-twice $\\#$CSPs. Intuitively, some $\\#$CSPs that are $\\#$P-hard become tractable when restricting to read-twice instances. To capture them, we introduce the Block-rank-one condition. It turns out that the condition leads to a clear separation. If a function set ","authors_text":"Hanpin Wang, Jiabao Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T12:23:59Z","title":"The Complexity of Holant Problems over Boolean Domain with Non-negative Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00975","kind":"arxiv","version":2},"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:0b33f89626eaac76b4090c115a6a51fe0176a31299d7003cfb2440d9c92e28f8","target":"record","created_at":"2026-05-18T00:50:30Z","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":"a914451cef7ce4070ab9eb2183131da4f07a7084dabf55b3b97a04fe5d8765d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T12:23:59Z","title_canon_sha256":"860afd5bd94528de5427d579c7b24c4d5ccc128140415f6a83e84edb0469a493"},"schema_version":"1.0","source":{"id":"1611.00975","kind":"arxiv","version":2}},"canonical_sha256":"4d97f4ed7a2676069db0047666a8d9b2071ecc28dc28891f393e4948aef3cd48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d97f4ed7a2676069db0047666a8d9b2071ecc28dc28891f393e4948aef3cd48","first_computed_at":"2026-05-18T00:50:30.837437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:30.837437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3R+UewJJKCoK1a8MSE5Oq21j/DkYJT8e1MUx1SViDXDs2bokqGxJJmAyYGVTmAqYd0aI4rQgOSyN7Kje8Ff+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:30.838110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b33f89626eaac76b4090c115a6a51fe0176a31299d7003cfb2440d9c92e28f8","sha256:f3b58645d3d76a00d24750b9d4e56a144b800537a96dfc32eed49ed82cc7a385"],"state_sha256":"1cb930264c0535dab2893f1ca578c9095c1a3b61b0846ec1e1210f4a69039572"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MH1iPYqoOQRADEnXz6U1ovs9mHX8pKVNNcOV4Al2V9N7/RrxAXrlkPbJuYXtJFyJGKLcWFDaXlcSCKp2j4XBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:23:02.969349Z","bundle_sha256":"5a2913880a611756568dc2c5aaa92c92a4faf1984c231a391848ae32a67166e4"}}