{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QXMEF4BF4XBWNARWFD47UYDIO4","short_pith_number":"pith:QXMEF4BF","schema_version":"1.0","canonical_sha256":"85d842f025e5c366823628f9fa606877318eed44b6eddc4f527a44ce3c9b2825","source":{"kind":"arxiv","id":"1206.6991","version":3},"attestation_state":"computed","paper":{"title":"On the Nearest Neighbor Algorithm for Mean Field Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antar Bandyopadhyay, Farkhondeh Sajadi","submitted_at":"2012-06-29T11:36:01Z","abstract_excerpt":"In this work we consider the mean field traveling salesman problem, where the intercity distances are taken to be i.i.d. with some distribution $F$. This paper focus on the \\emph{nearest neighbor tour} which is to move to the nearest non-visited city and we show that under some conditions on $F$, which are satisfied by exponential distribution with constant mean, the total length of the nearest neighbor tour, asymptotically almost surely scales as $\\log n$. Similar result is known for Euclidean TSP and nearest neighbor tour. We further derive the limiting behavior of the total length of the ne"},"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":"1206.6991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-06-29T11:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"78ead93bec3d79edd7f0203960313875477212af814ae29f46e33b1be2a66457","abstract_canon_sha256":"ec012b81e90736421417854c577f52a887b9e6ebaa71a41dee1685030213399d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:25.802628Z","signature_b64":"IUX3sfwvYiIm+40PXysOzbV23ju3oCsjgpEyy62L19jjK9TxfCvMfypQdSaqP6IdunnMddsRorJA8twrSTCvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d842f025e5c366823628f9fa606877318eed44b6eddc4f527a44ce3c9b2825","last_reissued_at":"2026-05-18T03:30:25.801964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:25.801964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Nearest Neighbor Algorithm for Mean Field Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antar Bandyopadhyay, Farkhondeh Sajadi","submitted_at":"2012-06-29T11:36:01Z","abstract_excerpt":"In this work we consider the mean field traveling salesman problem, where the intercity distances are taken to be i.i.d. with some distribution $F$. This paper focus on the \\emph{nearest neighbor tour} which is to move to the nearest non-visited city and we show that under some conditions on $F$, which are satisfied by exponential distribution with constant mean, the total length of the nearest neighbor tour, asymptotically almost surely scales as $\\log n$. Similar result is known for Euclidean TSP and nearest neighbor tour. We further derive the limiting behavior of the total length of the ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6991","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":"1206.6991","created_at":"2026-05-18T03:30:25.802127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6991v3","created_at":"2026-05-18T03:30:25.802127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6991","created_at":"2026-05-18T03:30:25.802127+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXMEF4BF4XBW","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXMEF4BF4XBWNARW","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXMEF4BF","created_at":"2026-05-18T12:27:20.899486+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/QXMEF4BF4XBWNARWFD47UYDIO4","json":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4.json","graph_json":"https://pith.science/api/pith-number/QXMEF4BF4XBWNARWFD47UYDIO4/graph.json","events_json":"https://pith.science/api/pith-number/QXMEF4BF4XBWNARWFD47UYDIO4/events.json","paper":"https://pith.science/paper/QXMEF4BF"},"agent_actions":{"view_html":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4","download_json":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4.json","view_paper":"https://pith.science/paper/QXMEF4BF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6991&json=true","fetch_graph":"https://pith.science/api/pith-number/QXMEF4BF4XBWNARWFD47UYDIO4/graph.json","fetch_events":"https://pith.science/api/pith-number/QXMEF4BF4XBWNARWFD47UYDIO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4/action/storage_attestation","attest_author":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4/action/author_attestation","sign_citation":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4/action/citation_signature","submit_replication":"https://pith.science/pith/QXMEF4BF4XBWNARWFD47UYDIO4/action/replication_record"}},"created_at":"2026-05-18T03:30:25.802127+00:00","updated_at":"2026-05-18T03:30:25.802127+00:00"}