{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:26DREUDOEOGTV2BTWBKXI4AM3G","short_pith_number":"pith:26DREUDO","schema_version":"1.0","canonical_sha256":"d78712506e238d3ae833b05574700cd9a8081928178d9d51f96556c5dc85ec5d","source":{"kind":"arxiv","id":"1303.6659","version":3},"attestation_state":"computed","paper":{"title":"The traveling salesman problem for lines, balls and planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth","submitted_at":"2013-03-26T20:52:07Z","abstract_excerpt":"We revisit the traveling salesman problem with neighborhoods (TSPN) and propose several new approximation algorithms. These constitute either first approximations (for hyperplanes, lines, and balls in $\\mathbb{R}^d$, for $d\\geq 3$) or improvements over previous approximations achievable in comparable times (for unit disks in the plane).\n  \\smallskip (I) Given a set of $n$ hyperplanes in $\\mathbb{R}^d$, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in $O(n)$ time, when $d$ is constant.\n  \\smallskip (II) Given a set of $n$ lines in $\\mathbb{R}^d$, a TSP tour whose 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":"1303.6659","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-26T20:52:07Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"fe46286c21cd763daecc6d08353f4e1098ae44f879076676b528c6d30da7e3f8","abstract_canon_sha256":"05c7c3a8555d55bf934315e733952e0194a9e3283d4062aaba00a6e3d5fade3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:03.224041Z","signature_b64":"fRdUMBH8m6KOqwt8U1m1Gf/tlpWtgmeMmXFkb9qbhaoBIw7NztJALnNImFrq2OR/LI8m8sHiP/ou2hz55YkiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d78712506e238d3ae833b05574700cd9a8081928178d9d51f96556c5dc85ec5d","last_reissued_at":"2026-05-18T01:26:03.223577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:03.223577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The traveling salesman problem for lines, balls and planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth","submitted_at":"2013-03-26T20:52:07Z","abstract_excerpt":"We revisit the traveling salesman problem with neighborhoods (TSPN) and propose several new approximation algorithms. These constitute either first approximations (for hyperplanes, lines, and balls in $\\mathbb{R}^d$, for $d\\geq 3$) or improvements over previous approximations achievable in comparable times (for unit disks in the plane).\n  \\smallskip (I) Given a set of $n$ hyperplanes in $\\mathbb{R}^d$, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in $O(n)$ time, when $d$ is constant.\n  \\smallskip (II) Given a set of $n$ lines in $\\mathbb{R}^d$, a TSP tour whose l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6659","kind":"arxiv","version":3},"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":"1303.6659","created_at":"2026-05-18T01:26:03.223643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6659v3","created_at":"2026-05-18T01:26:03.223643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6659","created_at":"2026-05-18T01:26:03.223643+00:00"},{"alias_kind":"pith_short_12","alias_value":"26DREUDOEOGT","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"26DREUDOEOGTV2BT","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"26DREUDO","created_at":"2026-05-18T12:27:30.460161+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/26DREUDOEOGTV2BTWBKXI4AM3G","json":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G.json","graph_json":"https://pith.science/api/pith-number/26DREUDOEOGTV2BTWBKXI4AM3G/graph.json","events_json":"https://pith.science/api/pith-number/26DREUDOEOGTV2BTWBKXI4AM3G/events.json","paper":"https://pith.science/paper/26DREUDO"},"agent_actions":{"view_html":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G","download_json":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G.json","view_paper":"https://pith.science/paper/26DREUDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6659&json=true","fetch_graph":"https://pith.science/api/pith-number/26DREUDOEOGTV2BTWBKXI4AM3G/graph.json","fetch_events":"https://pith.science/api/pith-number/26DREUDOEOGTV2BTWBKXI4AM3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G/action/storage_attestation","attest_author":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G/action/author_attestation","sign_citation":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G/action/citation_signature","submit_replication":"https://pith.science/pith/26DREUDOEOGTV2BTWBKXI4AM3G/action/replication_record"}},"created_at":"2026-05-18T01:26:03.223643+00:00","updated_at":"2026-05-18T01:26:03.223643+00:00"}