{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4BUBZBUXA4BI3Z2OJE2NFYOVS7","short_pith_number":"pith:4BUBZBUX","canonical_record":{"source":{"id":"2503.03350","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-05T10:22:49Z","cross_cats_sorted":[],"title_canon_sha256":"6bf61aba748169775de4d392a6a73a6ad9b801c60ed053faf68edce8226ad1b2","abstract_canon_sha256":"52c4cfd28ee6c8e2b7d1a6b0426c24c610ed4182734920d0c7d113a867c10992"},"schema_version":"1.0"},"canonical_sha256":"e0681c869707028de74e4934d2e1d597cfa5a7ed97dc834f65c8f6e447573959","source":{"kind":"arxiv","id":"2503.03350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.03350","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"2503.03350v1","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03350","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"4BUBZBUXA4BI","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"pith_short_16","alias_value":"4BUBZBUXA4BI3Z2O","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"pith_short_8","alias_value":"4BUBZBUX","created_at":"2026-07-05T10:24:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4BUBZBUXA4BI3Z2OJE2NFYOVS7","target":"record","payload":{"canonical_record":{"source":{"id":"2503.03350","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-05T10:22:49Z","cross_cats_sorted":[],"title_canon_sha256":"6bf61aba748169775de4d392a6a73a6ad9b801c60ed053faf68edce8226ad1b2","abstract_canon_sha256":"52c4cfd28ee6c8e2b7d1a6b0426c24c610ed4182734920d0c7d113a867c10992"},"schema_version":"1.0"},"canonical_sha256":"e0681c869707028de74e4934d2e1d597cfa5a7ed97dc834f65c8f6e447573959","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:43.893147Z","signature_b64":"7gg1rQcumrfkDYxdXsiWzz0nzbP+5P7hzPeFhT5Ag7AKX+tQmKuGLm4y3WIfKkBfNLPjogaawq6VM4lL/RSyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0681c869707028de74e4934d2e1d597cfa5a7ed97dc834f65c8f6e447573959","last_reissued_at":"2026-07-05T10:24:43.892647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:43.892647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.03350","source_version":1,"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-05T10:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Du83Ud33tOLlZuaGewX775g0ptyS73szKR+G2WatywiS3bI4bZim0zTzGYE+Ly8Tb5ZLcQv4kVEhmtACydMBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:49:59.551552Z"},"content_sha256":"f086de6139ff6c7a3697cd1d4f6cab53ffd08e27df99e0572e0075d250cfbea6","schema_version":"1.0","event_id":"sha256:f086de6139ff6c7a3697cd1d4f6cab53ffd08e27df99e0572e0075d250cfbea6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4BUBZBUXA4BI3Z2OJE2NFYOVS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anne Meyer, Laura D\\\"orr, Max Disselnmeyer, Nico Koltermann, Thomas B\\\"omer","submitted_at":"2025-03-05T10:22:49Z","abstract_excerpt":"Combinatorial optimization problems often rely on heuristic algorithms to generate efficient solutions. However, the manual design of heuristics is resource-intensive and constrained by the designer's expertise. Recent advances in artificial intelligence, particularly large language models (LLMs), have demonstrated the potential to automate heuristic generation through evolutionary frameworks. Recent works focus only on well-known combinatorial optimization problems like the traveling salesman problem and online bin packing problem when designing constructive heuristics. This study investigate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03350","kind":"arxiv","version":1},"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/2503.03350/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-05T10:24:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EyxfWQRrEh85uoZslSa6rlB9VB4DWyAONVdzC4G51SYdXYplJAhmVPiAx6SLd1RIVJJ9+pGij1EZZExOeTICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:49:59.552084Z"},"content_sha256":"b3fe2834480ba90a2d0c6a595f3fc7fad68b29fe911f0bba9b0224891273fa23","schema_version":"1.0","event_id":"sha256:b3fe2834480ba90a2d0c6a595f3fc7fad68b29fe911f0bba9b0224891273fa23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7/bundle.json","state_url":"https://pith.science/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7/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-09T12:49:59Z","links":{"resolver":"https://pith.science/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7","bundle":"https://pith.science/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7/bundle.json","state":"https://pith.science/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BUBZBUXA4BI3Z2OJE2NFYOVS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4BUBZBUXA4BI3Z2OJE2NFYOVS7","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":"52c4cfd28ee6c8e2b7d1a6b0426c24c610ed4182734920d0c7d113a867c10992","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-05T10:22:49Z","title_canon_sha256":"6bf61aba748169775de4d392a6a73a6ad9b801c60ed053faf68edce8226ad1b2"},"schema_version":"1.0","source":{"id":"2503.03350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.03350","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"arxiv_version","alias_value":"2503.03350v1","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03350","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"pith_short_12","alias_value":"4BUBZBUXA4BI","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"pith_short_16","alias_value":"4BUBZBUXA4BI3Z2O","created_at":"2026-07-05T10:24:43Z"},{"alias_kind":"pith_short_8","alias_value":"4BUBZBUX","created_at":"2026-07-05T10:24:43Z"}],"graph_snapshots":[{"event_id":"sha256:b3fe2834480ba90a2d0c6a595f3fc7fad68b29fe911f0bba9b0224891273fa23","target":"graph","created_at":"2026-07-05T10:24:43Z","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/2503.03350/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization problems often rely on heuristic algorithms to generate efficient solutions. However, the manual design of heuristics is resource-intensive and constrained by the designer's expertise. Recent advances in artificial intelligence, particularly large language models (LLMs), have demonstrated the potential to automate heuristic generation through evolutionary frameworks. Recent works focus only on well-known combinatorial optimization problems like the traveling salesman problem and online bin packing problem when designing constructive heuristics. This study investigate","authors_text":"Anne Meyer, Laura D\\\"orr, Max Disselnmeyer, Nico Koltermann, Thomas B\\\"omer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-05T10:22:49Z","title":"Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03350","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:f086de6139ff6c7a3697cd1d4f6cab53ffd08e27df99e0572e0075d250cfbea6","target":"record","created_at":"2026-07-05T10:24:43Z","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":"52c4cfd28ee6c8e2b7d1a6b0426c24c610ed4182734920d0c7d113a867c10992","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-05T10:22:49Z","title_canon_sha256":"6bf61aba748169775de4d392a6a73a6ad9b801c60ed053faf68edce8226ad1b2"},"schema_version":"1.0","source":{"id":"2503.03350","kind":"arxiv","version":1}},"canonical_sha256":"e0681c869707028de74e4934d2e1d597cfa5a7ed97dc834f65c8f6e447573959","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0681c869707028de74e4934d2e1d597cfa5a7ed97dc834f65c8f6e447573959","first_computed_at":"2026-07-05T10:24:43.892647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:24:43.892647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7gg1rQcumrfkDYxdXsiWzz0nzbP+5P7hzPeFhT5Ag7AKX+tQmKuGLm4y3WIfKkBfNLPjogaawq6VM4lL/RSyDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:24:43.893147Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.03350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f086de6139ff6c7a3697cd1d4f6cab53ffd08e27df99e0572e0075d250cfbea6","sha256:b3fe2834480ba90a2d0c6a595f3fc7fad68b29fe911f0bba9b0224891273fa23"],"state_sha256":"beae458dfe4c7cf0a56979157c8ec7478b05d760d454e8e8ef3acc4e0d74ce0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MYYekjVjBwAeFaQCYy55b7g4Gds+L9il1vP2TmSQXPji1a1Z5mp0JZ4NpizeT8Lj5srR79lNLzloWR7UZ+WAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:49:59.556582Z","bundle_sha256":"570110bfd0ee67e66a26e654d8289053276219b1bd4cedc61ef9379f93d3ecf3"}}