{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3AR62TR2SDD4XG6526W47OTRU5","short_pith_number":"pith:3AR62TR2","schema_version":"1.0","canonical_sha256":"d823ed4e3a90c7cb9bddd7adcfba71a74110329b4796e56d3b7d20780dbbadb7","source":{"kind":"arxiv","id":"2607.01536","version":1},"attestation_state":"computed","paper":{"title":"Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Billy Jin, David P. Williamson, Nathan Klein","submitted_at":"2026-07-01T23:32:15Z","abstract_excerpt":"One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the Subtour LP relaxation of the TSP is equal to $\\frac{4}{3}$. For 40 years, the best known upper bound was $1.5$, due to Wolsey. Recently, Karlin, Klein, and Oveis Gharan showed that the max entropy algorithm for the TSP gives an improved bound of $1.5 - 10^{-36}$. In this paper, we show that the maximum entropy algorithm is a $\\frac{10}{7}$-approximation for half-integral cycle cut instances of the TSP. This class of instances contains examples which demon"},"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":"2607.01536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T23:32:15Z","cross_cats_sorted":[],"title_canon_sha256":"68423b91b9a785b90d96339d1ba69eca7133d85d6d0537017796e0d6c1b3f2b9","abstract_canon_sha256":"e416828bea05f894982aa13a1a63a1eba4f98b8cef37590691d0b600d79a646c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:17:03.413013Z","signature_b64":"5FvtkDlIYefa/6HSwbmzj6i0X9Wivv0FqRb01UmLeuoS/Bx1TJ9c95PdDBrH7o/rBQouULfJFbXKgKEgMLpMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d823ed4e3a90c7cb9bddd7adcfba71a74110329b4796e56d3b7d20780dbbadb7","last_reissued_at":"2026-07-03T00:17:03.412605Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:17:03.412605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Billy Jin, David P. Williamson, Nathan Klein","submitted_at":"2026-07-01T23:32:15Z","abstract_excerpt":"One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the Subtour LP relaxation of the TSP is equal to $\\frac{4}{3}$. For 40 years, the best known upper bound was $1.5$, due to Wolsey. Recently, Karlin, Klein, and Oveis Gharan showed that the max entropy algorithm for the TSP gives an improved bound of $1.5 - 10^{-36}$. In this paper, we show that the maximum entropy algorithm is a $\\frac{10}{7}$-approximation for half-integral cycle cut instances of the TSP. This class of instances contains examples which demon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01536","kind":"arxiv","version":1},"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/2607.01536/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":"2607.01536","created_at":"2026-07-03T00:17:03.412664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01536v1","created_at":"2026-07-03T00:17:03.412664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01536","created_at":"2026-07-03T00:17:03.412664+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AR62TR2SDD4","created_at":"2026-07-03T00:17:03.412664+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AR62TR2SDD4XG65","created_at":"2026-07-03T00:17:03.412664+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AR62TR2","created_at":"2026-07-03T00:17:03.412664+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/3AR62TR2SDD4XG6526W47OTRU5","json":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5.json","graph_json":"https://pith.science/api/pith-number/3AR62TR2SDD4XG6526W47OTRU5/graph.json","events_json":"https://pith.science/api/pith-number/3AR62TR2SDD4XG6526W47OTRU5/events.json","paper":"https://pith.science/paper/3AR62TR2"},"agent_actions":{"view_html":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5","download_json":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5.json","view_paper":"https://pith.science/paper/3AR62TR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01536&json=true","fetch_graph":"https://pith.science/api/pith-number/3AR62TR2SDD4XG6526W47OTRU5/graph.json","fetch_events":"https://pith.science/api/pith-number/3AR62TR2SDD4XG6526W47OTRU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5/action/storage_attestation","attest_author":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5/action/author_attestation","sign_citation":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5/action/citation_signature","submit_replication":"https://pith.science/pith/3AR62TR2SDD4XG6526W47OTRU5/action/replication_record"}},"created_at":"2026-07-03T00:17:03.412664+00:00","updated_at":"2026-07-03T00:17:03.412664+00:00"}