{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O7PXWVRG3JBM55UFKPEWP6WXV5","short_pith_number":"pith:O7PXWVRG","schema_version":"1.0","canonical_sha256":"77df7b5626da42cef68553c967fad7af4965bef38dd8db0a7387120043d995a3","source":{"kind":"arxiv","id":"1807.09129","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.09129","created_at":"2026-05-18T00:08:53.682695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09129v2","created_at":"2026-05-18T00:08:53.682695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09129","created_at":"2026-05-18T00:08:53.682695+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7PXWVRG3JBM","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7PXWVRG3JBM55UF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7PXWVRG","created_at":"2026-05-18T12:32:43.782077+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/O7PXWVRG3JBM55UFKPEWP6WXV5","json":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5.json","graph_json":"https://pith.science/api/pith-number/O7PXWVRG3JBM55UFKPEWP6WXV5/graph.json","events_json":"https://pith.science/api/pith-number/O7PXWVRG3JBM55UFKPEWP6WXV5/events.json","paper":"https://pith.science/paper/O7PXWVRG"},"agent_actions":{"view_html":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5","download_json":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5.json","view_paper":"https://pith.science/paper/O7PXWVRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09129&json=true","fetch_graph":"https://pith.science/api/pith-number/O7PXWVRG3JBM55UFKPEWP6WXV5/graph.json","fetch_events":"https://pith.science/api/pith-number/O7PXWVRG3JBM55UFKPEWP6WXV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/action/storage_attestation","attest_author":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/action/author_attestation","sign_citation":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/action/citation_signature","submit_replication":"https://pith.science/pith/O7PXWVRG3JBM55UFKPEWP6WXV5/action/replication_record"}},"created_at":"2026-05-18T00:08:53.682695+00:00","updated_at":"2026-05-18T00:08:53.682695+00:00"}