{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GI6PN5MQ5CIHC5CGINDKDGZNN4","short_pith_number":"pith:GI6PN5MQ","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"},"canonical_sha256":"323cf6f590e8907174464346a19b2d6f2e92c6873cf3bd2071585a927f81cff4","source":{"kind":"arxiv","id":"1407.1930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1930","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1930v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1930","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"GI6PN5MQ5CIH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GI6PN5MQ5CIHC5CG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GI6PN5MQ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GI6PN5MQ5CIHC5CGINDKDGZNN4","target":"record","payload":{"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"},"canonical_sha256":"323cf6f590e8907174464346a19b2d6f2e92c6873cf3bd2071585a927f81cff4","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"},"source_kind":"arxiv","source_id":"1407.1930","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-05-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwASt92G+KkBPhrkGgSLIIOvUCoLRNy+tbGLHiRaSuWpOJsrO2odBkCbRVZUOkSOgwbEIJ4i5rjo3VOzJIIuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:40:52.172857Z"},"content_sha256":"994a53376d0920bbcd7bcd6d76d2fb1439f81ed04a26afa6b8523713750532d1","schema_version":"1.0","event_id":"sha256:994a53376d0920bbcd7bcd6d76d2fb1439f81ed04a26afa6b8523713750532d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GI6PN5MQ5CIHC5CGINDKDGZNN4","target":"graph","payload":{"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"},"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-05-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uod5CJn1dUMCoYb7KLekqbV1R4TawMHHz2EVgyxY2BMOzYu+awoVRYD46tY1UKhGUMh/yCJpQPXQeQ4vuFl/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:40:52.173223Z"},"content_sha256":"013ed107ee60a09b5a52c61cdfc936017a6c4b189ce5de3c49a7551a5f2985e9","schema_version":"1.0","event_id":"sha256:013ed107ee60a09b5a52c61cdfc936017a6c4b189ce5de3c49a7551a5f2985e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/bundle.json","state_url":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/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-06-03T12:40:52Z","links":{"resolver":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4","bundle":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/bundle.json","state":"https://pith.science/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI6PN5MQ5CIHC5CGINDKDGZNN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GI6PN5MQ5CIHC5CGINDKDGZNN4","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":"3069f6f4ca806a19308017317d0c38a3ed2eb24c2e9cc73bc4168ca754e75597","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-08T02:16:59Z","title_canon_sha256":"a8ab237ee79c4dc95cdf69bc46c18323efe46c2584114183e9d8a588eb6301f0"},"schema_version":"1.0","source":{"id":"1407.1930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1930","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1930v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1930","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"GI6PN5MQ5CIH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GI6PN5MQ5CIHC5CG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GI6PN5MQ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:013ed107ee60a09b5a52c61cdfc936017a6c4b189ce5de3c49a7551a5f2985e9","target":"graph","created_at":"2026-05-18T02:48:08Z","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":"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","authors_text":"Cristopher Moore, Thomas P. Hayes","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-08T02:16:59Z","title":"Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1930","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:994a53376d0920bbcd7bcd6d76d2fb1439f81ed04a26afa6b8523713750532d1","target":"record","created_at":"2026-05-18T02:48:08Z","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":"3069f6f4ca806a19308017317d0c38a3ed2eb24c2e9cc73bc4168ca754e75597","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-08T02:16:59Z","title_canon_sha256":"a8ab237ee79c4dc95cdf69bc46c18323efe46c2584114183e9d8a588eb6301f0"},"schema_version":"1.0","source":{"id":"1407.1930","kind":"arxiv","version":1}},"canonical_sha256":"323cf6f590e8907174464346a19b2d6f2e92c6873cf3bd2071585a927f81cff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323cf6f590e8907174464346a19b2d6f2e92c6873cf3bd2071585a927f81cff4","first_computed_at":"2026-05-18T02:48:08.870708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:08.870708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHswM3duDkKUXhsj0Z0Bk1x6AX3ycYqTH+kJIcV/6nUD9BUShEqgq5miRif1yg/UbvCkZAnEi3AeR7E75eF+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:08.871209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:994a53376d0920bbcd7bcd6d76d2fb1439f81ed04a26afa6b8523713750532d1","sha256:013ed107ee60a09b5a52c61cdfc936017a6c4b189ce5de3c49a7551a5f2985e9"],"state_sha256":"c84d3d9ed54cc5faa343c48e60f7b3038e32df7a127b3aa3250f8a273ee679ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtso3RZOsyntmib6w0/7GceJzdLyZyOf2JEy/643wdIWGH9HrTmeJaCmX8ZLoWiOPrSSGTptOHC518u7fUYwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:40:52.175191Z","bundle_sha256":"3b9d5226b3638e41c88672323fcfe03f9c77d1ac7bcfda4a2a1d34f857ae006f"}}