{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","short_pith_number":"pith:TPYJK4SY","schema_version":"1.0","canonical_sha256":"9bf095725816b39e922b8405c62774a397e059f53ce6ea3e9e1848f8bc6c2ea1","source":{"kind":"arxiv","id":"1202.4146","version":1},"attestation_state":"computed","paper":{"title":"Bottleneck Non-Crossing Matching in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"A. Karim Abu-Affash, Matthew J. Katz, Paz Carmi, Yohai Trabelsi","submitted_at":"2012-02-19T11:30:53Z","abstract_excerpt":"Let $P$ be a set of $2n$ points in the plane, and let $M_{\\rm C}$ (resp., $M_{\\rm NC}$) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of $P$. We study the problem of computing $M_{\\rm NC}$. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an $O(n^{1.5}\\log^{0.5} n)$-time algorithm that computes a non-crossing matching $M$ of $P$, such that $bn(M) \\le 2\\sqrt{10} \\cdot bn(M_{\\rm NC})$, where $bn(M)$ is the length of a longest edge in $M$. An interesting implication of our construction is that $bn(M_{\\rm NC})/bn(M_{\\rm C}) \\le 2\\sqr"},"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":"1202.4146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-19T11:30:53Z","cross_cats_sorted":[],"title_canon_sha256":"7398c3942c6b1c1b6c116519d542bc9d86a214d65b0b29f5ad0d34dbfa0a8ff2","abstract_canon_sha256":"d1c50a157b4f6f03d7e83faa035173ebe79c13657a9c8b9b9fecd6525fe7ce9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:00.118260Z","signature_b64":"YGiCfvb0FTWwWVqJ0C5ngRKfo8wEcWpgnK50MO7p7ePm1BGs6jRUeTWN2J4l1Htf31mB+kFnPlp9H3kvMNd4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bf095725816b39e922b8405c62774a397e059f53ce6ea3e9e1848f8bc6c2ea1","last_reissued_at":"2026-05-18T04:02:00.117484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:00.117484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottleneck Non-Crossing Matching in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"A. Karim Abu-Affash, Matthew J. Katz, Paz Carmi, Yohai Trabelsi","submitted_at":"2012-02-19T11:30:53Z","abstract_excerpt":"Let $P$ be a set of $2n$ points in the plane, and let $M_{\\rm C}$ (resp., $M_{\\rm NC}$) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of $P$. We study the problem of computing $M_{\\rm NC}$. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an $O(n^{1.5}\\log^{0.5} n)$-time algorithm that computes a non-crossing matching $M$ of $P$, such that $bn(M) \\le 2\\sqrt{10} \\cdot bn(M_{\\rm NC})$, where $bn(M)$ is the length of a longest edge in $M$. An interesting implication of our construction is that $bn(M_{\\rm NC})/bn(M_{\\rm C}) \\le 2\\sqr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4146","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":""},"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":"1202.4146","created_at":"2026-05-18T04:02:00.117613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4146v1","created_at":"2026-05-18T04:02:00.117613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4146","created_at":"2026-05-18T04:02:00.117613+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPYJK4SYC2ZZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPYJK4SYC2ZZ5ERL","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPYJK4SY","created_at":"2026-05-18T12:27:23.164592+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/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","json":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO.json","graph_json":"https://pith.science/api/pith-number/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/graph.json","events_json":"https://pith.science/api/pith-number/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/events.json","paper":"https://pith.science/paper/TPYJK4SY"},"agent_actions":{"view_html":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","download_json":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO.json","view_paper":"https://pith.science/paper/TPYJK4SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4146&json=true","fetch_graph":"https://pith.science/api/pith-number/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/graph.json","fetch_events":"https://pith.science/api/pith-number/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/action/storage_attestation","attest_author":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/action/author_attestation","sign_citation":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/action/citation_signature","submit_replication":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/action/replication_record"}},"created_at":"2026-05-18T04:02:00.117613+00:00","updated_at":"2026-05-18T04:02:00.117613+00:00"}