{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:65DXIIJ56K7GI4GXJY6Y27UWLF","short_pith_number":"pith:65DXIIJ5","canonical_record":{"source":{"id":"2305.18597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2023-05-29T20:27:51Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"1c1d4fa7ac12549d864fb1a21d874377405ac85dd6c2b583eadf100c00a504f6","abstract_canon_sha256":"87d3d9bf366d39e3d20d79dd6e28aa5e353820d0d8db826acd9210cc1a793a5a"},"schema_version":"1.0"},"canonical_sha256":"f74774213df2be6470d74e3d8d7e965946fab550b98f7bfab5a478047a8f1e9a","source":{"kind":"arxiv","id":"2305.18597","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18597","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18597v2","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18597","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"65DXIIJ56K7G","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"65DXIIJ56K7GI4GX","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"65DXIIJ5","created_at":"2026-07-05T10:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:65DXIIJ56K7GI4GXJY6Y27UWLF","target":"record","payload":{"canonical_record":{"source":{"id":"2305.18597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2023-05-29T20:27:51Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"1c1d4fa7ac12549d864fb1a21d874377405ac85dd6c2b583eadf100c00a504f6","abstract_canon_sha256":"87d3d9bf366d39e3d20d79dd6e28aa5e353820d0d8db826acd9210cc1a793a5a"},"schema_version":"1.0"},"canonical_sha256":"f74774213df2be6470d74e3d8d7e965946fab550b98f7bfab5a478047a8f1e9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:01.286022Z","signature_b64":"u9w20RmYUXwbZNauDenIk8awECtiLLDPoDS43j6VzQHhRq/qJ3bOjQHSMZIS58i6iCnbtVoQhEdwuCvPGvMSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74774213df2be6470d74e3d8d7e965946fab550b98f7bfab5a478047a8f1e9a","last_reissued_at":"2026-07-05T10:06:01.285599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:01.285599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.18597","source_version":2,"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-07-05T10:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3kat8QP0TBRUVQF6oOU2ik5NjhKy6Gt92gVqGfLL4S/NWvIjBlqpb5q1j3ymqp02060H8Qp+ifZoLEXp6PYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:58:07.318808Z"},"content_sha256":"1fedb585b8446e4058379fb6532efb597fea983b5dd84179a58fa2e87db5bcba","schema_version":"1.0","event_id":"sha256:1fedb585b8446e4058379fb6532efb597fea983b5dd84179a58fa2e87db5bcba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:65DXIIJ56K7GI4GXJY6Y27UWLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kissing polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"math.MG","authors_text":"Antoine Deza, Lionel Pournin, Sebastian Pokutta, Shmuel Onn","submitted_at":"2023-05-29T20:27:51Z","abstract_excerpt":"We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal distance between such polytopes appears in complexity bounds of optimization algorithms. We provide nearly matching lower and upper bounds on this distance and discuss its exact computation. We also give similar bounds in the case of disjoint rational polytopes whose binary encoding length is prescribed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18597","kind":"arxiv","version":2},"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/2305.18597/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"},"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-07-05T10:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFwrjLhQArzO0F/LNOyROazspNi8+MOrrQ0AOfU5V7NTgqwtncbyE4wSd37N5DN6ZDEC5stfiWnC704e/R28BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:58:07.319279Z"},"content_sha256":"b6388e47003ba5eae2f978a520cf7cfc9ee36df32148d796a4f20db3ab46a7f4","schema_version":"1.0","event_id":"sha256:b6388e47003ba5eae2f978a520cf7cfc9ee36df32148d796a4f20db3ab46a7f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65DXIIJ56K7GI4GXJY6Y27UWLF/bundle.json","state_url":"https://pith.science/pith/65DXIIJ56K7GI4GXJY6Y27UWLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65DXIIJ56K7GI4GXJY6Y27UWLF/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-08-06T18:58:07Z","links":{"resolver":"https://pith.science/pith/65DXIIJ56K7GI4GXJY6Y27UWLF","bundle":"https://pith.science/pith/65DXIIJ56K7GI4GXJY6Y27UWLF/bundle.json","state":"https://pith.science/pith/65DXIIJ56K7GI4GXJY6Y27UWLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65DXIIJ56K7GI4GXJY6Y27UWLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:65DXIIJ56K7GI4GXJY6Y27UWLF","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":"87d3d9bf366d39e3d20d79dd6e28aa5e353820d0d8db826acd9210cc1a793a5a","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2023-05-29T20:27:51Z","title_canon_sha256":"1c1d4fa7ac12549d864fb1a21d874377405ac85dd6c2b583eadf100c00a504f6"},"schema_version":"1.0","source":{"id":"2305.18597","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.18597","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2305.18597v2","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18597","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"65DXIIJ56K7G","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"65DXIIJ56K7GI4GX","created_at":"2026-07-05T10:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"65DXIIJ5","created_at":"2026-07-05T10:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:b6388e47003ba5eae2f978a520cf7cfc9ee36df32148d796a4f20db3ab46a7f4","target":"graph","created_at":"2026-07-05T10:06:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.18597/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal distance between such polytopes appears in complexity bounds of optimization algorithms. We provide nearly matching lower and upper bounds on this distance and discuss its exact computation. We also give similar bounds in the case of disjoint rational polytopes whose binary encoding length is prescribed.","authors_text":"Antoine Deza, Lionel Pournin, Sebastian Pokutta, Shmuel Onn","cross_cats":["math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2023-05-29T20:27:51Z","title":"Kissing polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18597","kind":"arxiv","version":2},"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:1fedb585b8446e4058379fb6532efb597fea983b5dd84179a58fa2e87db5bcba","target":"record","created_at":"2026-07-05T10:06:01Z","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":"87d3d9bf366d39e3d20d79dd6e28aa5e353820d0d8db826acd9210cc1a793a5a","cross_cats_sorted":["math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2023-05-29T20:27:51Z","title_canon_sha256":"1c1d4fa7ac12549d864fb1a21d874377405ac85dd6c2b583eadf100c00a504f6"},"schema_version":"1.0","source":{"id":"2305.18597","kind":"arxiv","version":2}},"canonical_sha256":"f74774213df2be6470d74e3d8d7e965946fab550b98f7bfab5a478047a8f1e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74774213df2be6470d74e3d8d7e965946fab550b98f7bfab5a478047a8f1e9a","first_computed_at":"2026-07-05T10:06:01.285599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:06:01.285599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u9w20RmYUXwbZNauDenIk8awECtiLLDPoDS43j6VzQHhRq/qJ3bOjQHSMZIS58i6iCnbtVoQhEdwuCvPGvMSDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:06:01.286022Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.18597","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fedb585b8446e4058379fb6532efb597fea983b5dd84179a58fa2e87db5bcba","sha256:b6388e47003ba5eae2f978a520cf7cfc9ee36df32148d796a4f20db3ab46a7f4"],"state_sha256":"30d3110fce1ca00e3c743819e51fb8dd35f01f0111b558ee33ecf79507952d93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dW7ui6f0hSnKp1ZpzHu71vfGUrITcPO9Nuku1GM8y+Gf2M13GJJ2cwF20O0SgQrV/Tmc6cgo1HK+mRC6nq/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:58:07.324373Z","bundle_sha256":"ff2cd6a00edf56734fed3cac9ee274289d1d79e09cdb8ee9cdf588db7cc4a8c4"}}