{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IMFCSCFW2YGD4RYMZQ5ROAEDDX","short_pith_number":"pith:IMFCSCFW","canonical_record":{"source":{"id":"2607.27698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T05:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"02a56f8790fa50da52ad02a366b46c5e8f0d56dbaf28a2b743a2aa488ae9c532","abstract_canon_sha256":"9937897bb12d24be4fb001cf1d60302461f9940362eb63791a3a6efc48d1035a"},"schema_version":"1.0"},"canonical_sha256":"430a2908b6d60c3e470ccc3b1700831deb89239a7aaa1990cc2d0799b69ac3dc","source":{"kind":"arxiv","id":"2607.27698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27698","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27698v1","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27698","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"pith_short_12","alias_value":"IMFCSCFW2YGD","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"pith_short_16","alias_value":"IMFCSCFW2YGD4RYM","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"pith_short_8","alias_value":"IMFCSCFW","created_at":"2026-07-31T01:29:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IMFCSCFW2YGD4RYMZQ5ROAEDDX","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T05:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"02a56f8790fa50da52ad02a366b46c5e8f0d56dbaf28a2b743a2aa488ae9c532","abstract_canon_sha256":"9937897bb12d24be4fb001cf1d60302461f9940362eb63791a3a6efc48d1035a"},"schema_version":"1.0"},"canonical_sha256":"430a2908b6d60c3e470ccc3b1700831deb89239a7aaa1990cc2d0799b69ac3dc","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"430a2908b6d60c3e470ccc3b1700831deb89239a7aaa1990cc2d0799b69ac3dc","last_reissued_at":"2026-07-31T01:29:48.969932Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:29:48.969932Z"},"source_kind":"arxiv","source_id":"2607.27698","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-31T01:29:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFfpTPs9bEHj7TgccxEvlyRoxDmAUEeAi806oKn67Z2OwB6afCzZhbY8xeImY4r8FxznY7ueyYNys+BeCY4HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:06:53.075754Z"},"content_sha256":"b90c9b362770996ae960614a283f92b16ecc78f95b93e7b03731e6ee19594ff0","schema_version":"1.0","event_id":"sha256:b90c9b362770996ae960614a283f92b16ecc78f95b93e7b03731e6ee19594ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IMFCSCFW2YGD4RYMZQ5ROAEDDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guiding Large Language Models with Genetic Programming-Evolved Heuristic Knowledge for Dynamic Multi-Mode Project Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mengjie Zhang, Yi Mei, Yuan Tian","submitted_at":"2026-07-30T05:30:09Z","abstract_excerpt":"In dynamic multi-mode project scheduling, activities have alternative execution modes and uncertain durations, while precedence relations and limited resources constrain their execution. Heuristic priority rules support fast online decisions, but their design requires substantial domain expertise. Genetic programming (GP) hyper-heuristics can automatically evolve such rules. Large language models (LLMs), meanwhile, provide a flexible interface for interpreting scheduling information and explaining decisions. However, zero-shot LLM decisions may lack domain knowledge, consume many tokens, and v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27698","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/2607.27698/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-31T01:29:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sayPjEcfK+xuAucKffU5aL2XOCokjF+V2rmC9/jqLWjM6nPghfBlhXWil8zcuCkHy7OcJ84kB5ytW+0OIhbcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:06:53.076882Z"},"content_sha256":"30d091e43b9e9f52f7833fb5b4e671ff071a4ef442eb1030cfab433e3800f192","schema_version":"1.0","event_id":"sha256:30d091e43b9e9f52f7833fb5b4e671ff071a4ef442eb1030cfab433e3800f192"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX/bundle.json","state_url":"https://pith.science/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX/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-06T21:06:53Z","links":{"resolver":"https://pith.science/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX","bundle":"https://pith.science/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX/bundle.json","state":"https://pith.science/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMFCSCFW2YGD4RYMZQ5ROAEDDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IMFCSCFW2YGD4RYMZQ5ROAEDDX","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":"9937897bb12d24be4fb001cf1d60302461f9940362eb63791a3a6efc48d1035a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T05:30:09Z","title_canon_sha256":"02a56f8790fa50da52ad02a366b46c5e8f0d56dbaf28a2b743a2aa488ae9c532"},"schema_version":"1.0","source":{"id":"2607.27698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27698","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27698v1","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27698","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"pith_short_12","alias_value":"IMFCSCFW2YGD","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"pith_short_16","alias_value":"IMFCSCFW2YGD4RYM","created_at":"2026-07-31T01:29:48Z"},{"alias_kind":"pith_short_8","alias_value":"IMFCSCFW","created_at":"2026-07-31T01:29:48Z"}],"graph_snapshots":[{"event_id":"sha256:30d091e43b9e9f52f7833fb5b4e671ff071a4ef442eb1030cfab433e3800f192","target":"graph","created_at":"2026-07-31T01:29:48Z","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/2607.27698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In dynamic multi-mode project scheduling, activities have alternative execution modes and uncertain durations, while precedence relations and limited resources constrain their execution. Heuristic priority rules support fast online decisions, but their design requires substantial domain expertise. Genetic programming (GP) hyper-heuristics can automatically evolve such rules. Large language models (LLMs), meanwhile, provide a flexible interface for interpreting scheduling information and explaining decisions. However, zero-shot LLM decisions may lack domain knowledge, consume many tokens, and v","authors_text":"Mengjie Zhang, Yi Mei, Yuan Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T05:30:09Z","title":"Guiding Large Language Models with Genetic Programming-Evolved Heuristic Knowledge for Dynamic Multi-Mode Project Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27698","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:b90c9b362770996ae960614a283f92b16ecc78f95b93e7b03731e6ee19594ff0","target":"record","created_at":"2026-07-31T01:29:48Z","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":"9937897bb12d24be4fb001cf1d60302461f9940362eb63791a3a6efc48d1035a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-30T05:30:09Z","title_canon_sha256":"02a56f8790fa50da52ad02a366b46c5e8f0d56dbaf28a2b743a2aa488ae9c532"},"schema_version":"1.0","source":{"id":"2607.27698","kind":"arxiv","version":1}},"canonical_sha256":"430a2908b6d60c3e470ccc3b1700831deb89239a7aaa1990cc2d0799b69ac3dc","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"430a2908b6d60c3e470ccc3b1700831deb89239a7aaa1990cc2d0799b69ac3dc","first_computed_at":"2026-07-31T01:29:48.969932Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:29:48.969932Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b90c9b362770996ae960614a283f92b16ecc78f95b93e7b03731e6ee19594ff0","sha256:30d091e43b9e9f52f7833fb5b4e671ff071a4ef442eb1030cfab433e3800f192"],"state_sha256":"064faa9f0bb83f6b8e5bcbf522a8f009ead22e93caa8473e6ed0e54bbe889217"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvPkIWGs2EFkciWI/AzkDh5gLwr2kmVfVkqVrOz02UGkV8Qtt77sa5f663r6LwIeRVpABIr7CO/4bPETff+/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:06:53.083907Z","bundle_sha256":"752b4eeb2131fb58c19a61abb28e49d950f1c4332e9d22d6604ff0fa356b945a"}}