{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PWRE536MNQJ6CO4K35GBF63325","short_pith_number":"pith:PWRE536M","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"},"canonical_sha256":"7da24eefcc6c13e13b8adf4c12fb7bd76e69f3b5dbd488a23807532dc032d603","source":{"kind":"arxiv","id":"1512.06649","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06649","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06649v4","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06649","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"PWRE536MNQJ6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWRE536MNQJ6CO4K","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWRE536M","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PWRE536MNQJ6CO4K35GBF63325","target":"record","payload":{"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"},"canonical_sha256":"7da24eefcc6c13e13b8adf4c12fb7bd76e69f3b5dbd488a23807532dc032d603","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"},"source_kind":"arxiv","source_id":"1512.06649","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+1TS/bSB3uJbUwJT5HdtRfuTBV3CBjIg7wupMUBEEYfPtWW8X2Cw24FSmLx+mK04kDWR4bE68jeA1HhShHQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:09:26.852726Z"},"content_sha256":"3182046127f13616ba1d8214a2c72d52e9ab3e1a7f58619c6e2b832eb8d2d752","schema_version":"1.0","event_id":"sha256:3182046127f13616ba1d8214a2c72d52e9ab3e1a7f58619c6e2b832eb8d2d752"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PWRE536MNQJ6CO4K35GBF63325","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1Yda+po3MoQ86ngn3p+vMVC01Ic7eb9ufYmLzCFaZoemWQyZ+3ZkQb6gq/hFTdOiu3S2yozmcTRz7z+OOjjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:09:26.853400Z"},"content_sha256":"ccc87eab4ec814ac40af32c72fbddd26491001a59da874a873878dbe32ec329c","schema_version":"1.0","event_id":"sha256:ccc87eab4ec814ac40af32c72fbddd26491001a59da874a873878dbe32ec329c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/bundle.json","state_url":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWRE536MNQJ6CO4K35GBF63325/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T05:09:26Z","links":{"resolver":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325","bundle":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/bundle.json","state":"https://pith.science/pith/PWRE536MNQJ6CO4K35GBF63325/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWRE536MNQJ6CO4K35GBF63325/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PWRE536MNQJ6CO4K35GBF63325","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2d539044949061e2b2684e60fb857c6f6f0eb95323e44faf56c716a220eb1fc0","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-21T14:38:29Z","title_canon_sha256":"8f7fcb5effd927e1268089bc262bf4af195be42752b7676d152ccd447475a247"},"schema_version":"1.0","source":{"id":"1512.06649","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06649","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06649v4","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06649","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"PWRE536MNQJ6","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWRE536MNQJ6CO4K","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWRE536M","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:ccc87eab4ec814ac40af32c72fbddd26491001a59da874a873878dbe32ec329c","target":"graph","created_at":"2026-05-17T23:39:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hadrien Cambazard, Nicolas Catusse","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-21T14:38:29Z","title":"Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06649","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3182046127f13616ba1d8214a2c72d52e9ab3e1a7f58619c6e2b832eb8d2d752","target":"record","created_at":"2026-05-17T23:39:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2d539044949061e2b2684e60fb857c6f6f0eb95323e44faf56c716a220eb1fc0","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-21T14:38:29Z","title_canon_sha256":"8f7fcb5effd927e1268089bc262bf4af195be42752b7676d152ccd447475a247"},"schema_version":"1.0","source":{"id":"1512.06649","kind":"arxiv","version":4}},"canonical_sha256":"7da24eefcc6c13e13b8adf4c12fb7bd76e69f3b5dbd488a23807532dc032d603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7da24eefcc6c13e13b8adf4c12fb7bd76e69f3b5dbd488a23807532dc032d603","first_computed_at":"2026-05-17T23:39:59.050361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:59.050361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7UoD/LCPrMKoymLCXs4RSIbFncz1+sAg6Xf61qTcRSHt+iZ1NE0X1NEQZoKFFomI5OWvfW+iKybMoedSesLBAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:59.050769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06649","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3182046127f13616ba1d8214a2c72d52e9ab3e1a7f58619c6e2b832eb8d2d752","sha256:ccc87eab4ec814ac40af32c72fbddd26491001a59da874a873878dbe32ec329c"],"state_sha256":"129b8f990178ad60b2c145f0da6e46e247b2648869b73ed057314fafdc2cc344"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkuUkH+ZSLc25nu9OLcJizX9hPWXp73b2QavT3ZSYT9VJES/nxRKTzqBWzz1PNn1GMn7jIyRi/CHijUBSrDqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:09:26.857093Z","bundle_sha256":"cc73deeed61945fd579f648964cbba68bb9763409afcec40509d3c39f300b5bc"}}