{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZTN6OWD2UTAQXHOPERQFB33OEZ","short_pith_number":"pith:ZTN6OWD2","canonical_record":{"source":{"id":"2307.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-04T01:56:07Z","cross_cats_sorted":["cs.NE","math.CO"],"title_canon_sha256":"6fe355105b922688bd0a565badafc13fe62e6d1ba8cd296604492c33071ca237","abstract_canon_sha256":"2b6543246aa9161b54925f6976f42b0f9374ed07539f00371adfbd8d752d9914"},"schema_version":"1.0"},"canonical_sha256":"ccdbe7587aa4c10b9dcf246050ef6e26604c75eeb243fc47a8fb50a6003e6b50","source":{"kind":"arxiv","id":"2307.01434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.01434","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"2307.01434v1","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01434","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZTN6OWD2UTAQ","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZTN6OWD2UTAQXHOP","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZTN6OWD2","created_at":"2026-07-05T06:27:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZTN6OWD2UTAQXHOPERQFB33OEZ","target":"record","payload":{"canonical_record":{"source":{"id":"2307.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-04T01:56:07Z","cross_cats_sorted":["cs.NE","math.CO"],"title_canon_sha256":"6fe355105b922688bd0a565badafc13fe62e6d1ba8cd296604492c33071ca237","abstract_canon_sha256":"2b6543246aa9161b54925f6976f42b0f9374ed07539f00371adfbd8d752d9914"},"schema_version":"1.0"},"canonical_sha256":"ccdbe7587aa4c10b9dcf246050ef6e26604c75eeb243fc47a8fb50a6003e6b50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:56.450923Z","signature_b64":"CdSYfGJ6BiWEwRZAL4TlOMHNSjTDtN/i+usOjfwGsMRPOuj8uaAL2e569bcHpLh+1f00TCVyPcuGlsfp6Jq8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdbe7587aa4c10b9dcf246050ef6e26604c75eeb243fc47a8fb50a6003e6b50","last_reissued_at":"2026-07-05T06:27:56.450518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:56.450518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.01434","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-05T06:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xx2ap3qo9aQ246gSUjvyrTiCU++xJH9Rh3v1SDYSaPxn+1glu8VwmtDUtwgwj/l/AsubOq2JxjSMBQ6Z0tilAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:46:58.654261Z"},"content_sha256":"741c73e25977a59af4f524c1662e4654fb15f31303f0c595b8216278726308cb","schema_version":"1.0","event_id":"sha256:741c73e25977a59af4f524c1662e4654fb15f31303f0c595b8216278726308cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZTN6OWD2UTAQXHOPERQFB33OEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Branch in Combinatorial Optimization with Graph Pointer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.CO"],"primary_cat":"cs.LG","authors_text":"Kaiwen Li, Ling Wang, Rui Wang, Tao Zhang, Xiangke Liao, Xin Xu, Zhiming Zhou","submitted_at":"2023-07-04T01:56:07Z","abstract_excerpt":"Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the branch-and-bound. We extract the graph features, global features and historical features to represent the solver state. The proposed model, which combines the graph neural network and the pointer mechanism, can effectively map from the solver state to the branching variable decisions. The model is trained to imitate the classic strong branching expert rule by a designed top-k Kullback-Leibler divergence loss function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01434","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/2307.01434/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-05T06:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anIWjp003QxOgY5Kg/eEgepEcp4thSCYhw7pVW4PKh+nOUKgCEKNNKQIwIeRqmbPbdgufIHWrb/Yds7+z2+XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:46:58.654916Z"},"content_sha256":"110452ac79e4c9a527ab2ebdc0834769775a9cebd353b86a953c412bd99645fb","schema_version":"1.0","event_id":"sha256:110452ac79e4c9a527ab2ebdc0834769775a9cebd353b86a953c412bd99645fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ/bundle.json","state_url":"https://pith.science/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ/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-07-07T07:46:58Z","links":{"resolver":"https://pith.science/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ","bundle":"https://pith.science/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ/bundle.json","state":"https://pith.science/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTN6OWD2UTAQXHOPERQFB33OEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZTN6OWD2UTAQXHOPERQFB33OEZ","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":"2b6543246aa9161b54925f6976f42b0f9374ed07539f00371adfbd8d752d9914","cross_cats_sorted":["cs.NE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-04T01:56:07Z","title_canon_sha256":"6fe355105b922688bd0a565badafc13fe62e6d1ba8cd296604492c33071ca237"},"schema_version":"1.0","source":{"id":"2307.01434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.01434","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"2307.01434v1","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01434","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZTN6OWD2UTAQ","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZTN6OWD2UTAQXHOP","created_at":"2026-07-05T06:27:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZTN6OWD2","created_at":"2026-07-05T06:27:56Z"}],"graph_snapshots":[{"event_id":"sha256:110452ac79e4c9a527ab2ebdc0834769775a9cebd353b86a953c412bd99645fb","target":"graph","created_at":"2026-07-05T06:27: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/2307.01434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the branch-and-bound. We extract the graph features, global features and historical features to represent the solver state. The proposed model, which combines the graph neural network and the pointer mechanism, can effectively map from the solver state to the branching variable decisions. The model is trained to imitate the classic strong branching expert rule by a designed top-k Kullback-Leibler divergence loss function","authors_text":"Kaiwen Li, Ling Wang, Rui Wang, Tao Zhang, Xiangke Liao, Xin Xu, Zhiming Zhou","cross_cats":["cs.NE","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-04T01:56:07Z","title":"Learning to Branch in Combinatorial Optimization with Graph Pointer Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01434","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:741c73e25977a59af4f524c1662e4654fb15f31303f0c595b8216278726308cb","target":"record","created_at":"2026-07-05T06:27: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":"2b6543246aa9161b54925f6976f42b0f9374ed07539f00371adfbd8d752d9914","cross_cats_sorted":["cs.NE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-04T01:56:07Z","title_canon_sha256":"6fe355105b922688bd0a565badafc13fe62e6d1ba8cd296604492c33071ca237"},"schema_version":"1.0","source":{"id":"2307.01434","kind":"arxiv","version":1}},"canonical_sha256":"ccdbe7587aa4c10b9dcf246050ef6e26604c75eeb243fc47a8fb50a6003e6b50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccdbe7587aa4c10b9dcf246050ef6e26604c75eeb243fc47a8fb50a6003e6b50","first_computed_at":"2026-07-05T06:27:56.450518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:27:56.450518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CdSYfGJ6BiWEwRZAL4TlOMHNSjTDtN/i+usOjfwGsMRPOuj8uaAL2e569bcHpLh+1f00TCVyPcuGlsfp6Jq8Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:27:56.450923Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.01434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:741c73e25977a59af4f524c1662e4654fb15f31303f0c595b8216278726308cb","sha256:110452ac79e4c9a527ab2ebdc0834769775a9cebd353b86a953c412bd99645fb"],"state_sha256":"6a3013dafbd7544509d91660c200f268f8796c387d1374ea7b27ef285518c21b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hglEp60Zyi1wSRU55rACOTiUHvGMOgjgNKsp9oqOmaAlqubOnlohMhSdMeH+Cvf2o7yqK8aUEvreApR4tNT1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:46:58.658103Z","bundle_sha256":"4af8d3b349cadfbfc1cd89a0f9e67c130fd37b14bf17462e84dd38251e1d8f27"}}