{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PWRE536MNQJ6CO4K35GBF63325","short_pith_number":"pith:PWRE536M","schema_version":"1.0","canonical_sha256":"7da24eefcc6c13e13b8adf4c12fb7bd76e69f3b5dbd488a23807532dc032d603","source":{"kind":"arxiv","id":"1512.06649","version":4},"attestation_state":"computed","paper":{"title":"Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Hadrien Cambazard, Nicolas Catusse","submitted_at":"2015-12-21T14:38:29Z","abstract_excerpt":"Given a set $P$ of $n$ points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is rectilinear when the points lie in the plane and the distance considered between two points is the $l_1$ distance. In this paper, a fixed-parameter algorithm for the Rectilinear TSP is presented and relies on techniques for solving TSP on bounded-treewidth graphs. It proves that the problem can be solved in $O\\left(nh7^h\\right)$ where $h \\leq n$ denotes the number of horizontal lines containing the points of $P$. The s"},"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":"1512.06649","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-21T14:38:29Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"8f7fcb5effd927e1268089bc262bf4af195be42752b7676d152ccd447475a247","abstract_canon_sha256":"2d539044949061e2b2684e60fb857c6f6f0eb95323e44faf56c716a220eb1fc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.050769Z","signature_b64":"7UoD/LCPrMKoymLCXs4RSIbFncz1+sAg6Xf61qTcRSHt+iZ1NE0X1NEQZoKFFomI5OWvfW+iKybMoedSesLBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7da24eefcc6c13e13b8adf4c12fb7bd76e69f3b5dbd488a23807532dc032d603","last_reissued_at":"2026-05-17T23:39:59.050361Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.050361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Hadrien Cambazard, Nicolas Catusse","submitted_at":"2015-12-21T14:38:29Z","abstract_excerpt":"Given a set $P$ of $n$ points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is rectilinear when the points lie in the plane and the distance considered between two points is the $l_1$ distance. In this paper, a fixed-parameter algorithm for the Rectilinear TSP is presented and relies on techniques for solving TSP on bounded-treewidth graphs. It proves that the problem can be solved in $O\\left(nh7^h\\right)$ where $h \\leq n$ denotes the number of horizontal lines containing the points of $P$. The s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06649","kind":"arxiv","version":4},"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":"1512.06649","created_at":"2026-05-17T23:39:59.050419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06649v4","created_at":"2026-05-17T23:39:59.050419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06649","created_at":"2026-05-17T23:39:59.050419+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWRE536MNQJ6","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWRE536MNQJ6CO4K","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWRE536M","created_at":"2026-05-18T12:29:37.295048+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/PWRE536MNQJ6CO4K35GBF63325","json":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325.json","graph_json":"https://pith.science/api/pith-number/PWRE536MNQJ6CO4K35GBF63325/graph.json","events_json":"https://pith.science/api/pith-number/PWRE536MNQJ6CO4K35GBF63325/events.json","paper":"https://pith.science/paper/PWRE536M"},"agent_actions":{"view_html":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325","download_json":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325.json","view_paper":"https://pith.science/paper/PWRE536M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06649&json=true","fetch_graph":"https://pith.science/api/pith-number/PWRE536MNQJ6CO4K35GBF63325/graph.json","fetch_events":"https://pith.science/api/pith-number/PWRE536MNQJ6CO4K35GBF63325/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/action/storage_attestation","attest_author":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/action/author_attestation","sign_citation":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/action/citation_signature","submit_replication":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/action/replication_record"}},"created_at":"2026-05-17T23:39:59.050419+00:00","updated_at":"2026-05-17T23:39:59.050419+00:00"}