{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PEEZ32DQPXMC67Z7N7WBSW7NSS","short_pith_number":"pith:PEEZ32DQ","schema_version":"1.0","canonical_sha256":"79099de8707dd82f7f3f6fec195bed948032471fd0134e89dd2f18e3e93c5832","source":{"kind":"arxiv","id":"2201.12772","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-Time Approximation of Zero-Free Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Penghui Yao, Xinyuan Zhang, Yitong Yin","submitted_at":"2022-01-30T09:54:45Z","abstract_excerpt":"Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free partition functions. Patel and Regts[PR17] later gave a refinement of Barvinok's framework, which gave a polynomial-time algorithm for a class of zero-free graph polynomials that can be expressed as counting induced subgraphs in bounded-degree graphs.\n  In this paper, we give a polynomial-time algorithm for estimating classical and quantum partition functio"},"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":"2201.12772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T09:54:45Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"99038e3430b4c375411463e50d2a8f88168323f7eaf772f52a0fe1ac790a5a0a","abstract_canon_sha256":"5b8484fa618848dc50993c6f70c86e171998fd9fd2e69bb30f49bf6e6c4aa87c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:39.781323Z","signature_b64":"ASl3KSWljfqZr/5hTd1RDXK0ssFMPADK0/SwUkVhu7O1C/czjnJlxjX1Wtci/fRCmVl1tHllsE/Ah3P/WuCxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79099de8707dd82f7f3f6fec195bed948032471fd0134e89dd2f18e3e93c5832","last_reissued_at":"2026-07-05T03:52:39.780867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:39.780867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Approximation of Zero-Free Partition Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Penghui Yao, Xinyuan Zhang, Yitong Yin","submitted_at":"2022-01-30T09:54:45Z","abstract_excerpt":"Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free partition functions. Patel and Regts[PR17] later gave a refinement of Barvinok's framework, which gave a polynomial-time algorithm for a class of zero-free graph polynomials that can be expressed as counting induced subgraphs in bounded-degree graphs.\n  In this paper, we give a polynomial-time algorithm for estimating classical and quantum partition functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12772","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.12772/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.12772","created_at":"2026-07-05T03:52:39.780922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12772v1","created_at":"2026-07-05T03:52:39.780922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12772","created_at":"2026-07-05T03:52:39.780922+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEEZ32DQPXMC","created_at":"2026-07-05T03:52:39.780922+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEEZ32DQPXMC67Z7","created_at":"2026-07-05T03:52:39.780922+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEEZ32DQ","created_at":"2026-07-05T03:52:39.780922+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21089","citing_title":"A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS","json":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS.json","graph_json":"https://pith.science/api/pith-number/PEEZ32DQPXMC67Z7N7WBSW7NSS/graph.json","events_json":"https://pith.science/api/pith-number/PEEZ32DQPXMC67Z7N7WBSW7NSS/events.json","paper":"https://pith.science/paper/PEEZ32DQ"},"agent_actions":{"view_html":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS","download_json":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS.json","view_paper":"https://pith.science/paper/PEEZ32DQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12772&json=true","fetch_graph":"https://pith.science/api/pith-number/PEEZ32DQPXMC67Z7N7WBSW7NSS/graph.json","fetch_events":"https://pith.science/api/pith-number/PEEZ32DQPXMC67Z7N7WBSW7NSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/action/storage_attestation","attest_author":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/action/author_attestation","sign_citation":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/action/citation_signature","submit_replication":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/action/replication_record"}},"created_at":"2026-07-05T03:52:39.780922+00:00","updated_at":"2026-07-05T03:52:39.780922+00:00"}