{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2LVBYMLEDULEGBPMMUB3WH6RI7","short_pith_number":"pith:2LVBYMLE","schema_version":"1.0","canonical_sha256":"d2ea1c31641d164305ec6503bb1fd147d6b54ceb2d10e2b424ac415c94759f97","source":{"kind":"arxiv","id":"1311.5197","version":3},"attestation_state":"computed","paper":{"title":"Approximating the Bottleneck Plane Perfect Matching of a Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, A. Karim Abu-Affash, Anil Maheshwari, Michiel Smid, Paz Carmi","submitted_at":"2013-11-20T20:05:48Z","abstract_excerpt":"A bottleneck plane perfect matching of a set of $n$ points in $\\mathbb{R}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as {\\em bottleneck}. The problem of computing a bottleneck plane perfect matching has been proved to be NP-hard. We present an algorithm that computes a bottleneck plane matching of size at least $\\frac{n}{5}$ in $O(n \\log^2 n)$-time. Then we extend our idea toward an $O(n\\log n)$-time approximation algorithm which computes a plane matching of size at least $\\frac{2n}{5}$ whose edges"},"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":"1311.5197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-20T20:05:48Z","cross_cats_sorted":[],"title_canon_sha256":"b12bc4fcf77781c60584bb662bef29d9a993970a6871316546b6bb8cb27d5bd9","abstract_canon_sha256":"71c6c686433b98c1f51c942d198c339295d10bb4e7c84dbe3a354dcedea1eb59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.673915Z","signature_b64":"zRwn/gNXj2YtH8PNH3fD3fVRQm7wQ8OddWW2PQ0Wh2zqRjuP5b6Zoyvba8nhPQ58amoWr+4nGmlhA+J7k0TEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2ea1c31641d164305ec6503bb1fd147d6b54ceb2d10e2b424ac415c94759f97","last_reissued_at":"2026-05-18T01:34:55.673281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.673281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Bottleneck Plane Perfect Matching of a Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, A. Karim Abu-Affash, Anil Maheshwari, Michiel Smid, Paz Carmi","submitted_at":"2013-11-20T20:05:48Z","abstract_excerpt":"A bottleneck plane perfect matching of a set of $n$ points in $\\mathbb{R}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as {\\em bottleneck}. The problem of computing a bottleneck plane perfect matching has been proved to be NP-hard. We present an algorithm that computes a bottleneck plane matching of size at least $\\frac{n}{5}$ in $O(n \\log^2 n)$-time. Then we extend our idea toward an $O(n\\log n)$-time approximation algorithm which computes a plane matching of size at least $\\frac{2n}{5}$ whose edges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5197","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.5197","created_at":"2026-05-18T01:34:55.673381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5197v3","created_at":"2026-05-18T01:34:55.673381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5197","created_at":"2026-05-18T01:34:55.673381+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LVBYMLEDULE","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LVBYMLEDULEGBPM","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LVBYMLE","created_at":"2026-05-18T12:27:30.460161+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/2LVBYMLEDULEGBPMMUB3WH6RI7","json":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7.json","graph_json":"https://pith.science/api/pith-number/2LVBYMLEDULEGBPMMUB3WH6RI7/graph.json","events_json":"https://pith.science/api/pith-number/2LVBYMLEDULEGBPMMUB3WH6RI7/events.json","paper":"https://pith.science/paper/2LVBYMLE"},"agent_actions":{"view_html":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7","download_json":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7.json","view_paper":"https://pith.science/paper/2LVBYMLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5197&json=true","fetch_graph":"https://pith.science/api/pith-number/2LVBYMLEDULEGBPMMUB3WH6RI7/graph.json","fetch_events":"https://pith.science/api/pith-number/2LVBYMLEDULEGBPMMUB3WH6RI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7/action/storage_attestation","attest_author":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7/action/author_attestation","sign_citation":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7/action/citation_signature","submit_replication":"https://pith.science/pith/2LVBYMLEDULEGBPMMUB3WH6RI7/action/replication_record"}},"created_at":"2026-05-18T01:34:55.673381+00:00","updated_at":"2026-05-18T01:34:55.673381+00:00"}