{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SCXUZQEBMLAYRDCXTEI4DHF44N","short_pith_number":"pith:SCXUZQEB","canonical_record":{"source":{"id":"2306.01073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-06-01T18:22:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"aaa3b0c3a559eb67e6d0ca3bc0ef01c06ba4b1521c880d1d0992350a68dce7df","abstract_canon_sha256":"02546e12cbff886e1349ffc0aabf825c6e49ba9bce9ddfe5637ffb2414a746ed"},"schema_version":"1.0"},"canonical_sha256":"90af4cc08162c1888c579911c19cbce37abe0441b9ae79b6830b5b01d3104b33","source":{"kind":"arxiv","id":"2306.01073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01073","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01073v2","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01073","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"SCXUZQEBMLAY","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"pith_short_16","alias_value":"SCXUZQEBMLAYRDCX","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"pith_short_8","alias_value":"SCXUZQEB","created_at":"2026-07-05T07:53:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SCXUZQEBMLAYRDCXTEI4DHF44N","target":"record","payload":{"canonical_record":{"source":{"id":"2306.01073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-06-01T18:22:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"aaa3b0c3a559eb67e6d0ca3bc0ef01c06ba4b1521c880d1d0992350a68dce7df","abstract_canon_sha256":"02546e12cbff886e1349ffc0aabf825c6e49ba9bce9ddfe5637ffb2414a746ed"},"schema_version":"1.0"},"canonical_sha256":"90af4cc08162c1888c579911c19cbce37abe0441b9ae79b6830b5b01d3104b33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:08.538346Z","signature_b64":"rVjjw5criHfqwqlpF2xiUoQw19zLyDCI6nLm1xZtjniwmaIrADi5Chv4GDpluFEunj3q0K2Dy2M/kRgIqenGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90af4cc08162c1888c579911c19cbce37abe0441b9ae79b6830b5b01d3104b33","last_reissued_at":"2026-07-05T07:53:08.537862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:08.537862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.01073","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-05T07:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sv097hZ1KkSkX8ps0mdUuPeZp7uBN5dhTh67HGJ7QeiFi6rFkegoUslJLzarL8TEqnWH9Q5h8zxax8Rd9nDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T22:41:19.416919Z"},"content_sha256":"a60f9cbfd355d9b91b55a86527e62912d714f6595c8d5aebf658e59f486d280e","schema_version":"1.0","event_id":"sha256:a60f9cbfd355d9b91b55a86527e62912d714f6595c8d5aebf658e59f486d280e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SCXUZQEBMLAYRDCXTEI4DHF44N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Distance Selection and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Yiming Zhao","submitted_at":"2023-06-01T18:22:24Z","abstract_excerpt":"In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \\leq k \\leq \\binom{n}{2}$, the distance selection problem is to find the $k$-th smallest interpoint distance among all pairs of points of $P$. The previously best deterministic algorithm solves the problem in $O(n^{4/3} \\log^2 n)$ time [Katz and Sharir, SIAM J. Comput. 1997 and SoCG 1993]. In this paper, we improve their algorithm to $O(n^{4/3} \\log n)$ time. Using similar techniques, we als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01073","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/2306.01073/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-05T07:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQN/Xkw2r9QbFECCvSbUZJ+kLDrdiEz1HamhJAXYFPRWM5kWIAns0DyhLZ+ecZEYvskztZCi2zeXMhFE2VANCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T22:41:19.417974Z"},"content_sha256":"cfd3490fc38747734a3681e14433c2e5477ccd928d6e3eb30bdec5fc9eed0754","schema_version":"1.0","event_id":"sha256:cfd3490fc38747734a3681e14433c2e5477ccd928d6e3eb30bdec5fc9eed0754"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCXUZQEBMLAYRDCXTEI4DHF44N/bundle.json","state_url":"https://pith.science/pith/SCXUZQEBMLAYRDCXTEI4DHF44N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCXUZQEBMLAYRDCXTEI4DHF44N/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-13T22:41:19Z","links":{"resolver":"https://pith.science/pith/SCXUZQEBMLAYRDCXTEI4DHF44N","bundle":"https://pith.science/pith/SCXUZQEBMLAYRDCXTEI4DHF44N/bundle.json","state":"https://pith.science/pith/SCXUZQEBMLAYRDCXTEI4DHF44N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCXUZQEBMLAYRDCXTEI4DHF44N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SCXUZQEBMLAYRDCXTEI4DHF44N","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":"02546e12cbff886e1349ffc0aabf825c6e49ba9bce9ddfe5637ffb2414a746ed","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-06-01T18:22:24Z","title_canon_sha256":"aaa3b0c3a559eb67e6d0ca3bc0ef01c06ba4b1521c880d1d0992350a68dce7df"},"schema_version":"1.0","source":{"id":"2306.01073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01073","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01073v2","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01073","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"SCXUZQEBMLAY","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"pith_short_16","alias_value":"SCXUZQEBMLAYRDCX","created_at":"2026-07-05T07:53:08Z"},{"alias_kind":"pith_short_8","alias_value":"SCXUZQEB","created_at":"2026-07-05T07:53:08Z"}],"graph_snapshots":[{"event_id":"sha256:cfd3490fc38747734a3681e14433c2e5477ccd928d6e3eb30bdec5fc9eed0754","target":"graph","created_at":"2026-07-05T07:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.01073/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \\leq k \\leq \\binom{n}{2}$, the distance selection problem is to find the $k$-th smallest interpoint distance among all pairs of points of $P$. The previously best deterministic algorithm solves the problem in $O(n^{4/3} \\log^2 n)$ time [Katz and Sharir, SIAM J. Comput. 1997 and SoCG 1993]. In this paper, we improve their algorithm to $O(n^{4/3} \\log n)$ time. Using similar techniques, we als","authors_text":"Haitao Wang, Yiming Zhao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-06-01T18:22:24Z","title":"Improved Algorithms for Distance Selection and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01073","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:a60f9cbfd355d9b91b55a86527e62912d714f6595c8d5aebf658e59f486d280e","target":"record","created_at":"2026-07-05T07:53: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":"02546e12cbff886e1349ffc0aabf825c6e49ba9bce9ddfe5637ffb2414a746ed","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-06-01T18:22:24Z","title_canon_sha256":"aaa3b0c3a559eb67e6d0ca3bc0ef01c06ba4b1521c880d1d0992350a68dce7df"},"schema_version":"1.0","source":{"id":"2306.01073","kind":"arxiv","version":2}},"canonical_sha256":"90af4cc08162c1888c579911c19cbce37abe0441b9ae79b6830b5b01d3104b33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90af4cc08162c1888c579911c19cbce37abe0441b9ae79b6830b5b01d3104b33","first_computed_at":"2026-07-05T07:53:08.537862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:53:08.537862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVjjw5criHfqwqlpF2xiUoQw19zLyDCI6nLm1xZtjniwmaIrADi5Chv4GDpluFEunj3q0K2Dy2M/kRgIqenGCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:53:08.538346Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.01073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a60f9cbfd355d9b91b55a86527e62912d714f6595c8d5aebf658e59f486d280e","sha256:cfd3490fc38747734a3681e14433c2e5477ccd928d6e3eb30bdec5fc9eed0754"],"state_sha256":"6732128ceeada40cbae19def6c835b3006b0d846cc09c887cd043d420bc75abb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Q4rtgl1mjna05yicIs8GgwhyXVOOExB0yGP6ywD4nZvtP5Ohycuv9WXb0xs5M2M233ZElgq4/rVCMDNTnQbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T22:41:19.437354Z","bundle_sha256":"7e74a71080a51dec41046d402de1a343675a06c668c53ac4483a164779e5485a"}}