{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","short_pith_number":"pith:TPYJK4SY","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"},"canonical_sha256":"9bf095725816b39e922b8405c62774a397e059f53ce6ea3e9e1848f8bc6c2ea1","source":{"kind":"arxiv","id":"1202.4146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4146","created_at":"2026-05-18T04:02:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4146v1","created_at":"2026-05-18T04:02:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4146","created_at":"2026-05-18T04:02:00Z"},{"alias_kind":"pith_short_12","alias_value":"TPYJK4SYC2ZZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TPYJK4SYC2ZZ5ERL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TPYJK4SY","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","target":"record","payload":{"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"},"canonical_sha256":"9bf095725816b39e922b8405c62774a397e059f53ce6ea3e9e1848f8bc6c2ea1","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"},"source_kind":"arxiv","source_id":"1202.4146","source_version":1,"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-18T04:02:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEfblKWTlNMXjH9UpszCqocru6MXmAy5V/9DqsmS7/sZzobxifYcJLccYcZyh2/Nia8tEodUCc6UHCTYrJhFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:22:12.435237Z"},"content_sha256":"f24e7fe24484a8ea84103bc5351abdc6b16ecb3a9fcd0bceeea92abd233ccb24","schema_version":"1.0","event_id":"sha256:f24e7fe24484a8ea84103bc5351abdc6b16ecb3a9fcd0bceeea92abd233ccb24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","target":"graph","payload":{"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"},"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-18T04:02:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+/NCSUY4neV13swSjA8r8Xm7tFMcMiG6aEcyKmWFP2lMIesJ3OmSV4o0VhzT1psEvYXPpOEqVxHQNT+k8PZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:22:12.435615Z"},"content_sha256":"95f2df1cdfa5f3c2dec4f7d3375d13137d8d4ee4b02a727bc44ae090865e8b07","schema_version":"1.0","event_id":"sha256:95f2df1cdfa5f3c2dec4f7d3375d13137d8d4ee4b02a727bc44ae090865e8b07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/bundle.json","state_url":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/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-06-03T02:22:12Z","links":{"resolver":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","bundle":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/bundle.json","state":"https://pith.science/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPYJK4SYC2ZZ5ERLQQC4MJ3UUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TPYJK4SYC2ZZ5ERLQQC4MJ3UUO","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":"d1c50a157b4f6f03d7e83faa035173ebe79c13657a9c8b9b9fecd6525fe7ce9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-19T11:30:53Z","title_canon_sha256":"7398c3942c6b1c1b6c116519d542bc9d86a214d65b0b29f5ad0d34dbfa0a8ff2"},"schema_version":"1.0","source":{"id":"1202.4146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4146","created_at":"2026-05-18T04:02:00Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4146v1","created_at":"2026-05-18T04:02:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4146","created_at":"2026-05-18T04:02:00Z"},{"alias_kind":"pith_short_12","alias_value":"TPYJK4SYC2ZZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TPYJK4SYC2ZZ5ERL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TPYJK4SY","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:95f2df1cdfa5f3c2dec4f7d3375d13137d8d4ee4b02a727bc44ae090865e8b07","target":"graph","created_at":"2026-05-18T04:02:00Z","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":"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","authors_text":"A. Karim Abu-Affash, Matthew J. Katz, Paz Carmi, Yohai Trabelsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-19T11:30:53Z","title":"Bottleneck Non-Crossing Matching in the Plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4146","kind":"arxiv","version":1},"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:f24e7fe24484a8ea84103bc5351abdc6b16ecb3a9fcd0bceeea92abd233ccb24","target":"record","created_at":"2026-05-18T04:02:00Z","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":"d1c50a157b4f6f03d7e83faa035173ebe79c13657a9c8b9b9fecd6525fe7ce9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-19T11:30:53Z","title_canon_sha256":"7398c3942c6b1c1b6c116519d542bc9d86a214d65b0b29f5ad0d34dbfa0a8ff2"},"schema_version":"1.0","source":{"id":"1202.4146","kind":"arxiv","version":1}},"canonical_sha256":"9bf095725816b39e922b8405c62774a397e059f53ce6ea3e9e1848f8bc6c2ea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bf095725816b39e922b8405c62774a397e059f53ce6ea3e9e1848f8bc6c2ea1","first_computed_at":"2026-05-18T04:02:00.117484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:00.117484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGiCfvb0FTWwWVqJ0C5ngRKfo8wEcWpgnK50MO7p7ePm1BGs6jRUeTWN2J4l1Htf31mB+kFnPlp9H3kvMNd4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:00.118260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f24e7fe24484a8ea84103bc5351abdc6b16ecb3a9fcd0bceeea92abd233ccb24","sha256:95f2df1cdfa5f3c2dec4f7d3375d13137d8d4ee4b02a727bc44ae090865e8b07"],"state_sha256":"96d1d02d1b086646957b381a8d237f571ef9b19b44e1401048d76d8d80f777c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zyo3xaFZEU6lSXSV3/G6mJwcy97Iuieef6Z1olq4PXRMzI/yRwwNuynfx2kgzuH/DJjdKCI4N9+6FdOQ1O1dAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:22:12.438092Z","bundle_sha256":"6554210754e78842af3018f353fd656ffaae6cb4dd5e29edd25f20d9318e8e0d"}}