{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CXETMTK7ZT4UPO4U2CE6KBBPUJ","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":"1637027ae49759eeaf8fe973084828ab22a9cadee8cb9aff6425c30a4c8847e2","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T09:34:32Z","title_canon_sha256":"a6c7a684fe9eb82c1b8258a518eb397b7f73e13ab00ef598711fda681b69895d"},"schema_version":"1.0","source":{"id":"1607.01167","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01167","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01167v3","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01167","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"CXETMTK7ZT4U","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CXETMTK7ZT4UPO4U","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CXETMTK7","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:58c355aa83c6d18440dd779fc6f1427e7769eb139eb52c930717a744bdd4b60e","target":"graph","created_at":"2026-05-18T00:26:18Z","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":"In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach works for the Tutte polynomial and independence polynomial, as well as partition functions of complex-valued spin and edge-coloring models.\n  More specifically, we define a large class of graph polynomials $\\mathcal C$ and show that if $p\\in \\cal C$ and there is a disk $D$ centered at zero in the complex plane such that $p(G)$ does not vanish on $D$ for all boun","authors_text":"Guus Regts, Viresh Patel","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T09:34:32Z","title":"Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01167","kind":"arxiv","version":3},"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:c37c904f370913afe28e6d2d488d74a38828076f023c86d817e121307f622a86","target":"record","created_at":"2026-05-18T00:26:18Z","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":"1637027ae49759eeaf8fe973084828ab22a9cadee8cb9aff6425c30a4c8847e2","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T09:34:32Z","title_canon_sha256":"a6c7a684fe9eb82c1b8258a518eb397b7f73e13ab00ef598711fda681b69895d"},"schema_version":"1.0","source":{"id":"1607.01167","kind":"arxiv","version":3}},"canonical_sha256":"15c9364d5fccf947bb94d089e5042fa261eb3b835a879bb3d27e2f39aa1560ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15c9364d5fccf947bb94d089e5042fa261eb3b835a879bb3d27e2f39aa1560ad","first_computed_at":"2026-05-18T00:26:18.526295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:18.526295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iw8bmXVzejG4F2DKc44Dm4Zk9k0uQuddPMv3Ahze4PXznZhYKTzXt3OBBzAO8tMr/JOXsr12FKpm/X1gLU36Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:18.526783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01167","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c37c904f370913afe28e6d2d488d74a38828076f023c86d817e121307f622a86","sha256:58c355aa83c6d18440dd779fc6f1427e7769eb139eb52c930717a744bdd4b60e"],"state_sha256":"ec556ab60b2bcc935060d1f0bc47fb9b61482bd39c04946a12ece1a195bfb8bc"}