{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KG26DYAWO6ZVWNV7SDADLPNSWV","short_pith_number":"pith:KG26DYAW","schema_version":"1.0","canonical_sha256":"51b5e1e01677b35b36bf90c035bdb2b55dc30dc7d387328e952a49b75c4549dd","source":{"kind":"arxiv","id":"2502.19554","version":1},"attestation_state":"computed","paper":{"title":"Kissing polytopes in dimension 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Antoine Deza, Lionel Pournin, Zhongyuan Liu","submitted_at":"2025-02-26T20:48:57Z","abstract_excerpt":"It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube $[0,k]^3$ is exactly $$ \\frac{1}{\\sqrt{2(2k^2-4k+5)(2k^2-2k+1)}} $$ for every integer $k$ at least $4$. The proof relies on modeling this as a minimization problem over a subset of the lattice points in the hypercube $[-k,k]^9$. A precise characterization of this subset allows to reduce the problem to computing the roots of a finite number of degree at most $4$ polynomials, which is done using symbolic computation."},"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":"2502.19554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2025-02-26T20:48:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"05374b69f3930764332edc428047c05a5470195f1526f52da9632b8f61a3a9f3","abstract_canon_sha256":"c3aaa9522d6be409ff2958e4790a9add3f6523aba1533053efce518b90d98d9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:48.572132Z","signature_b64":"uAoufFGRLZNHuiVd6l6oslv+pCcYYC/CqGu+gkzRpKZG6Tu+yjdYVh3nYEjFQbxJemBrbyD+8BaNp5k5QBEkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51b5e1e01677b35b36bf90c035bdb2b55dc30dc7d387328e952a49b75c4549dd","last_reissued_at":"2026-07-05T10:20:48.571636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:48.571636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kissing polytopes in dimension 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Antoine Deza, Lionel Pournin, Zhongyuan Liu","submitted_at":"2025-02-26T20:48:57Z","abstract_excerpt":"It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube $[0,k]^3$ is exactly $$ \\frac{1}{\\sqrt{2(2k^2-4k+5)(2k^2-2k+1)}} $$ for every integer $k$ at least $4$. The proof relies on modeling this as a minimization problem over a subset of the lattice points in the hypercube $[-k,k]^9$. A precise characterization of this subset allows to reduce the problem to computing the roots of a finite number of degree at most $4$ polynomials, which is done using symbolic computation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.19554","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/2502.19554/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.19554","created_at":"2026-07-05T10:20:48.571701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.19554v1","created_at":"2026-07-05T10:20:48.571701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.19554","created_at":"2026-07-05T10:20:48.571701+00:00"},{"alias_kind":"pith_short_12","alias_value":"KG26DYAWO6ZV","created_at":"2026-07-05T10:20:48.571701+00:00"},{"alias_kind":"pith_short_16","alias_value":"KG26DYAWO6ZVWNV7","created_at":"2026-07-05T10:20:48.571701+00:00"},{"alias_kind":"pith_short_8","alias_value":"KG26DYAW","created_at":"2026-07-05T10:20:48.571701+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/KG26DYAWO6ZVWNV7SDADLPNSWV","json":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV.json","graph_json":"https://pith.science/api/pith-number/KG26DYAWO6ZVWNV7SDADLPNSWV/graph.json","events_json":"https://pith.science/api/pith-number/KG26DYAWO6ZVWNV7SDADLPNSWV/events.json","paper":"https://pith.science/paper/KG26DYAW"},"agent_actions":{"view_html":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV","download_json":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV.json","view_paper":"https://pith.science/paper/KG26DYAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.19554&json=true","fetch_graph":"https://pith.science/api/pith-number/KG26DYAWO6ZVWNV7SDADLPNSWV/graph.json","fetch_events":"https://pith.science/api/pith-number/KG26DYAWO6ZVWNV7SDADLPNSWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV/action/storage_attestation","attest_author":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV/action/author_attestation","sign_citation":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV/action/citation_signature","submit_replication":"https://pith.science/pith/KG26DYAWO6ZVWNV7SDADLPNSWV/action/replication_record"}},"created_at":"2026-07-05T10:20:48.571701+00:00","updated_at":"2026-07-05T10:20:48.571701+00:00"}