{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RWAUGJWB4WZ7Y3GFEHNWXEVPM4","short_pith_number":"pith:RWAUGJWB","schema_version":"1.0","canonical_sha256":"8d814326c1e5b3fc6cc521db6b92af67001e78a0d1e6fc67fa832967f4eac832","source":{"kind":"arxiv","id":"1204.5828","version":1},"attestation_state":"computed","paper":{"title":"The traveling salesman problem for lines and rays in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu","submitted_at":"2012-04-26T04:56:56Z","abstract_excerpt":"In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present several linear-time approximation algorithms with improved ratios for these problems for two cases of neighborhoods that are (infinite) lines, and respectively, (half-infinite) rays. Along the way we derive a tight bound on the minimum perimeter of a rectangle enclosing an open curve of length $L$."},"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":"1204.5828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-26T04:56:56Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"7ed7ae90c22748e39a18e35b45aa1f0089505e21faaa549de03f6fd80de855b0","abstract_canon_sha256":"39e248aa2e23c3c373988c52a648b763389aa970c1d3c98a6a2e2ee937da98c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:59.355988Z","signature_b64":"mVgnqqUormjxDnUhxkCkt5WjZKf1WL7Bk1PLqk6IZA2ZPQc8yIbyGDj7i6NaLGdKo86i7wF4ax5qAI/oedXcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d814326c1e5b3fc6cc521db6b92af67001e78a0d1e6fc67fa832967f4eac832","last_reissued_at":"2026-05-18T03:56:59.355125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:59.355125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The traveling salesman problem for lines and rays in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu","submitted_at":"2012-04-26T04:56:56Z","abstract_excerpt":"In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present several linear-time approximation algorithms with improved ratios for these problems for two cases of neighborhoods that are (infinite) lines, and respectively, (half-infinite) rays. Along the way we derive a tight bound on the minimum perimeter of a rectangle enclosing an open curve of length $L$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5828","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":"1204.5828","created_at":"2026-05-18T03:56:59.355274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5828v1","created_at":"2026-05-18T03:56:59.355274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5828","created_at":"2026-05-18T03:56:59.355274+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWAUGJWB4WZ7","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWAUGJWB4WZ7Y3GF","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWAUGJWB","created_at":"2026-05-18T12:27:20.899486+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/RWAUGJWB4WZ7Y3GFEHNWXEVPM4","json":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4.json","graph_json":"https://pith.science/api/pith-number/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/graph.json","events_json":"https://pith.science/api/pith-number/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/events.json","paper":"https://pith.science/paper/RWAUGJWB"},"agent_actions":{"view_html":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4","download_json":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4.json","view_paper":"https://pith.science/paper/RWAUGJWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5828&json=true","fetch_graph":"https://pith.science/api/pith-number/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/graph.json","fetch_events":"https://pith.science/api/pith-number/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/action/storage_attestation","attest_author":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/action/author_attestation","sign_citation":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/action/citation_signature","submit_replication":"https://pith.science/pith/RWAUGJWB4WZ7Y3GFEHNWXEVPM4/action/replication_record"}},"created_at":"2026-05-18T03:56:59.355274+00:00","updated_at":"2026-05-18T03:56:59.355274+00:00"}