{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PEEZ32DQPXMC67Z7N7WBSW7NSS","short_pith_number":"pith:PEEZ32DQ","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"},"canonical_sha256":"79099de8707dd82f7f3f6fec195bed948032471fd0134e89dd2f18e3e93c5832","source":{"kind":"arxiv","id":"2201.12772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12772","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12772v1","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12772","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"PEEZ32DQPXMC","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"PEEZ32DQPXMC67Z7","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"PEEZ32DQ","created_at":"2026-07-05T03:52:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PEEZ32DQPXMC67Z7N7WBSW7NSS","target":"record","payload":{"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"},"canonical_sha256":"79099de8707dd82f7f3f6fec195bed948032471fd0134e89dd2f18e3e93c5832","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"},"source_kind":"arxiv","source_id":"2201.12772","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-07-05T03:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caQe9OmsQICiNk2UBHZOW6ZbVRfgkUN5LwTnl+8uqD/sBuCMk+9fi5CZ4g+BhxnXaFvTfUPbusXeRi0mF0ZTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:17:38.819860Z"},"content_sha256":"31e749f3863abe04d3d5d7b185ae008d82dc08544cec6e43bf1044a52ffdcb63","schema_version":"1.0","event_id":"sha256:31e749f3863abe04d3d5d7b185ae008d82dc08544cec6e43bf1044a52ffdcb63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PEEZ32DQPXMC67Z7N7WBSW7NSS","target":"graph","payload":{"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"},"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-07-05T03:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bA37QvUgxnl3K/R32Y6xkMn+fOqDGt2vktxxv02qRx93OoE804Emac3y71U0/t5iq8chDDkvXbHopcuKfGmjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:17:38.820437Z"},"content_sha256":"da82a2ac75fd307456edf6b9e902b01909a06dba24799c8edef1b89b41851a85","schema_version":"1.0","event_id":"sha256:da82a2ac75fd307456edf6b9e902b01909a06dba24799c8edef1b89b41851a85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/bundle.json","state_url":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/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-08-09T15:17:38Z","links":{"resolver":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS","bundle":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/bundle.json","state":"https://pith.science/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEEZ32DQPXMC67Z7N7WBSW7NSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PEEZ32DQPXMC67Z7N7WBSW7NSS","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":"5b8484fa618848dc50993c6f70c86e171998fd9fd2e69bb30f49bf6e6c4aa87c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T09:54:45Z","title_canon_sha256":"99038e3430b4c375411463e50d2a8f88168323f7eaf772f52a0fe1ac790a5a0a"},"schema_version":"1.0","source":{"id":"2201.12772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12772","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12772v1","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12772","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"PEEZ32DQPXMC","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"PEEZ32DQPXMC67Z7","created_at":"2026-07-05T03:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"PEEZ32DQ","created_at":"2026-07-05T03:52:39Z"}],"graph_snapshots":[{"event_id":"sha256:da82a2ac75fd307456edf6b9e902b01909a06dba24799c8edef1b89b41851a85","target":"graph","created_at":"2026-07-05T03:52:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.12772/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Penghui Yao, Xinyuan Zhang, Yitong Yin","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T09:54:45Z","title":"Polynomial-Time Approximation of Zero-Free Partition Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12772","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:31e749f3863abe04d3d5d7b185ae008d82dc08544cec6e43bf1044a52ffdcb63","target":"record","created_at":"2026-07-05T03:52:39Z","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":"5b8484fa618848dc50993c6f70c86e171998fd9fd2e69bb30f49bf6e6c4aa87c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-01-30T09:54:45Z","title_canon_sha256":"99038e3430b4c375411463e50d2a8f88168323f7eaf772f52a0fe1ac790a5a0a"},"schema_version":"1.0","source":{"id":"2201.12772","kind":"arxiv","version":1}},"canonical_sha256":"79099de8707dd82f7f3f6fec195bed948032471fd0134e89dd2f18e3e93c5832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79099de8707dd82f7f3f6fec195bed948032471fd0134e89dd2f18e3e93c5832","first_computed_at":"2026-07-05T03:52:39.780867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:39.780867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ASl3KSWljfqZr/5hTd1RDXK0ssFMPADK0/SwUkVhu7O1C/czjnJlxjX1Wtci/fRCmVl1tHllsE/Ah3P/WuCxDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:39.781323Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31e749f3863abe04d3d5d7b185ae008d82dc08544cec6e43bf1044a52ffdcb63","sha256:da82a2ac75fd307456edf6b9e902b01909a06dba24799c8edef1b89b41851a85"],"state_sha256":"00a35004d1d662b612812a5ae9972f36c943c2df6489085649ed2b9ee0ac2e35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8Xdp+Uxb4liR3gHspikcP/6ej7oh6vGHBAcC23TI1F1xzWFTSOuDJK9UvjpRUuKydM0MHQ1fFgxgB1m9mxvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:17:38.825664Z","bundle_sha256":"864d162ed9f27055ac959bbfa5b6ddcae4c971f5ed8c15ca5a99781dd417b943"}}