{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4KVGWRX3F5MAQRXVMPQJEO2F5I","short_pith_number":"pith:4KVGWRX3","canonical_record":{"source":{"id":"2412.15534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T03:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"0f14029433e4ea5e86352700d9dabd6f889ca4e9a283f83e4602fcbe8250b5ba","abstract_canon_sha256":"bafc76b78708181f4d6be083bd4cb8c7f79c09f596a7ccc250a137581583611e"},"schema_version":"1.0"},"canonical_sha256":"e2aa6b46fb2f580846f563e0923b45ea130fd1b28c1d19aff1f98c070e8fcef1","source":{"kind":"arxiv","id":"2412.15534","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15534","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15534v2","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15534","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"4KVGWRX3F5MA","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"pith_short_16","alias_value":"4KVGWRX3F5MAQRXV","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"pith_short_8","alias_value":"4KVGWRX3","created_at":"2026-07-05T10:19:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4KVGWRX3F5MAQRXVMPQJEO2F5I","target":"record","payload":{"canonical_record":{"source":{"id":"2412.15534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T03:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"0f14029433e4ea5e86352700d9dabd6f889ca4e9a283f83e4602fcbe8250b5ba","abstract_canon_sha256":"bafc76b78708181f4d6be083bd4cb8c7f79c09f596a7ccc250a137581583611e"},"schema_version":"1.0"},"canonical_sha256":"e2aa6b46fb2f580846f563e0923b45ea130fd1b28c1d19aff1f98c070e8fcef1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:56.793797Z","signature_b64":"8ZAhenI8juej+j9OfeTFJwH8MF+sEcoC65gDLwE0gQHylO6zp4GAKHVk0L/tXz0fAMGxVRpDDPHtlfjPkPKzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2aa6b46fb2f580846f563e0923b45ea130fd1b28c1d19aff1f98c070e8fcef1","last_reissued_at":"2026-07-05T10:19:56.793256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:56.793256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.15534","source_version":2,"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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CRM7TKk+L1c3/CY4oHkuroBRUoGdXG2qydObrRXFdoRJx/YBHcYoInP+eLaA4i2R+w3EDwuB1Hd5oBGvpuvlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:29:21.826717Z"},"content_sha256":"d941f0b7bf586b06aa89e9402a606f651253a528337feb13382e280b17e93ecd","schema_version":"1.0","event_id":"sha256:d941f0b7bf586b06aa89e9402a606f651253a528337feb13382e280b17e93ecd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4KVGWRX3F5MAQRXVMPQJEO2F5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shengyu Feng, Yiming Yang","submitted_at":"2024-12-20T03:48:53Z","abstract_excerpt":"Mixed Integer Linear Program (MILP) solvers are mostly built upon a Branch-and-Bound (B\\&B) algorithm, where the efficiency of traditional solvers heavily depends on hand-crafted heuristics for branching. The past few years have witnessed the increasing popularity of data-driven approaches to automatically learn these heuristics. However, the success of these methods is highly dependent on the availability of high-quality demonstrations, which requires either the development of near-optimal heuristics or a time-consuming sampling process. This paper averts this challenge by proposing Suboptima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15534","kind":"arxiv","version":2},"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/2412.15534/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:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jA2uFlKNdsRvfo4mYptgS4tmWd0GXt5WnhNXzsDSbo6uBLCEZ77D7Oo0zDV3J4YgN3+4kITyUGtII5Gtc4OmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:29:21.827222Z"},"content_sha256":"727d857e45a991e92422c1a19364efef5e900b53fcdf5bf5960fe1e5e0b33e28","schema_version":"1.0","event_id":"sha256:727d857e45a991e92422c1a19364efef5e900b53fcdf5bf5960fe1e5e0b33e28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I/bundle.json","state_url":"https://pith.science/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I/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-12T10:29:21Z","links":{"resolver":"https://pith.science/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I","bundle":"https://pith.science/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I/bundle.json","state":"https://pith.science/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KVGWRX3F5MAQRXVMPQJEO2F5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4KVGWRX3F5MAQRXVMPQJEO2F5I","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":"bafc76b78708181f4d6be083bd4cb8c7f79c09f596a7ccc250a137581583611e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T03:48:53Z","title_canon_sha256":"0f14029433e4ea5e86352700d9dabd6f889ca4e9a283f83e4602fcbe8250b5ba"},"schema_version":"1.0","source":{"id":"2412.15534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.15534","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"arxiv_version","alias_value":"2412.15534v2","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15534","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"pith_short_12","alias_value":"4KVGWRX3F5MA","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"pith_short_16","alias_value":"4KVGWRX3F5MAQRXV","created_at":"2026-07-05T10:19:56Z"},{"alias_kind":"pith_short_8","alias_value":"4KVGWRX3","created_at":"2026-07-05T10:19:56Z"}],"graph_snapshots":[{"event_id":"sha256:727d857e45a991e92422c1a19364efef5e900b53fcdf5bf5960fe1e5e0b33e28","target":"graph","created_at":"2026-07-05T10:19:56Z","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/2412.15534/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Mixed Integer Linear Program (MILP) solvers are mostly built upon a Branch-and-Bound (B\\&B) algorithm, where the efficiency of traditional solvers heavily depends on hand-crafted heuristics for branching. The past few years have witnessed the increasing popularity of data-driven approaches to automatically learn these heuristics. However, the success of these methods is highly dependent on the availability of high-quality demonstrations, which requires either the development of near-optimal heuristics or a time-consuming sampling process. This paper averts this challenge by proposing Suboptima","authors_text":"Shengyu Feng, Yiming Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T03:48:53Z","title":"SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15534","kind":"arxiv","version":2},"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:d941f0b7bf586b06aa89e9402a606f651253a528337feb13382e280b17e93ecd","target":"record","created_at":"2026-07-05T10:19:56Z","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":"bafc76b78708181f4d6be083bd4cb8c7f79c09f596a7ccc250a137581583611e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-20T03:48:53Z","title_canon_sha256":"0f14029433e4ea5e86352700d9dabd6f889ca4e9a283f83e4602fcbe8250b5ba"},"schema_version":"1.0","source":{"id":"2412.15534","kind":"arxiv","version":2}},"canonical_sha256":"e2aa6b46fb2f580846f563e0923b45ea130fd1b28c1d19aff1f98c070e8fcef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2aa6b46fb2f580846f563e0923b45ea130fd1b28c1d19aff1f98c070e8fcef1","first_computed_at":"2026-07-05T10:19:56.793256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:56.793256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ZAhenI8juej+j9OfeTFJwH8MF+sEcoC65gDLwE0gQHylO6zp4GAKHVk0L/tXz0fAMGxVRpDDPHtlfjPkPKzBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:56.793797Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.15534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d941f0b7bf586b06aa89e9402a606f651253a528337feb13382e280b17e93ecd","sha256:727d857e45a991e92422c1a19364efef5e900b53fcdf5bf5960fe1e5e0b33e28"],"state_sha256":"d8f61511bfcb8004037e0657aa41a56eebd64413e4de5e2c33ea33fcc8c2aff2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lq8IA9K39oMTzr0qduViCz4ZHu5zLy26pUTTPSAJIjOJRS1Gs8w8Uv0HTljIvab7QuOanrUhlsFdKmM5gie/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T10:29:21.831654Z","bundle_sha256":"21e49a8b7f79ac3a0c5af29c0df91544bb573b0cb548d48f659146e878059156"}}