{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MJQDAIVZAVMKHDC47QVQOQ7EXS","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":"cbf9b3ea7ec154e3367d68266687962c8d7ff48e39bb7e0da0c2ec06a568c726","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-24T17:13:41Z","title_canon_sha256":"b334fbaedc6d6d1af18e6dfb3525cdd738dc9442466d4de94456951c32524435"},"schema_version":"1.0","source":{"id":"2508.17452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.17452","created_at":"2026-07-05T11:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"2508.17452v1","created_at":"2026-07-05T11:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.17452","created_at":"2026-07-05T11:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"MJQDAIVZAVMK","created_at":"2026-07-05T11:58:41Z"},{"alias_kind":"pith_short_16","alias_value":"MJQDAIVZAVMKHDC4","created_at":"2026-07-05T11:58:41Z"},{"alias_kind":"pith_short_8","alias_value":"MJQDAIVZ","created_at":"2026-07-05T11:58:41Z"}],"graph_snapshots":[{"event_id":"sha256:3b01ee612120fac7de33da7f1925815d5a433b98f7dd221e937e880f1c73fe2f","target":"graph","created_at":"2026-07-05T11:58:41Z","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/2508.17452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Branch-and-bound (B&B) algorithm is the main solver for Mixed Integer Linear Programs (MILPs), where the selection of branching variable is essential to computational efficiency. However, traditional heuristics for branching often fail to generalize across heterogeneous problem instances, while existing learning-based methods such as imitation learning (IL) suffers from dependence on expert demonstration quality, and reinforcement learning (RL) struggles with limitations in sparse rewards and dynamic state representation challenges. To address these issues, we propose ReviBranch, a novel d","authors_text":"Canran Xiao, Dou Jiabao, Feixiang Du, Jiaping Xiao, Jinwei Liu, Nie Jiayi, Yihang Cheng, Yingrui Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-24T17:13:41Z","title":"ReviBranch: Deep Reinforcement Learning for Branch-and-Bound with Revived Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.17452","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:f50902b4db3338c4dac9135c756210916d4bfb3852bab8be38fb7b7d944885be","target":"record","created_at":"2026-07-05T11:58:41Z","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":"cbf9b3ea7ec154e3367d68266687962c8d7ff48e39bb7e0da0c2ec06a568c726","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-24T17:13:41Z","title_canon_sha256":"b334fbaedc6d6d1af18e6dfb3525cdd738dc9442466d4de94456951c32524435"},"schema_version":"1.0","source":{"id":"2508.17452","kind":"arxiv","version":1}},"canonical_sha256":"62603022b90558a38c5cfc2b0743e4bcbdebfbeaf0333362faa33a0031d0fd51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62603022b90558a38c5cfc2b0743e4bcbdebfbeaf0333362faa33a0031d0fd51","first_computed_at":"2026-07-05T11:58:41.737982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:41.737982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FxgQTZVE8t23WA3K5Swmsy0NZ/QgrZO4GzKAH4hS9ZfpJXvFETZcb9hOg8hp/YYu6DSDe8BpKW7vAqwA6L5ABw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:41.738532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.17452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f50902b4db3338c4dac9135c756210916d4bfb3852bab8be38fb7b7d944885be","sha256:3b01ee612120fac7de33da7f1925815d5a433b98f7dd221e937e880f1c73fe2f"],"state_sha256":"136a3264318e28ab23c92ca1ab19a46e991d982a2b4f5c421fa2fb944832a1bb"}