{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4ZSZ5KGLZTO6QUI32AKBAES6CI","short_pith_number":"pith:4ZSZ5KGL","canonical_record":{"source":{"id":"2310.19046","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-10-29T15:44:52Z","cross_cats_sorted":[],"title_canon_sha256":"517c883ed0b51e9567f9806ee2672938af97aad69148605f8f5174177f191328","abstract_canon_sha256":"1a7236f76930177bd09b459d58191474ef34d3767db0194116709c155dd23d8d"},"schema_version":"1.0"},"canonical_sha256":"e6659ea8cbccdde8511bd01410125e12177c84a06528e132b5264f48914bdeee","source":{"kind":"arxiv","id":"2310.19046","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.19046","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"arxiv_version","alias_value":"2310.19046v3","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19046","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"pith_short_12","alias_value":"4ZSZ5KGLZTO6","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"pith_short_16","alias_value":"4ZSZ5KGLZTO6QUI3","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"pith_short_8","alias_value":"4ZSZ5KGL","created_at":"2026-07-05T08:12:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4ZSZ5KGLZTO6QUI32AKBAES6CI","target":"record","payload":{"canonical_record":{"source":{"id":"2310.19046","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-10-29T15:44:52Z","cross_cats_sorted":[],"title_canon_sha256":"517c883ed0b51e9567f9806ee2672938af97aad69148605f8f5174177f191328","abstract_canon_sha256":"1a7236f76930177bd09b459d58191474ef34d3767db0194116709c155dd23d8d"},"schema_version":"1.0"},"canonical_sha256":"e6659ea8cbccdde8511bd01410125e12177c84a06528e132b5264f48914bdeee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:28.342717Z","signature_b64":"3FFVaSYOmZGBIDFTJY9hMWYDRGt21usdFHZdrSzKgpRAM8yxMrMqRdjcKI4iGI1lvGX38G8cW5vHgPtiAbw1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6659ea8cbccdde8511bd01410125e12177c84a06528e132b5264f48914bdeee","last_reissued_at":"2026-07-05T08:12:28.342245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:28.342245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.19046","source_version":3,"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-07-05T08:12:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9JhHcQ1N69Nlgf1vIX23OrTVZrbjp0lFuxwVvgdMulmVVxU/y4Ti8Ju4P/PaAddAM1whxE/OSCjQ6LEqYP9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:44:22.167619Z"},"content_sha256":"bd5bdd9b5e57c7417e7ffb38b9361c755a1ab4a71f635d5c0acf2419920dea6b","schema_version":"1.0","event_id":"sha256:bd5bdd9b5e57c7417e7ffb38b9361c755a1ab4a71f635d5c0acf2419920dea6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4ZSZ5KGLZTO6QUI32AKBAES6CI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Language Models as Evolutionary Optimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Caishun Chen, Ke Tang, Shengcai Liu, Xinghua Qu, Yew-Soon Ong","submitted_at":"2023-10-29T15:44:52Z","abstract_excerpt":"Evolutionary algorithms (EAs) have achieved remarkable success in tackling complex combinatorial optimization problems. However, EAs often demand carefully-designed operators with the aid of domain expertise to achieve satisfactory performance. In this work, we present the first study on large language models (LLMs) as evolutionary combinatorial optimizers. The main advantage is that it requires minimal domain knowledge and human efforts, as well as no additional training of the model. This approach is referred to as LLM-driven EA (LMEA). Specifically, in each generation of the evolutionary se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19046","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.19046/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:12:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjvJVRWmPZTvk3MCSW5bSEpDObAeTxnvp8Y4G9BGZbMDW6hRFCGqVfWKpN/I4OfJa4yDX2Myo+RE+xgwGzONBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:44:22.168150Z"},"content_sha256":"415d11a4c7836af4113ecf4631074da1863403dfb58f6ef8a2d23a9db6e8989e","schema_version":"1.0","event_id":"sha256:415d11a4c7836af4113ecf4631074da1863403dfb58f6ef8a2d23a9db6e8989e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI/bundle.json","state_url":"https://pith.science/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI/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-08-08T20:44:22Z","links":{"resolver":"https://pith.science/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI","bundle":"https://pith.science/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI/bundle.json","state":"https://pith.science/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZSZ5KGLZTO6QUI32AKBAES6CI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4ZSZ5KGLZTO6QUI32AKBAES6CI","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":"1a7236f76930177bd09b459d58191474ef34d3767db0194116709c155dd23d8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-10-29T15:44:52Z","title_canon_sha256":"517c883ed0b51e9567f9806ee2672938af97aad69148605f8f5174177f191328"},"schema_version":"1.0","source":{"id":"2310.19046","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.19046","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"arxiv_version","alias_value":"2310.19046v3","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19046","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"pith_short_12","alias_value":"4ZSZ5KGLZTO6","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"pith_short_16","alias_value":"4ZSZ5KGLZTO6QUI3","created_at":"2026-07-05T08:12:28Z"},{"alias_kind":"pith_short_8","alias_value":"4ZSZ5KGL","created_at":"2026-07-05T08:12:28Z"}],"graph_snapshots":[{"event_id":"sha256:415d11a4c7836af4113ecf4631074da1863403dfb58f6ef8a2d23a9db6e8989e","target":"graph","created_at":"2026-07-05T08:12:28Z","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/2310.19046/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Evolutionary algorithms (EAs) have achieved remarkable success in tackling complex combinatorial optimization problems. However, EAs often demand carefully-designed operators with the aid of domain expertise to achieve satisfactory performance. In this work, we present the first study on large language models (LLMs) as evolutionary combinatorial optimizers. The main advantage is that it requires minimal domain knowledge and human efforts, as well as no additional training of the model. This approach is referred to as LLM-driven EA (LMEA). Specifically, in each generation of the evolutionary se","authors_text":"Caishun Chen, Ke Tang, Shengcai Liu, Xinghua Qu, Yew-Soon Ong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-10-29T15:44:52Z","title":"Large Language Models as Evolutionary Optimizers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19046","kind":"arxiv","version":3},"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:bd5bdd9b5e57c7417e7ffb38b9361c755a1ab4a71f635d5c0acf2419920dea6b","target":"record","created_at":"2026-07-05T08:12:28Z","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":"1a7236f76930177bd09b459d58191474ef34d3767db0194116709c155dd23d8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-10-29T15:44:52Z","title_canon_sha256":"517c883ed0b51e9567f9806ee2672938af97aad69148605f8f5174177f191328"},"schema_version":"1.0","source":{"id":"2310.19046","kind":"arxiv","version":3}},"canonical_sha256":"e6659ea8cbccdde8511bd01410125e12177c84a06528e132b5264f48914bdeee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6659ea8cbccdde8511bd01410125e12177c84a06528e132b5264f48914bdeee","first_computed_at":"2026-07-05T08:12:28.342245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:12:28.342245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3FFVaSYOmZGBIDFTJY9hMWYDRGt21usdFHZdrSzKgpRAM8yxMrMqRdjcKI4iGI1lvGX38G8cW5vHgPtiAbw1BA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:12:28.342717Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.19046","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd5bdd9b5e57c7417e7ffb38b9361c755a1ab4a71f635d5c0acf2419920dea6b","sha256:415d11a4c7836af4113ecf4631074da1863403dfb58f6ef8a2d23a9db6e8989e"],"state_sha256":"9f54f38014f4928b7e17c059691ecdc9859a5335a0f0903d9d25749e6d205683"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4ZLy+t9F35N1jwdjpX0pw2Rnt45vNz6yj7Hc3ix2aWDbrXmQdBDK9/us8vdE/Oh3oVChiebcYdZtiQ7E9YJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:44:22.173884Z","bundle_sha256":"458ffe5bffb60c8de35294b894b6f5b75161b9e6e453bfe9ae6cdce797e48071"}}