{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VYQDWRPNPZN6AXZ2XLTWXI2YSO","short_pith_number":"pith:VYQDWRPN","schema_version":"1.0","canonical_sha256":"ae203b45ed7e5be05f3abae76ba35893a1949fe846491d4c60c1cb2773a6da42","source":{"kind":"arxiv","id":"1902.09114","version":3},"attestation_state":"computed","paper":{"title":"FPRAS for the Potts Model and the Number of $k$-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Hanpin Wang, Yongzhi Cao, Zonglei Bai","submitted_at":"2019-02-25T07:17:58Z","abstract_excerpt":"In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \\emph{FPRAS}es for the Potts model and the number of $k$-colorings of the graph."},"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":"1902.09114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-25T07:17:58Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"e9d50903cbdc487c58e53e0fdcbdd65932a9014850c36eb448e87b4aa2dbcf21","abstract_canon_sha256":"6dd91c09e7a4bea4ddd4623a2638f8630093534324efc3590eff38ea4eb9992b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.697826Z","signature_b64":"YIGHidAzYYueUh90gKCpX8TIttp+slQ4xP2BB8xRodmsX0MnvJ19mqV1exeDmkjHOaY6yO/5baXJpP4/KAnhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae203b45ed7e5be05f3abae76ba35893a1949fe846491d4c60c1cb2773a6da42","last_reissued_at":"2026-05-17T23:52:31.697431Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.697431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPRAS for the Potts Model and the Number of $k$-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Hanpin Wang, Yongzhi Cao, Zonglei Bai","submitted_at":"2019-02-25T07:17:58Z","abstract_excerpt":"In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \\emph{FPRAS}es for the Potts model and the number of $k$-colorings of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09114","kind":"arxiv","version":3},"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":"1902.09114","created_at":"2026-05-17T23:52:31.697493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09114v3","created_at":"2026-05-17T23:52:31.697493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09114","created_at":"2026-05-17T23:52:31.697493+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYQDWRPNPZN6","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYQDWRPNPZN6AXZ2","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYQDWRPN","created_at":"2026-05-18T12:33:30.264802+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/VYQDWRPNPZN6AXZ2XLTWXI2YSO","json":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO.json","graph_json":"https://pith.science/api/pith-number/VYQDWRPNPZN6AXZ2XLTWXI2YSO/graph.json","events_json":"https://pith.science/api/pith-number/VYQDWRPNPZN6AXZ2XLTWXI2YSO/events.json","paper":"https://pith.science/paper/VYQDWRPN"},"agent_actions":{"view_html":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO","download_json":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO.json","view_paper":"https://pith.science/paper/VYQDWRPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09114&json=true","fetch_graph":"https://pith.science/api/pith-number/VYQDWRPNPZN6AXZ2XLTWXI2YSO/graph.json","fetch_events":"https://pith.science/api/pith-number/VYQDWRPNPZN6AXZ2XLTWXI2YSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO/action/storage_attestation","attest_author":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO/action/author_attestation","sign_citation":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO/action/citation_signature","submit_replication":"https://pith.science/pith/VYQDWRPNPZN6AXZ2XLTWXI2YSO/action/replication_record"}},"created_at":"2026-05-17T23:52:31.697493+00:00","updated_at":"2026-05-17T23:52:31.697493+00:00"}