{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CO3ISS7OLKY5AGQNVWKASNZLHV","short_pith_number":"pith:CO3ISS7O","canonical_record":{"source":{"id":"1405.0900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-05T13:50:45Z","cross_cats_sorted":[],"title_canon_sha256":"2410a68172d1a79f1981a613d3f7e4ca1b1dd1e23124ba00729ef3630da87a84","abstract_canon_sha256":"5c4195d2c13a4c8173daabcb1d5bf65f72b158c7fdee3fda960384ba2dcb2d52"},"schema_version":"1.0"},"canonical_sha256":"13b6894bee5ab1d01a0dad9409372b3d62181b8e76c7665bf9df021f4809a7f9","source":{"kind":"arxiv","id":"1405.0900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0900","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0900v2","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0900","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"CO3ISS7OLKY5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CO3ISS7OLKY5AGQN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CO3ISS7O","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CO3ISS7OLKY5AGQNVWKASNZLHV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-05T13:50:45Z","cross_cats_sorted":[],"title_canon_sha256":"2410a68172d1a79f1981a613d3f7e4ca1b1dd1e23124ba00729ef3630da87a84","abstract_canon_sha256":"5c4195d2c13a4c8173daabcb1d5bf65f72b158c7fdee3fda960384ba2dcb2d52"},"schema_version":"1.0"},"canonical_sha256":"13b6894bee5ab1d01a0dad9409372b3d62181b8e76c7665bf9df021f4809a7f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:14.026849Z","signature_b64":"aEHPvhL5+P9k0i44Az/yCc3rLrTePQ1s2gSY6KnRnYw1ydutI4XXLE/J6LjsJ45wUFLYfjg2g/kUBEQGProJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b6894bee5ab1d01a0dad9409372b3d62181b8e76c7665bf9df021f4809a7f9","last_reissued_at":"2026-05-18T02:32:14.026187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:14.026187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0900","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-05-18T02:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DNY2qdL1fnGiTDEoODnvYW+Mc1JdiMJWx70XI30KgsstJeWTQk4UitTzlHD4eOAy5TEv0dW1dLk097OWqwxXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:01:48.634058Z"},"content_sha256":"a977b3fa06b522d8df1963034354d31fe0bbda49549c77fe3e41bb82d0d31c98","schema_version":"1.0","event_id":"sha256:a977b3fa06b522d8df1963034354d31fe0bbda49549c77fe3e41bb82d0d31c98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CO3ISS7OLKY5AGQNVWKASNZLHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bottleneck Partial-Matching Voronoi Diagrams and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Matthias Henze, Rafel Jaume","submitted_at":"2014-05-05T13:50:45Z","abstract_excerpt":"Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equally-sized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic variant, which generalize to higher dimensions. We use the diagram to find an optimal bottleneck matching under translations, to compute a connecting path of minimum bottleneck cost between two positio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0900","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":""},"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:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GgkGBYxtlsNgM2CUECSIIujkn51hK+pnkhSy3I8DzFT0Aqs+HMcVEXL9nhUP2Gy3iB+1HqmfVMsySuBPEtLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:01:48.634716Z"},"content_sha256":"209a29999e2e3af7479a99c5888afd241fcc0e6cfd2c2366115adc99f8628977","schema_version":"1.0","event_id":"sha256:209a29999e2e3af7479a99c5888afd241fcc0e6cfd2c2366115adc99f8628977"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO3ISS7OLKY5AGQNVWKASNZLHV/bundle.json","state_url":"https://pith.science/pith/CO3ISS7OLKY5AGQNVWKASNZLHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO3ISS7OLKY5AGQNVWKASNZLHV/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-05-27T18:01:48Z","links":{"resolver":"https://pith.science/pith/CO3ISS7OLKY5AGQNVWKASNZLHV","bundle":"https://pith.science/pith/CO3ISS7OLKY5AGQNVWKASNZLHV/bundle.json","state":"https://pith.science/pith/CO3ISS7OLKY5AGQNVWKASNZLHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO3ISS7OLKY5AGQNVWKASNZLHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CO3ISS7OLKY5AGQNVWKASNZLHV","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":"5c4195d2c13a4c8173daabcb1d5bf65f72b158c7fdee3fda960384ba2dcb2d52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-05T13:50:45Z","title_canon_sha256":"2410a68172d1a79f1981a613d3f7e4ca1b1dd1e23124ba00729ef3630da87a84"},"schema_version":"1.0","source":{"id":"1405.0900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0900","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0900v2","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0900","created_at":"2026-05-18T02:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"CO3ISS7OLKY5","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CO3ISS7OLKY5AGQN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CO3ISS7O","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:209a29999e2e3af7479a99c5888afd241fcc0e6cfd2c2366115adc99f8628977","target":"graph","created_at":"2026-05-18T02:32:14Z","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":"Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equally-sized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic variant, which generalize to higher dimensions. We use the diagram to find an optimal bottleneck matching under translations, to compute a connecting path of minimum bottleneck cost between two positio","authors_text":"Matthias Henze, Rafel Jaume","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-05T13:50:45Z","title":"Bottleneck Partial-Matching Voronoi Diagrams and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0900","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:a977b3fa06b522d8df1963034354d31fe0bbda49549c77fe3e41bb82d0d31c98","target":"record","created_at":"2026-05-18T02:32:14Z","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":"5c4195d2c13a4c8173daabcb1d5bf65f72b158c7fdee3fda960384ba2dcb2d52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-05T13:50:45Z","title_canon_sha256":"2410a68172d1a79f1981a613d3f7e4ca1b1dd1e23124ba00729ef3630da87a84"},"schema_version":"1.0","source":{"id":"1405.0900","kind":"arxiv","version":2}},"canonical_sha256":"13b6894bee5ab1d01a0dad9409372b3d62181b8e76c7665bf9df021f4809a7f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b6894bee5ab1d01a0dad9409372b3d62181b8e76c7665bf9df021f4809a7f9","first_computed_at":"2026-05-18T02:32:14.026187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:14.026187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aEHPvhL5+P9k0i44Az/yCc3rLrTePQ1s2gSY6KnRnYw1ydutI4XXLE/J6LjsJ45wUFLYfjg2g/kUBEQGProJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:14.026849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a977b3fa06b522d8df1963034354d31fe0bbda49549c77fe3e41bb82d0d31c98","sha256:209a29999e2e3af7479a99c5888afd241fcc0e6cfd2c2366115adc99f8628977"],"state_sha256":"d89bc847eaed860a58e8b50bca7020fa2652760783b84e4d198e22b5daa2ee58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qq/xdHjjVl2v1qDs0pvKsCjuyrdkAUAbUZSDf3W8VZrmbSsy5Q/jhHkfXEiB6aujFqdcesnzMtgfkIilje5jBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:01:48.638202Z","bundle_sha256":"99a2812a8ad7795f1e8f17eb32b609c08d88f7dc40de7f1835c936bbb2abf533"}}