{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HWIFR3TGNMXTRCRLI4JZ6QFMU6","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":"f5ffec9fd0910e73bfae37476e64ece8faea7d250521efaa0a0844ea916836e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-09T20:08:09Z","title_canon_sha256":"4d3894e67698ade01b96110b08ec921d3a9e45e1afab6c4e2f1a3003120f9cda"},"schema_version":"1.0","source":{"id":"2006.05490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05490","created_at":"2026-07-05T01:09:14Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05490v1","created_at":"2026-07-05T01:09:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05490","created_at":"2026-07-05T01:09:14Z"},{"alias_kind":"pith_short_12","alias_value":"HWIFR3TGNMXT","created_at":"2026-07-05T01:09:14Z"},{"alias_kind":"pith_short_16","alias_value":"HWIFR3TGNMXTRCRL","created_at":"2026-07-05T01:09:14Z"},{"alias_kind":"pith_short_8","alias_value":"HWIFR3TG","created_at":"2026-07-05T01:09:14Z"}],"graph_snapshots":[{"event_id":"sha256:772052f19daa2f69d8468f13d507f5ff312190a42a605ee2a218dc9aa18ea703","target":"graph","created_at":"2026-07-05T01:09:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.05490/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of designing sublinear time algorithms for estimating the cost of a minimum metric traveling salesman (TSP) tour. Specifically, given access to a $n \\times n$ distance matrix $D$ that specifies pairwise distances between $n$ points, the goal is to estimate the TSP cost by performing only sublinear (in the size of $D$) queries. For the closely related problem of estimating the weight of a metric minimum spanning tree (MST), it is known that for any $\\varepsilon > 0$, there exists an $\\tilde{O}(n/\\varepsilon^{O(1)})$ time algorithm that returns a $(1 + \\varepsilon)$-appro","authors_text":"Sampath Kannan, Sanjeev Khanna, Yu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-09T20:08:09Z","title":"Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05490","kind":"arxiv","version":1},"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:c0769f6a520e158578b17bbb57586f93d3904362aab8c2290ab23cce919a735a","target":"record","created_at":"2026-07-05T01:09:14Z","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":"f5ffec9fd0910e73bfae37476e64ece8faea7d250521efaa0a0844ea916836e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-09T20:08:09Z","title_canon_sha256":"4d3894e67698ade01b96110b08ec921d3a9e45e1afab6c4e2f1a3003120f9cda"},"schema_version":"1.0","source":{"id":"2006.05490","kind":"arxiv","version":1}},"canonical_sha256":"3d9058ee666b2f388a2b47139f40aca78f66739913e8b7534a574bed93b2409a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d9058ee666b2f388a2b47139f40aca78f66739913e8b7534a574bed93b2409a","first_computed_at":"2026-07-05T01:09:14.116834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:09:14.116834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOxInwQiTL+G3nqfjSNsMmg9EUXwrJzxgCG3P76utWtkP18+sBafTQ+yFJ7y0YXlsZjMPpHqJ5M4kWCfU9cwAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:09:14.117211Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.05490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0769f6a520e158578b17bbb57586f93d3904362aab8c2290ab23cce919a735a","sha256:772052f19daa2f69d8468f13d507f5ff312190a42a605ee2a218dc9aa18ea703"],"state_sha256":"5f4eb5ec6e9e50565b0a9f5ba74d5b3f2e3ce460b7234fd85ca47588ddb139ae"}