{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TKW6EDSSP5V5N4KPK6XSFZO7ES","short_pith_number":"pith:TKW6EDSS","schema_version":"1.0","canonical_sha256":"9aade20e527f6bd6f14f57af22e5df24895372fe8f90821a5edef2183114b47d","source":{"kind":"arxiv","id":"2311.14344","version":3},"attestation_state":"computed","paper":{"title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aitor Moreno Fdez. de Leceta, Alejandro Mata Ali, I\\~nigo Perez Delgado","submitted_at":"2023-11-24T08:41:02Z","abstract_excerpt":"This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces constraints through explicit counting filters. This formalism also yields an explicit tensor-network marginal formula whose zero-temperature, exact-arithmetic limit identifies an optimal feasible tour through a sequential marginal rule. At finite $\\tau$ and finite precision, the implemented extraction is a heuristic whose behavior depends on numerical contrast, cal"},"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":"2311.14344","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-24T08:41:02Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"9d970583b6f7e8396a010da8e548affca610bc8565c194099240592f2f249089","abstract_canon_sha256":"98f4b9e2368f42337b71129eb8f844da9a92af728d615fd8482475afb8ef1d57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:31.957629Z","signature_b64":"yBcFYI++2ffPuyry850/kPyXLtAnOaOR78SIOVp9WWiBVYI3hjfmQWo8ZunL+NoNORzFGwCW2+EWrPinEJ4BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aade20e527f6bd6f14f57af22e5df24895372fe8f90821a5edef2183114b47d","last_reissued_at":"2026-05-20T00:01:31.956855Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:31.956855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aitor Moreno Fdez. de Leceta, Alejandro Mata Ali, I\\~nigo Perez Delgado","submitted_at":"2023-11-24T08:41:02Z","abstract_excerpt":"This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces constraints through explicit counting filters. This formalism also yields an explicit tensor-network marginal formula whose zero-temperature, exact-arithmetic limit identifies an optimal feasible tour through a sequential marginal rule. At finite $\\tau$ and finite precision, the implemented extraction is a heuristic whose behavior depends on numerical contrast, cal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14344","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.14344/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.14344","created_at":"2026-05-20T00:01:31.956970+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.14344v3","created_at":"2026-05-20T00:01:31.956970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14344","created_at":"2026-05-20T00:01:31.956970+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKW6EDSSP5V5","created_at":"2026-05-20T00:01:31.956970+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKW6EDSSP5V5N4KP","created_at":"2026-05-20T00:01:31.956970+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKW6EDSS","created_at":"2026-05-20T00:01:31.956970+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/TKW6EDSSP5V5N4KPK6XSFZO7ES","json":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES.json","graph_json":"https://pith.science/api/pith-number/TKW6EDSSP5V5N4KPK6XSFZO7ES/graph.json","events_json":"https://pith.science/api/pith-number/TKW6EDSSP5V5N4KPK6XSFZO7ES/events.json","paper":"https://pith.science/paper/TKW6EDSS"},"agent_actions":{"view_html":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES","download_json":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES.json","view_paper":"https://pith.science/paper/TKW6EDSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.14344&json=true","fetch_graph":"https://pith.science/api/pith-number/TKW6EDSSP5V5N4KPK6XSFZO7ES/graph.json","fetch_events":"https://pith.science/api/pith-number/TKW6EDSSP5V5N4KPK6XSFZO7ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES/action/storage_attestation","attest_author":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES/action/author_attestation","sign_citation":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES/action/citation_signature","submit_replication":"https://pith.science/pith/TKW6EDSSP5V5N4KPK6XSFZO7ES/action/replication_record"}},"created_at":"2026-05-20T00:01:31.956970+00:00","updated_at":"2026-05-20T00:01:31.956970+00:00"}