{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IOSUJ67QO74ID7LIUUXXXVI2ZR","short_pith_number":"pith:IOSUJ67Q","canonical_record":{"source":{"id":"2607.28135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T12:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"615832ae0f287d51436f168726276661f7aeb6b35af7bce438c5b41997c2e481","abstract_canon_sha256":"ef89a8daabbd8bea8cb2802447c4f97e93117ce0b9240dfb975e572ec21d6b19"},"schema_version":"1.0"},"canonical_sha256":"43a544fbf077f881fd68a52f7bd51acc78b4aba8b067a24e1572fd662b9be74b","source":{"kind":"arxiv","id":"2607.28135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28135","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28135v1","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28135","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_12","alias_value":"IOSUJ67QO74I","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_16","alias_value":"IOSUJ67QO74ID7LI","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_8","alias_value":"IOSUJ67Q","created_at":"2026-07-31T01:35:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IOSUJ67QO74ID7LIUUXXXVI2ZR","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T12:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"615832ae0f287d51436f168726276661f7aeb6b35af7bce438c5b41997c2e481","abstract_canon_sha256":"ef89a8daabbd8bea8cb2802447c4f97e93117ce0b9240dfb975e572ec21d6b19"},"schema_version":"1.0"},"canonical_sha256":"43a544fbf077f881fd68a52f7bd51acc78b4aba8b067a24e1572fd662b9be74b","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43a544fbf077f881fd68a52f7bd51acc78b4aba8b067a24e1572fd662b9be74b","last_reissued_at":"2026-07-31T01:35:50.671492Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:35:50.671492Z"},"source_kind":"arxiv","source_id":"2607.28135","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:35:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9QJHs0w5mhHilhl05qfZd1FJtVZBdxu5sszxVpNm3Lh6UJmonL9z9RlCKDW/UKyF/BJ4vE9EvAGxf6AaQW9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T17:43:12.681767Z"},"content_sha256":"d96856ad2b4dd938d6e14b1c67397e14266b9fde47655529fe79bedfa6879f4a","schema_version":"1.0","event_id":"sha256:d96856ad2b4dd938d6e14b1c67397e14266b9fde47655529fe79bedfa6879f4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IOSUJ67QO74ID7LIUUXXXVI2ZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LM-GRASP: Instance-Specific Language Models for Combinatorial Construction via Online Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gr\\'egoire Danoy, Mohand Mezmaz","submitted_at":"2026-07-30T12:45:18Z","abstract_excerpt":"Machine learning for combinatorial optimization typically relies on neural constructors trained via reinforcement learning on large offline datasets for a fixed problem class-incurring high pretraining costs and generalizing poorly outside the training distribution. We propose an alternative: a metaheuristic framework that reformulates the randomized constructive phase of GRASP as an online imitation learning task, trained from scratch on each problem instance. A local search procedure acts as an expert oracle, while a decoder-only Transformer serves as the constructive policy. Unlike classica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28135","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.28135/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:35:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/WInNY7TreIoxumZR9BQktbcaPdUnNXyzRagKKoDH8Y+c21EATto8akXMmOeaPRYA7mxNVEb3Tk7LwjXEEEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T17:43:12.682724Z"},"content_sha256":"3a1d7c9afbaf282bc973867c88de04aba66507b513da8f47435aad65670c7da4","schema_version":"1.0","event_id":"sha256:3a1d7c9afbaf282bc973867c88de04aba66507b513da8f47435aad65670c7da4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR/bundle.json","state_url":"https://pith.science/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR/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-01T17:43:12Z","links":{"resolver":"https://pith.science/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR","bundle":"https://pith.science/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR/bundle.json","state":"https://pith.science/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOSUJ67QO74ID7LIUUXXXVI2ZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IOSUJ67QO74ID7LIUUXXXVI2ZR","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":"ef89a8daabbd8bea8cb2802447c4f97e93117ce0b9240dfb975e572ec21d6b19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T12:45:18Z","title_canon_sha256":"615832ae0f287d51436f168726276661f7aeb6b35af7bce438c5b41997c2e481"},"schema_version":"1.0","source":{"id":"2607.28135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28135","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28135v1","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28135","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_12","alias_value":"IOSUJ67QO74I","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_16","alias_value":"IOSUJ67QO74ID7LI","created_at":"2026-07-31T01:35:50Z"},{"alias_kind":"pith_short_8","alias_value":"IOSUJ67Q","created_at":"2026-07-31T01:35:50Z"}],"graph_snapshots":[{"event_id":"sha256:3a1d7c9afbaf282bc973867c88de04aba66507b513da8f47435aad65670c7da4","target":"graph","created_at":"2026-07-31T01:35:50Z","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.28135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine learning for combinatorial optimization typically relies on neural constructors trained via reinforcement learning on large offline datasets for a fixed problem class-incurring high pretraining costs and generalizing poorly outside the training distribution. We propose an alternative: a metaheuristic framework that reformulates the randomized constructive phase of GRASP as an online imitation learning task, trained from scratch on each problem instance. A local search procedure acts as an expert oracle, while a decoder-only Transformer serves as the constructive policy. Unlike classica","authors_text":"Gr\\'egoire Danoy, Mohand Mezmaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T12:45:18Z","title":"LM-GRASP: Instance-Specific Language Models for Combinatorial Construction via Online Imitation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28135","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:d96856ad2b4dd938d6e14b1c67397e14266b9fde47655529fe79bedfa6879f4a","target":"record","created_at":"2026-07-31T01:35:50Z","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":"ef89a8daabbd8bea8cb2802447c4f97e93117ce0b9240dfb975e572ec21d6b19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T12:45:18Z","title_canon_sha256":"615832ae0f287d51436f168726276661f7aeb6b35af7bce438c5b41997c2e481"},"schema_version":"1.0","source":{"id":"2607.28135","kind":"arxiv","version":1}},"canonical_sha256":"43a544fbf077f881fd68a52f7bd51acc78b4aba8b067a24e1572fd662b9be74b","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43a544fbf077f881fd68a52f7bd51acc78b4aba8b067a24e1572fd662b9be74b","first_computed_at":"2026-07-31T01:35:50.671492Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:35:50.671492Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d96856ad2b4dd938d6e14b1c67397e14266b9fde47655529fe79bedfa6879f4a","sha256:3a1d7c9afbaf282bc973867c88de04aba66507b513da8f47435aad65670c7da4"],"state_sha256":"eb96e2d1ba813ad190644592585112f612c01b2edbd22903202d32ef7b5d87ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8Tj/ZyiHnJ7g1ZAWs2OLyTJ029fV1+d/L0POzZzmECp6c76RQbv93g8LOOXmzHCHs30Y5aryToOpt0HxBbdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T17:43:12.692686Z","bundle_sha256":"047850e64eaad9c568df3efac3e9261bff11bbe7df9c844bc72b505acaca4ede"}}