{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O7PXWVRG3JBM55UFKPEWP6WXV5","short_pith_number":"pith:O7PXWVRG","canonical_record":{"source":{"id":"1807.09129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T14:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"7108e65caa2a40dfb18aee255bb24227dfbea45688701424735bc7cf271c1de1","abstract_canon_sha256":"16db175593a93e01587149297c67cfa84f624de1fa988b2cc58ac225cc08f188"},"schema_version":"1.0"},"canonical_sha256":"77df7b5626da42cef68553c967fad7af4965bef38dd8db0a7387120043d995a3","source":{"kind":"arxiv","id":"1807.09129","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09129","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09129v2","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09129","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"O7PXWVRG3JBM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7PXWVRG3JBM55UF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7PXWVRG","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O7PXWVRG3JBM55UFKPEWP6WXV5","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09129","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T14:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"7108e65caa2a40dfb18aee255bb24227dfbea45688701424735bc7cf271c1de1","abstract_canon_sha256":"16db175593a93e01587149297c67cfa84f624de1fa988b2cc58ac225cc08f188"},"schema_version":"1.0"},"canonical_sha256":"77df7b5626da42cef68553c967fad7af4965bef38dd8db0a7387120043d995a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:53.683267Z","signature_b64":"HC39J3qTj57vXfEUVWDgK5TSv3k4a/xIpSLwq6MZKwR3SfOH9ED3uFh3FgAjASDSy+Oe12m3j2lL2xqSKlyCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77df7b5626da42cef68553c967fad7af4965bef38dd8db0a7387120043d995a3","last_reissued_at":"2026-05-18T00:08:53.682592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:53.682592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09129","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:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvYXsbQasoVC+wY18K7qf5/ZZiZf7T+0JBTvvYpYX4HUyvLa+zauGc9sUvceYlebqhtzm+KpgD2gHRPgmWZ+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:35:35.723938Z"},"content_sha256":"9a40c5a5a5d160baebb9237aa8b18cee556b40b893048d1db9e6b814b403865d","schema_version":"1.0","event_id":"sha256:9a40c5a5a5d160baebb9237aa8b18cee556b40b893048d1db9e6b814b403865d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O7PXWVRG3JBM55UFKPEWP6WXV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zeros of Holant problems: locations and algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chao Liao, Chihao Zhang, Heng Guo, Pinyan Lu","submitted_at":"2018-07-24T14:03:05Z","abstract_excerpt":"We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases. As a consequence, any non-negative Holant problem on cubic graphs has an efficient approximation algorithm unless the problem is equivalent to approximately counting perfect matchings, a central open problem in the area. This is in sharp contrast to the computational phase transition shown by 2-state spin systems on cubic graphs. Our main technique is the rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09129","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:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm+iNt1O45/+oZqmE9TEa94a7mk2B1yTJep1l9n9JLwVDR4VlSJDsP+fxZx26HMJi5X/Jp8f9T1AVmtho9pIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:35:35.724585Z"},"content_sha256":"570ee074805916f169f9b24694798956279f910b1aba20e4ba6b2d85be1d8636","schema_version":"1.0","event_id":"sha256:570ee074805916f169f9b24694798956279f910b1aba20e4ba6b2d85be1d8636"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/bundle.json","state_url":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/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-30T12:35:35Z","links":{"resolver":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5","bundle":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/bundle.json","state":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O7PXWVRG3JBM55UFKPEWP6WXV5","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":"16db175593a93e01587149297c67cfa84f624de1fa988b2cc58ac225cc08f188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T14:03:05Z","title_canon_sha256":"7108e65caa2a40dfb18aee255bb24227dfbea45688701424735bc7cf271c1de1"},"schema_version":"1.0","source":{"id":"1807.09129","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09129","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09129v2","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09129","created_at":"2026-05-18T00:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"O7PXWVRG3JBM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7PXWVRG3JBM55UF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7PXWVRG","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:570ee074805916f169f9b24694798956279f910b1aba20e4ba6b2d85be1d8636","target":"graph","created_at":"2026-05-18T00:08:53Z","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 present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases. As a consequence, any non-negative Holant problem on cubic graphs has an efficient approximation algorithm unless the problem is equivalent to approximately counting perfect matchings, a central open problem in the area. This is in sharp contrast to the computational phase transition shown by 2-state spin systems on cubic graphs. Our main technique is the rec","authors_text":"Chao Liao, Chihao Zhang, Heng Guo, Pinyan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T14:03:05Z","title":"Zeros of Holant problems: locations and algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09129","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:9a40c5a5a5d160baebb9237aa8b18cee556b40b893048d1db9e6b814b403865d","target":"record","created_at":"2026-05-18T00:08:53Z","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":"16db175593a93e01587149297c67cfa84f624de1fa988b2cc58ac225cc08f188","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-24T14:03:05Z","title_canon_sha256":"7108e65caa2a40dfb18aee255bb24227dfbea45688701424735bc7cf271c1de1"},"schema_version":"1.0","source":{"id":"1807.09129","kind":"arxiv","version":2}},"canonical_sha256":"77df7b5626da42cef68553c967fad7af4965bef38dd8db0a7387120043d995a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77df7b5626da42cef68553c967fad7af4965bef38dd8db0a7387120043d995a3","first_computed_at":"2026-05-18T00:08:53.682592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:53.682592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HC39J3qTj57vXfEUVWDgK5TSv3k4a/xIpSLwq6MZKwR3SfOH9ED3uFh3FgAjASDSy+Oe12m3j2lL2xqSKlyCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:53.683267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09129","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a40c5a5a5d160baebb9237aa8b18cee556b40b893048d1db9e6b814b403865d","sha256:570ee074805916f169f9b24694798956279f910b1aba20e4ba6b2d85be1d8636"],"state_sha256":"f1cb419026f4426cb3611a11b9c285af267aca27e3e2dd469474e7ac870f9dbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h838pkDQxtyjpMsyWo0VRScSa4CC/3Hoce4HbByZwO+YJwuNYFchv9Qdp6hX/fdTdr3k7iRjrDY1Ab0RiNDGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:35:35.727500Z","bundle_sha256":"5f3926f2da212bc2da55821ac201635fff9cc98c2be78b4516fbd50c0f0b11a6"}}