{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GI6PN5MQ5CIHC5CGINDKDGZNN4","short_pith_number":"pith:GI6PN5MQ","schema_version":"1.0","canonical_sha256":"323cf6f590e8907174464346a19b2d6f2e92c6873cf3bd2071585a927f81cff4","source":{"kind":"arxiv","id":"1407.1930","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Thomas P. Hayes","submitted_at":"2014-07-08T02:16:59Z","abstract_excerpt":"We prove a new lower bound on the critical density $\\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic Markov chain which moves one disk at a time, but with an improved path coupling analysis. Our main tool is an optimized metric on neighboring pairs of configurations, i.e., configurations that differ in the position of a single disk: we define a metric that depends on the difference in these positions, and which approaches zero continuously as they coincide. Thi"},"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":"1407.1930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-08T02:16:59Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"a8ab237ee79c4dc95cdf69bc46c18323efe46c2584114183e9d8a588eb6301f0","abstract_canon_sha256":"3069f6f4ca806a19308017317d0c38a3ed2eb24c2e9cc73bc4168ca754e75597"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:08.871209Z","signature_b64":"sHswM3duDkKUXhsj0Z0Bk1x6AX3ycYqTH+kJIcV/6nUD9BUShEqgq5miRif1yg/UbvCkZAnEi3AeR7E75eF+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323cf6f590e8907174464346a19b2d6f2e92c6873cf3bd2071585a927f81cff4","last_reissued_at":"2026-05-18T02:48:08.870708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:08.870708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Thomas P. Hayes","submitted_at":"2014-07-08T02:16:59Z","abstract_excerpt":"We prove a new lower bound on the critical density $\\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic Markov chain which moves one disk at a time, but with an improved path coupling analysis. Our main tool is an optimized metric on neighboring pairs of configurations, i.e., configurations that differ in the position of a single disk: we define a metric that depends on the difference in these positions, and which approaches zero continuously as they coincide. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1930","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":""},"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":"1407.1930","created_at":"2026-05-18T02:48:08.870792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1930v1","created_at":"2026-05-18T02:48:08.870792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1930","created_at":"2026-05-18T02:48:08.870792+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI6PN5MQ5CIH","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI6PN5MQ5CIHC5CG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI6PN5MQ","created_at":"2026-05-18T12:28:30.664211+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/GI6PN5MQ5CIHC5CGINDKDGZNN4","json":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4.json","graph_json":"https://pith.science/api/pith-number/GI6PN5MQ5CIHC5CGINDKDGZNN4/graph.json","events_json":"https://pith.science/api/pith-number/GI6PN5MQ5CIHC5CGINDKDGZNN4/events.json","paper":"https://pith.science/paper/GI6PN5MQ"},"agent_actions":{"view_html":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4","download_json":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4.json","view_paper":"https://pith.science/paper/GI6PN5MQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1930&json=true","fetch_graph":"https://pith.science/api/pith-number/GI6PN5MQ5CIHC5CGINDKDGZNN4/graph.json","fetch_events":"https://pith.science/api/pith-number/GI6PN5MQ5CIHC5CGINDKDGZNN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/action/storage_attestation","attest_author":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/action/author_attestation","sign_citation":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/action/citation_signature","submit_replication":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/action/replication_record"}},"created_at":"2026-05-18T02:48:08.870792+00:00","updated_at":"2026-05-18T02:48:08.870792+00:00"}