{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N3ESMXATAHL7F23GFKZVZF2K67","short_pith_number":"pith:N3ESMXAT","schema_version":"1.0","canonical_sha256":"6ec9265c1301d7f2eb662ab35c974af7d7d3e6b8b42889b3728cee3b168f6f3d","source":{"kind":"arxiv","id":"1703.07170","version":3},"attestation_state":"computed","paper":{"title":"Layers and Matroids for the Traveling Salesman's Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'as Seb\\H{o}, Anke van Zuylen, Frans Schalekamp, Vera Traub","submitted_at":"2017-03-21T12:34:01Z","abstract_excerpt":"Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive \"generalized Gao-trees\". We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasingly restrictive matroids. A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental in recent results for the $s-t$ path TSP."},"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":"1703.07170","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-21T12:34:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"96558615b6b99e64721ca01be7c9064c9f307e22ab10f27180b92a8bb08de751","abstract_canon_sha256":"c2c8bfa5bc91eb0c536babe0f539dfd62547f6b409ee139a54046fe2ee4343df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.201919Z","signature_b64":"N1iwrE7grekDT3n+DwqNtWV/G5tZAnVLyiQuezwsc0NtrRq+15paZmf46Qzv/AGmPdl/2Bz0Qn7uJYdk7eyNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec9265c1301d7f2eb662ab35c974af7d7d3e6b8b42889b3728cee3b168f6f3d","last_reissued_at":"2026-05-18T00:31:45.201355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.201355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layers and Matroids for the Traveling Salesman's Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'as Seb\\H{o}, Anke van Zuylen, Frans Schalekamp, Vera Traub","submitted_at":"2017-03-21T12:34:01Z","abstract_excerpt":"Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive \"generalized Gao-trees\". We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasingly restrictive matroids. A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental in recent results for the $s-t$ path TSP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07170","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":"1703.07170","created_at":"2026-05-18T00:31:45.201448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07170v3","created_at":"2026-05-18T00:31:45.201448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07170","created_at":"2026-05-18T00:31:45.201448+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3ESMXATAHL7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3ESMXATAHL7F23G","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3ESMXAT","created_at":"2026-05-18T12:31:31.346846+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/N3ESMXATAHL7F23GFKZVZF2K67","json":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67.json","graph_json":"https://pith.science/api/pith-number/N3ESMXATAHL7F23GFKZVZF2K67/graph.json","events_json":"https://pith.science/api/pith-number/N3ESMXATAHL7F23GFKZVZF2K67/events.json","paper":"https://pith.science/paper/N3ESMXAT"},"agent_actions":{"view_html":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67","download_json":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67.json","view_paper":"https://pith.science/paper/N3ESMXAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07170&json=true","fetch_graph":"https://pith.science/api/pith-number/N3ESMXATAHL7F23GFKZVZF2K67/graph.json","fetch_events":"https://pith.science/api/pith-number/N3ESMXATAHL7F23GFKZVZF2K67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67/action/storage_attestation","attest_author":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67/action/author_attestation","sign_citation":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67/action/citation_signature","submit_replication":"https://pith.science/pith/N3ESMXATAHL7F23GFKZVZF2K67/action/replication_record"}},"created_at":"2026-05-18T00:31:45.201448+00:00","updated_at":"2026-05-18T00:31:45.201448+00:00"}