{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:43PJ63MLYOZKJOW24MNJTAYX32","short_pith_number":"pith:43PJ63ML","canonical_record":{"source":{"id":"1411.4613","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T20:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"d9fa2eccb74c7e2e35061cfac138aa51e2351b98ed9f31d300939a52262019de","abstract_canon_sha256":"3236c98cf592e5e868076c27849c64e9816cd23204be5969eb11f7a1486da647"},"schema_version":"1.0"},"canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","source":{"kind":"arxiv","id":"1411.4613","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4613","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4613v4","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4613","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"43PJ63MLYOZK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43PJ63MLYOZKJOW2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43PJ63ML","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:43PJ63MLYOZKJOW24MNJTAYX32","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4613","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T20:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"d9fa2eccb74c7e2e35061cfac138aa51e2351b98ed9f31d300939a52262019de","abstract_canon_sha256":"3236c98cf592e5e868076c27849c64e9816cd23204be5969eb11f7a1486da647"},"schema_version":"1.0"},"canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.259846Z","signature_b64":"SUCGD8iBtlVQsKXWQP30SV/gWWkq4NFTgkB2Y2TEoSz74euQXPsLdui9+yfjteY9U1p1O2vt3T2aJqomzGT3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","last_reissued_at":"2026-05-18T01:34:13.259280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.259280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4613","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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rs4ug4uESth4wL8l1GcXW84HNLK1DYxrY6AZHWdJttj6hUuQEYoT+MBBUuRSygHLM296ClcMrLg45fsOQmlSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:21:34.529720Z"},"content_sha256":"56b4ca39b9df267f822c4eaaf6452adbf5d3d90ba6bf4761b3a414fcf2f90fc7","schema_version":"1.0","event_id":"sha256:56b4ca39b9df267f822c4eaaf6452adbf5d3d90ba6bf4761b3a414fcf2f90fc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:43PJ63MLYOZKJOW24MNJTAYX32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nima Anari, Shayan Oveis Gharan","submitted_at":"2014-11-17T20:03:26Z","abstract_excerpt":"We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is $\\text{polyloglog}(n)$. In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of $\\text{polyloglog}(n)$, where $\\text{polyloglog}(n)$ is a bounded degree polynomial of $\\log\\log(n)$. We prove this by showing that any $k$-edge-connected unweighted graph has a $\\text{polyloglog}(n)/k$-thin spanning tree.\n  Our main new ingredient is a procedure, albeit an exponentially sized convex program, that \"transforms\" graphs that do no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4613","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-18T01:34:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SfO1soiz/J/bdRSRXJd99KodIpzKwttjWOqVO+cKcfAD7uM0nVLGwIVV+dUZnk5QADALCSIQdGHw5Z5cu7sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:21:34.530416Z"},"content_sha256":"41b5720e46581add9a511b9da344d0f95fe47383b4162551e94caa69630716d9","schema_version":"1.0","event_id":"sha256:41b5720e46581add9a511b9da344d0f95fe47383b4162551e94caa69630716d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/bundle.json","state_url":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43PJ63MLYOZKJOW24MNJTAYX32/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-06T08:21:34Z","links":{"resolver":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32","bundle":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/bundle.json","state":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43PJ63MLYOZKJOW24MNJTAYX32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:43PJ63MLYOZKJOW24MNJTAYX32","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":"3236c98cf592e5e868076c27849c64e9816cd23204be5969eb11f7a1486da647","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T20:03:26Z","title_canon_sha256":"d9fa2eccb74c7e2e35061cfac138aa51e2351b98ed9f31d300939a52262019de"},"schema_version":"1.0","source":{"id":"1411.4613","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4613","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4613v4","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4613","created_at":"2026-05-18T01:34:13Z"},{"alias_kind":"pith_short_12","alias_value":"43PJ63MLYOZK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"43PJ63MLYOZKJOW2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"43PJ63ML","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:41b5720e46581add9a511b9da344d0f95fe47383b4162551e94caa69630716d9","target":"graph","created_at":"2026-05-18T01:34:13Z","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":"We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is $\\text{polyloglog}(n)$. In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of $\\text{polyloglog}(n)$, where $\\text{polyloglog}(n)$ is a bounded degree polynomial of $\\log\\log(n)$. We prove this by showing that any $k$-edge-connected unweighted graph has a $\\text{polyloglog}(n)/k$-thin spanning tree.\n  Our main new ingredient is a procedure, albeit an exponentially sized convex program, that \"transforms\" graphs that do no","authors_text":"Nima Anari, Shayan Oveis Gharan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T20:03:26Z","title":"Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4613","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:56b4ca39b9df267f822c4eaaf6452adbf5d3d90ba6bf4761b3a414fcf2f90fc7","target":"record","created_at":"2026-05-18T01:34:13Z","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":"3236c98cf592e5e868076c27849c64e9816cd23204be5969eb11f7a1486da647","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T20:03:26Z","title_canon_sha256":"d9fa2eccb74c7e2e35061cfac138aa51e2351b98ed9f31d300939a52262019de"},"schema_version":"1.0","source":{"id":"1411.4613","kind":"arxiv","version":4}},"canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","first_computed_at":"2026-05-18T01:34:13.259280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:13.259280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUCGD8iBtlVQsKXWQP30SV/gWWkq4NFTgkB2Y2TEoSz74euQXPsLdui9+yfjteY9U1p1O2vt3T2aJqomzGT3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:13.259846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4613","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56b4ca39b9df267f822c4eaaf6452adbf5d3d90ba6bf4761b3a414fcf2f90fc7","sha256:41b5720e46581add9a511b9da344d0f95fe47383b4162551e94caa69630716d9"],"state_sha256":"c54a32e10c753edc00208aea27f0c474eaa1d3606eb6064c2fab443be1707362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OuVbUbltW/LEhQgjG2Y5JGQBzPOhFmnFfUjftCY7PRv59KOG89aQhThLJNhiYiC09+Ha+MOChAKparUZEyrwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:21:34.538100Z","bundle_sha256":"0f63ee710f00d758b5a48b0332bdae1c93e4eacda26f153b0fa070929b3c9f99"}}