{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZOCFD5U637CDVW4DFTTS6YXN3G","short_pith_number":"pith:ZOCFD5U6","canonical_record":{"source":{"id":"2501.11411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-01-20T11:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"8a5bf8407e6c0279fad67a5e02c13c46b3188be913a2984fa0c3ce7e260a8738","abstract_canon_sha256":"49267de2cfc2caa3c415434cdb6675696e613e96a2467f59539797abc5665114"},"schema_version":"1.0"},"canonical_sha256":"cb8451f69edfc43adb832ce72f62edd9a1a2cb3cbe2cbea6a135eaf5a28b3555","source":{"kind":"arxiv","id":"2501.11411","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11411","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11411v1","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11411","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZOCFD5U637CD","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_16","alias_value":"ZOCFD5U637CDVW4D","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_8","alias_value":"ZOCFD5U6","created_at":"2026-07-05T10:03:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZOCFD5U637CDVW4DFTTS6YXN3G","target":"record","payload":{"canonical_record":{"source":{"id":"2501.11411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-01-20T11:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"8a5bf8407e6c0279fad67a5e02c13c46b3188be913a2984fa0c3ce7e260a8738","abstract_canon_sha256":"49267de2cfc2caa3c415434cdb6675696e613e96a2467f59539797abc5665114"},"schema_version":"1.0"},"canonical_sha256":"cb8451f69edfc43adb832ce72f62edd9a1a2cb3cbe2cbea6a135eaf5a28b3555","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:08.309359Z","signature_b64":"N1aTvSOCDt97j0/BThRCpXO8ZpYZWX5kPqOYknszagxEg4RT7nXJBXWG9u5rxea/7JbrZRcND6OAqqUU/n7eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8451f69edfc43adb832ce72f62edd9a1a2cb3cbe2cbea6a135eaf5a28b3555","last_reissued_at":"2026-07-05T10:03:08.308920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:08.308920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.11411","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:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlrwVm6oyYTK++x5yNEBau7jf0Be/kbrXiK9ivziUZuyrdWAnwNhInu/s1/BIY2dEHkqaYC8Tc9OE1rTyKjDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:03:51.168375Z"},"content_sha256":"d7f68cd34e48206288088867ac7523537aa45a2105585c0103ed9fd23bd37b30","schema_version":"1.0","event_id":"sha256:d7f68cd34e48206288088867ac7523537aa45a2105585c0103ed9fd23bd37b30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZOCFD5U637CDVW4DFTTS6YXN3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Emma Hart, Kevin Sim, Quentin Renau","submitted_at":"2025-01-20T11:23:50Z","abstract_excerpt":"Coupling Large Language Models (LLMs) with Evolutionary Algorithms has recently shown significant promise as a technique to design new heuristics that outperform existing methods, particularly in the field of combinatorial optimisation. An escalating arms race is both rapidly producing new heuristics and improving the efficiency of the processes evolving them. However, driven by the desire to quickly demonstrate the superiority of new approaches, evaluation of the new heuristics produced for a specific domain is often cursory: testing on very few datasets in which instances all belong to a spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11411","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/2501.11411/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:03:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFt+Hqljhl6JHSoKCEr+LsqDX189F47AWpumHbXIUxEHQbY8E5OkKEiYGrR//aYymVVGPHKAKzZunFz6bYFpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:03:51.168939Z"},"content_sha256":"65f304681b7a76e913a52b1f867a4e8d1894ad89ba1818903475701f218d2192","schema_version":"1.0","event_id":"sha256:65f304681b7a76e913a52b1f867a4e8d1894ad89ba1818903475701f218d2192"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOCFD5U637CDVW4DFTTS6YXN3G/bundle.json","state_url":"https://pith.science/pith/ZOCFD5U637CDVW4DFTTS6YXN3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOCFD5U637CDVW4DFTTS6YXN3G/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-17T04:03:51Z","links":{"resolver":"https://pith.science/pith/ZOCFD5U637CDVW4DFTTS6YXN3G","bundle":"https://pith.science/pith/ZOCFD5U637CDVW4DFTTS6YXN3G/bundle.json","state":"https://pith.science/pith/ZOCFD5U637CDVW4DFTTS6YXN3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOCFD5U637CDVW4DFTTS6YXN3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZOCFD5U637CDVW4DFTTS6YXN3G","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":"49267de2cfc2caa3c415434cdb6675696e613e96a2467f59539797abc5665114","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-01-20T11:23:50Z","title_canon_sha256":"8a5bf8407e6c0279fad67a5e02c13c46b3188be913a2984fa0c3ce7e260a8738"},"schema_version":"1.0","source":{"id":"2501.11411","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11411","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11411v1","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11411","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZOCFD5U637CD","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_16","alias_value":"ZOCFD5U637CDVW4D","created_at":"2026-07-05T10:03:08Z"},{"alias_kind":"pith_short_8","alias_value":"ZOCFD5U6","created_at":"2026-07-05T10:03:08Z"}],"graph_snapshots":[{"event_id":"sha256:65f304681b7a76e913a52b1f867a4e8d1894ad89ba1818903475701f218d2192","target":"graph","created_at":"2026-07-05T10:03:08Z","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/2501.11411/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Coupling Large Language Models (LLMs) with Evolutionary Algorithms has recently shown significant promise as a technique to design new heuristics that outperform existing methods, particularly in the field of combinatorial optimisation. An escalating arms race is both rapidly producing new heuristics and improving the efficiency of the processes evolving them. However, driven by the desire to quickly demonstrate the superiority of new approaches, evaluation of the new heuristics produced for a specific domain is often cursory: testing on very few datasets in which instances all belong to a spe","authors_text":"Emma Hart, Kevin Sim, Quentin Renau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-01-20T11:23:50Z","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11411","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:d7f68cd34e48206288088867ac7523537aa45a2105585c0103ed9fd23bd37b30","target":"record","created_at":"2026-07-05T10:03:08Z","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":"49267de2cfc2caa3c415434cdb6675696e613e96a2467f59539797abc5665114","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-01-20T11:23:50Z","title_canon_sha256":"8a5bf8407e6c0279fad67a5e02c13c46b3188be913a2984fa0c3ce7e260a8738"},"schema_version":"1.0","source":{"id":"2501.11411","kind":"arxiv","version":1}},"canonical_sha256":"cb8451f69edfc43adb832ce72f62edd9a1a2cb3cbe2cbea6a135eaf5a28b3555","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb8451f69edfc43adb832ce72f62edd9a1a2cb3cbe2cbea6a135eaf5a28b3555","first_computed_at":"2026-07-05T10:03:08.308920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:08.308920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N1aTvSOCDt97j0/BThRCpXO8ZpYZWX5kPqOYknszagxEg4RT7nXJBXWG9u5rxea/7JbrZRcND6OAqqUU/n7eAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:08.309359Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.11411","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7f68cd34e48206288088867ac7523537aa45a2105585c0103ed9fd23bd37b30","sha256:65f304681b7a76e913a52b1f867a4e8d1894ad89ba1818903475701f218d2192"],"state_sha256":"0a6a378ff9c7b07478b0c6e9e1edd90d69f2cf15c83211d103cfed0a7f9b1887"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zO8mb4tYE1noNXSbGBDQDxZd43ZDrCtcRlSz2Ek9HO6fY5RcQIWvh7wXOdt5ZKlytHGWXNlspaqBXZdZe5TCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T04:03:51.173834Z","bundle_sha256":"f1ab7cce7c7440b676abd8980c2a71008063f1be8fff829ef4699826dd500132"}}