{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IMSJJP42QRKIJJ4AI4QYU6VYOV","short_pith_number":"pith:IMSJJP42","schema_version":"1.0","canonical_sha256":"432494bf9a845484a78047218a7ab8755a3ac156ff8b56864654dc1ef0a10f99","source":{"kind":"arxiv","id":"1302.4400","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrei Asinowski, G\\\"unter Rote, Tillmann Miltzow","submitted_at":"2013-02-18T19:47:40Z","abstract_excerpt":"Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing matching. We give several geometric descriptions of such sets, and find an O(nlogn) algorithm that checks whether a given bichromatic set has this property."},"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":"1302.4400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-18T19:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"3b3281528d5a5be484263f757ca3e87346f3c332bb934b7176d9471f8e6a5d92","abstract_canon_sha256":"49b92eeab8d13bbebe6e2da5a432d05ebd168f44fff7161eaf0609e7c07ac08e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.366065Z","signature_b64":"Bp6Rh6djne51l02NM3wZGBRFM8uCmnjtiMfOExwyi9gN+F5zT7rjtAGdQWWhfvSpaDgfEFlhKvbn/H3kpOCnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"432494bf9a845484a78047218a7ab8755a3ac156ff8b56864654dc1ef0a10f99","last_reissued_at":"2026-05-18T00:39:23.365593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.365593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andrei Asinowski, G\\\"unter Rote, Tillmann Miltzow","submitted_at":"2013-02-18T19:47:40Z","abstract_excerpt":"Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing matching. We give several geometric descriptions of such sets, and find an O(nlogn) algorithm that checks whether a given bichromatic set has this property."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4400","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":"1302.4400","created_at":"2026-05-18T00:39:23.365669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4400v1","created_at":"2026-05-18T00:39:23.365669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4400","created_at":"2026-05-18T00:39:23.365669+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMSJJP42QRKI","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMSJJP42QRKIJJ4A","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMSJJP42","created_at":"2026-05-18T12:27:46.883200+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/IMSJJP42QRKIJJ4AI4QYU6VYOV","json":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV.json","graph_json":"https://pith.science/api/pith-number/IMSJJP42QRKIJJ4AI4QYU6VYOV/graph.json","events_json":"https://pith.science/api/pith-number/IMSJJP42QRKIJJ4AI4QYU6VYOV/events.json","paper":"https://pith.science/paper/IMSJJP42"},"agent_actions":{"view_html":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV","download_json":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV.json","view_paper":"https://pith.science/paper/IMSJJP42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4400&json=true","fetch_graph":"https://pith.science/api/pith-number/IMSJJP42QRKIJJ4AI4QYU6VYOV/graph.json","fetch_events":"https://pith.science/api/pith-number/IMSJJP42QRKIJJ4AI4QYU6VYOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV/action/storage_attestation","attest_author":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV/action/author_attestation","sign_citation":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV/action/citation_signature","submit_replication":"https://pith.science/pith/IMSJJP42QRKIJJ4AI4QYU6VYOV/action/replication_record"}},"created_at":"2026-05-18T00:39:23.365669+00:00","updated_at":"2026-05-18T00:39:23.365669+00:00"}