{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WOZZEBOZYDFV3NMMBZTP64VF2Z","short_pith_number":"pith:WOZZEBOZ","schema_version":"1.0","canonical_sha256":"b3b39205d9c0cb5db58c0e66ff72a5d65dea8242f7becac1a23dc3f32b6c9795","source":{"kind":"arxiv","id":"1612.06962","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.DS","authors_text":"Jianhui Lai, Rolf Moehring, Zijun Wu","submitted_at":"2016-12-21T03:24:26Z","abstract_excerpt":"This article analyzes the stochastic runtime of a Cross-Entropy Algorithm on two classes of traveling salesman problems. The algorithm shares main features of the famous Max-Min Ant System with iteration-best reinforcement.\n  For simple instances that have a $\\{1,n\\}$-valued distance function and a unique optimal solution, we prove a stochastic runtime of $O(n^{6+\\epsilon})$ with the vertex-based random solution generation, and a stochastic runtime of $O(n^{3+\\epsilon}\\ln n)$ with the edge-based random solution generation for an arbitrary $\\epsilon\\in (0,1)$. These runtimes are very close to t"},"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":"1612.06962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-21T03:24:26Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"cf0c48846b08814826c1725decf569145ad5e2d148b1358aa89f99f2e0ec0f7c","abstract_canon_sha256":"581ba92da04a8ec81040da2422560cf352c6eac0ca485e023d530d31cb84487f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:36.444330Z","signature_b64":"fm0SolejJTmNOI0L6rio0SnCifx92P+kZ8C0EHWiUKtPtWOrnNbBS8FWRzxcAk5iV4UEgxOWxAIvKMPWtUYEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3b39205d9c0cb5db58c0e66ff72a5d65dea8242f7becac1a23dc3f32b6c9795","last_reissued_at":"2026-05-18T00:27:36.443651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:36.443651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.DS","authors_text":"Jianhui Lai, Rolf Moehring, Zijun Wu","submitted_at":"2016-12-21T03:24:26Z","abstract_excerpt":"This article analyzes the stochastic runtime of a Cross-Entropy Algorithm on two classes of traveling salesman problems. The algorithm shares main features of the famous Max-Min Ant System with iteration-best reinforcement.\n  For simple instances that have a $\\{1,n\\}$-valued distance function and a unique optimal solution, we prove a stochastic runtime of $O(n^{6+\\epsilon})$ with the vertex-based random solution generation, and a stochastic runtime of $O(n^{3+\\epsilon}\\ln n)$ with the edge-based random solution generation for an arbitrary $\\epsilon\\in (0,1)$. These runtimes are very close to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06962","kind":"arxiv","version":2},"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":"1612.06962","created_at":"2026-05-18T00:27:36.443755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06962v2","created_at":"2026-05-18T00:27:36.443755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06962","created_at":"2026-05-18T00:27:36.443755+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOZZEBOZYDFV","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOZZEBOZYDFV3NMM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOZZEBOZ","created_at":"2026-05-18T12:30:51.357362+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/WOZZEBOZYDFV3NMMBZTP64VF2Z","json":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z.json","graph_json":"https://pith.science/api/pith-number/WOZZEBOZYDFV3NMMBZTP64VF2Z/graph.json","events_json":"https://pith.science/api/pith-number/WOZZEBOZYDFV3NMMBZTP64VF2Z/events.json","paper":"https://pith.science/paper/WOZZEBOZ"},"agent_actions":{"view_html":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z","download_json":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z.json","view_paper":"https://pith.science/paper/WOZZEBOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06962&json=true","fetch_graph":"https://pith.science/api/pith-number/WOZZEBOZYDFV3NMMBZTP64VF2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/WOZZEBOZYDFV3NMMBZTP64VF2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/action/storage_attestation","attest_author":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/action/author_attestation","sign_citation":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/action/citation_signature","submit_replication":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/action/replication_record"}},"created_at":"2026-05-18T00:27:36.443755+00:00","updated_at":"2026-05-18T00:27:36.443755+00:00"}