{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:745EU2BBZR3AJKIYTWYZE73EXX","short_pith_number":"pith:745EU2BB","canonical_record":{"source":{"id":"2201.06213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-17T04:50:11Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"7a9c9d35fab24d8ad294de98b4a8037dccca07b23f241ba80f66fff252460b4b","abstract_canon_sha256":"a23325abc5978be3ab44ea0a049ef2e43b05db3ca6578b4e8a6c69fa195a1df4"},"schema_version":"1.0"},"canonical_sha256":"ff3a4a6821cc7604a9189db1927f64bdd071688deccdc6688ca3cfaf78376aa6","source":{"kind":"arxiv","id":"2201.06213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06213","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06213v1","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06213","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"745EU2BBZR3A","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"pith_short_16","alias_value":"745EU2BBZR3AJKIY","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"pith_short_8","alias_value":"745EU2BB","created_at":"2026-07-05T03:48:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:745EU2BBZR3AJKIYTWYZE73EXX","target":"record","payload":{"canonical_record":{"source":{"id":"2201.06213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-17T04:50:11Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"7a9c9d35fab24d8ad294de98b4a8037dccca07b23f241ba80f66fff252460b4b","abstract_canon_sha256":"a23325abc5978be3ab44ea0a049ef2e43b05db3ca6578b4e8a6c69fa195a1df4"},"schema_version":"1.0"},"canonical_sha256":"ff3a4a6821cc7604a9189db1927f64bdd071688deccdc6688ca3cfaf78376aa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:55.979339Z","signature_b64":"ivq5Jxupce2YGT1FiVslfC77AwdWSzU5anemA5OX+/3v0iG2s1e1796zfYXD5I12dYtJ1VopsO6Wpi1xbaiJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff3a4a6821cc7604a9189db1927f64bdd071688deccdc6688ca3cfaf78376aa6","last_reissued_at":"2026-07-05T03:48:55.978901Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:55.978901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.06213","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-05T03:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3/xNhxtU042z7PzX9VbfrxRrNjAtFUxUMBgBenDFq+u7BM3pojuwu7fqfhngRVa6bIxYlAMZKsqz0EttzLCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:41:26.859159Z"},"content_sha256":"c1364449ee2c34684cd4460eb66d39e55b3ae5ce1f776a7e4a8e62f1c074f2f5","schema_version":"1.0","event_id":"sha256:c1364449ee2c34684cd4460eb66d39e55b3ae5ce1f776a7e4a8e62f1c074f2f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:745EU2BBZR3AJKIYTWYZE73EXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Reinforcement Learning Algorithm for Learning to Branch","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Jia Zeng, Jie Wang, Jinhu Lv, Kexin Liu, Kun Mao, Mingxuan Yuan, Qingyu Qu, Xijun Li, Yunfan Zhou","submitted_at":"2022-01-17T04:50:11Z","abstract_excerpt":"Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\\&B) is a general and widely used method. Recently, learning to branch has become a hot research topic in the intersection of machine learning and combinatorial optimization. In this paper, we propose a novel reinforcement learning-based B\\&B algorithm. Similar to offline reinforcement learning, we initially train on the demonstration data to accelerate learning massively. With the improvement of the training effect, the agent starts to interact with the environmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06213","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/2201.06213/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-05T03:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mVJE1J/Hzi3MmrHcnFonC+lV/hn6U0rM478ubaZnKBKRJOjP2DYeNuTCVrh/6Y+p2ToJVtUIHDhIFonWOEzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:41:26.859684Z"},"content_sha256":"5ea5ccfb70b4e1587b7a59a0e2f9d1157b63c4dd7899e3ebbc1a447885f76bc4","schema_version":"1.0","event_id":"sha256:5ea5ccfb70b4e1587b7a59a0e2f9d1157b63c4dd7899e3ebbc1a447885f76bc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/745EU2BBZR3AJKIYTWYZE73EXX/bundle.json","state_url":"https://pith.science/pith/745EU2BBZR3AJKIYTWYZE73EXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/745EU2BBZR3AJKIYTWYZE73EXX/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-10T03:41:26Z","links":{"resolver":"https://pith.science/pith/745EU2BBZR3AJKIYTWYZE73EXX","bundle":"https://pith.science/pith/745EU2BBZR3AJKIYTWYZE73EXX/bundle.json","state":"https://pith.science/pith/745EU2BBZR3AJKIYTWYZE73EXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/745EU2BBZR3AJKIYTWYZE73EXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:745EU2BBZR3AJKIYTWYZE73EXX","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":"a23325abc5978be3ab44ea0a049ef2e43b05db3ca6578b4e8a6c69fa195a1df4","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-17T04:50:11Z","title_canon_sha256":"7a9c9d35fab24d8ad294de98b4a8037dccca07b23f241ba80f66fff252460b4b"},"schema_version":"1.0","source":{"id":"2201.06213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.06213","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"2201.06213v1","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.06213","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"745EU2BBZR3A","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"pith_short_16","alias_value":"745EU2BBZR3AJKIY","created_at":"2026-07-05T03:48:55Z"},{"alias_kind":"pith_short_8","alias_value":"745EU2BB","created_at":"2026-07-05T03:48:55Z"}],"graph_snapshots":[{"event_id":"sha256:5ea5ccfb70b4e1587b7a59a0e2f9d1157b63c4dd7899e3ebbc1a447885f76bc4","target":"graph","created_at":"2026-07-05T03:48:55Z","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/2201.06213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\\&B) is a general and widely used method. Recently, learning to branch has become a hot research topic in the intersection of machine learning and combinatorial optimization. In this paper, we propose a novel reinforcement learning-based B\\&B algorithm. Similar to offline reinforcement learning, we initially train on the demonstration data to accelerate learning massively. With the improvement of the training effect, the agent starts to interact with the environmen","authors_text":"Jia Zeng, Jie Wang, Jinhu Lv, Kexin Liu, Kun Mao, Mingxuan Yuan, Qingyu Qu, Xijun Li, Yunfan Zhou","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-17T04:50:11Z","title":"An Improved Reinforcement Learning Algorithm for Learning to Branch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.06213","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:c1364449ee2c34684cd4460eb66d39e55b3ae5ce1f776a7e4a8e62f1c074f2f5","target":"record","created_at":"2026-07-05T03:48:55Z","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":"a23325abc5978be3ab44ea0a049ef2e43b05db3ca6578b4e8a6c69fa195a1df4","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-17T04:50:11Z","title_canon_sha256":"7a9c9d35fab24d8ad294de98b4a8037dccca07b23f241ba80f66fff252460b4b"},"schema_version":"1.0","source":{"id":"2201.06213","kind":"arxiv","version":1}},"canonical_sha256":"ff3a4a6821cc7604a9189db1927f64bdd071688deccdc6688ca3cfaf78376aa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff3a4a6821cc7604a9189db1927f64bdd071688deccdc6688ca3cfaf78376aa6","first_computed_at":"2026-07-05T03:48:55.978901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:55.978901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivq5Jxupce2YGT1FiVslfC77AwdWSzU5anemA5OX+/3v0iG2s1e1796zfYXD5I12dYtJ1VopsO6Wpi1xbaiJAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:55.979339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.06213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1364449ee2c34684cd4460eb66d39e55b3ae5ce1f776a7e4a8e62f1c074f2f5","sha256:5ea5ccfb70b4e1587b7a59a0e2f9d1157b63c4dd7899e3ebbc1a447885f76bc4"],"state_sha256":"548c907cf165a563fd984cbdd0e1c22c4b42cdf12026f76e684daf5fc3b9afff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4S4qMhb8zzEV3FheqXz6SLOVmk+zo4AZ2Li0oqtnvgm8JaoG4QwibG6PGm6RzyMFI0Iqf5LmtGHxByQyxhVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:41:26.863453Z","bundle_sha256":"3735207990166d772501187ae8464fa4c2b21297a5eef6c1dda2b7291485826f"}}