{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VXAMJ6BYPSCSKOIUJFCCFRTHZR","short_pith_number":"pith:VXAMJ6BY","schema_version":"1.0","canonical_sha256":"adc0c4f8387c85253914494422c667cc5f8a37977755c4b846d4819349c7ad92","source":{"kind":"arxiv","id":"1201.0917","version":1},"attestation_state":"computed","paper":{"title":"Non-crossing Connectors in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Jan Kratochv\\'il, Torsten Ueckerdt","submitted_at":"2012-01-04T15:25:22Z","abstract_excerpt":"We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i=1,...,n, are there non-crossing connectors y_i for (R_i,P_i), i.e., arc-connected sets y_i with P_i subset of y_i subset of R_i for every i=1,...,n, such that y_i and y_j are disjoint for all i different from j?\n  We prove that non-crossing connectors do always exist if the regions form a collection of pseudo-disks, i.e., the boundaries of every pair of regions intersect at most twice. We provide a simple polynomial"},"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":"1201.0917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-01-04T15:25:22Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"49c07ab07a9dc67293c82a100e929765cd34aeaa28e3e63c3b6584e6b9e9b972","abstract_canon_sha256":"7fd7852b2b6efc9f222ce4de89917f022c9f5e057f6d44749648b0cc3774fe7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:15.485477Z","signature_b64":"b0q0ZajPtvJZ+8d3UtB5jz06RHplXm0PvsOfcff7hAjqAVCOChtZyqDrIpX2fskpskWePi8IDxqt524DNJp3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc0c4f8387c85253914494422c667cc5f8a37977755c4b846d4819349c7ad92","last_reissued_at":"2026-05-18T04:05:15.484772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:15.484772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-crossing Connectors in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Jan Kratochv\\'il, Torsten Ueckerdt","submitted_at":"2012-01-04T15:25:22Z","abstract_excerpt":"We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i=1,...,n, are there non-crossing connectors y_i for (R_i,P_i), i.e., arc-connected sets y_i with P_i subset of y_i subset of R_i for every i=1,...,n, such that y_i and y_j are disjoint for all i different from j?\n  We prove that non-crossing connectors do always exist if the regions form a collection of pseudo-disks, i.e., the boundaries of every pair of regions intersect at most twice. We provide a simple polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0917","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":"1201.0917","created_at":"2026-05-18T04:05:15.484888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0917v1","created_at":"2026-05-18T04:05:15.484888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0917","created_at":"2026-05-18T04:05:15.484888+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXAMJ6BYPSCS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXAMJ6BYPSCSKOIU","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXAMJ6BY","created_at":"2026-05-18T12:27:25.539911+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/VXAMJ6BYPSCSKOIUJFCCFRTHZR","json":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR.json","graph_json":"https://pith.science/api/pith-number/VXAMJ6BYPSCSKOIUJFCCFRTHZR/graph.json","events_json":"https://pith.science/api/pith-number/VXAMJ6BYPSCSKOIUJFCCFRTHZR/events.json","paper":"https://pith.science/paper/VXAMJ6BY"},"agent_actions":{"view_html":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR","download_json":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR.json","view_paper":"https://pith.science/paper/VXAMJ6BY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0917&json=true","fetch_graph":"https://pith.science/api/pith-number/VXAMJ6BYPSCSKOIUJFCCFRTHZR/graph.json","fetch_events":"https://pith.science/api/pith-number/VXAMJ6BYPSCSKOIUJFCCFRTHZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR/action/storage_attestation","attest_author":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR/action/author_attestation","sign_citation":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR/action/citation_signature","submit_replication":"https://pith.science/pith/VXAMJ6BYPSCSKOIUJFCCFRTHZR/action/replication_record"}},"created_at":"2026-05-18T04:05:15.484888+00:00","updated_at":"2026-05-18T04:05:15.484888+00:00"}