{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WOZZEBOZYDFV3NMMBZTP64VF2Z","short_pith_number":"pith:WOZZEBOZ","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"},"canonical_sha256":"b3b39205d9c0cb5db58c0e66ff72a5d65dea8242f7becac1a23dc3f32b6c9795","source":{"kind":"arxiv","id":"1612.06962","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06962","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06962v2","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06962","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"WOZZEBOZYDFV","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WOZZEBOZYDFV3NMM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WOZZEBOZ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WOZZEBOZYDFV3NMMBZTP64VF2Z","target":"record","payload":{"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"},"canonical_sha256":"b3b39205d9c0cb5db58c0e66ff72a5d65dea8242f7becac1a23dc3f32b6c9795","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"},"source_kind":"arxiv","source_id":"1612.06962","source_version":2,"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-18T00:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/x24GHk/kKdwHQhKmVNcED4HzXN79zcXOX339+xmQTxJztkrUT/W4x6KrMKhKyApn5ApJoSPsofElK4MWEEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:26.873927Z"},"content_sha256":"846d3f4208f7b71b0dbef692de99a9ba567f2b936039c23757c8903d6ca56d6b","schema_version":"1.0","event_id":"sha256:846d3f4208f7b71b0dbef692de99a9ba567f2b936039c23757c8903d6ca56d6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WOZZEBOZYDFV3NMMBZTP64VF2Z","target":"graph","payload":{"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"},"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-18T00:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMgrz7rE3jzgPE6HqOph+XIMCUlIRx740n0i0v+AbKSJa+SXhAOMxIRciyNpu2l7ejuFDy5eI7gW9YKIkvKlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:29:26.874513Z"},"content_sha256":"72e5cd309def2f8cd6a64ad0a5ad8b70e495b95c9e78ede03d72da4422b653a1","schema_version":"1.0","event_id":"sha256:72e5cd309def2f8cd6a64ad0a5ad8b70e495b95c9e78ede03d72da4422b653a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/bundle.json","state_url":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/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-03T07:29:26Z","links":{"resolver":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z","bundle":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/bundle.json","state":"https://pith.science/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOZZEBOZYDFV3NMMBZTP64VF2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WOZZEBOZYDFV3NMMBZTP64VF2Z","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":"581ba92da04a8ec81040da2422560cf352c6eac0ca485e023d530d31cb84487f","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-21T03:24:26Z","title_canon_sha256":"cf0c48846b08814826c1725decf569145ad5e2d148b1358aa89f99f2e0ec0f7c"},"schema_version":"1.0","source":{"id":"1612.06962","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06962","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06962v2","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06962","created_at":"2026-05-18T00:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"WOZZEBOZYDFV","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WOZZEBOZYDFV3NMM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WOZZEBOZ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:72e5cd309def2f8cd6a64ad0a5ad8b70e495b95c9e78ede03d72da4422b653a1","target":"graph","created_at":"2026-05-18T00:27:36Z","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":"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","authors_text":"Jianhui Lai, Rolf Moehring, Zijun Wu","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-21T03:24:26Z","title":"Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06962","kind":"arxiv","version":2},"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:846d3f4208f7b71b0dbef692de99a9ba567f2b936039c23757c8903d6ca56d6b","target":"record","created_at":"2026-05-18T00:27:36Z","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":"581ba92da04a8ec81040da2422560cf352c6eac0ca485e023d530d31cb84487f","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-21T03:24:26Z","title_canon_sha256":"cf0c48846b08814826c1725decf569145ad5e2d148b1358aa89f99f2e0ec0f7c"},"schema_version":"1.0","source":{"id":"1612.06962","kind":"arxiv","version":2}},"canonical_sha256":"b3b39205d9c0cb5db58c0e66ff72a5d65dea8242f7becac1a23dc3f32b6c9795","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3b39205d9c0cb5db58c0e66ff72a5d65dea8242f7becac1a23dc3f32b6c9795","first_computed_at":"2026-05-18T00:27:36.443651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:36.443651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fm0SolejJTmNOI0L6rio0SnCifx92P+kZ8C0EHWiUKtPtWOrnNbBS8FWRzxcAk5iV4UEgxOWxAIvKMPWtUYEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:36.444330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06962","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:846d3f4208f7b71b0dbef692de99a9ba567f2b936039c23757c8903d6ca56d6b","sha256:72e5cd309def2f8cd6a64ad0a5ad8b70e495b95c9e78ede03d72da4422b653a1"],"state_sha256":"b8c4e24bf8a37718d44b4ecbe05dad2a404c7212bee862b583d86af98696c626"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+bPNAtuWL+ENcxTbRZhPFIrJlcKbNvp8rYowOi5Kr5CSH5DMQamZT0jRwvcOHTYFYEQTfQCkAs0Bsa3siIdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:29:26.877275Z","bundle_sha256":"dd28b82ba78b7974af674566c3684290bb1419ba2667591ad14ed77cd8cf774c"}}