{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:R5PYNR32KT7JGVCFC5GGXTBARW","short_pith_number":"pith:R5PYNR32","canonical_record":{"source":{"id":"2302.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-01T04:59:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f5fd19c8c7e25faaebc4bca1c0528a6a0d81d9a5480c11ba035dc12c2ad2de6","abstract_canon_sha256":"ec019f3a1a03d1d24f4c11fa74364a2b3d41c9948b753439f281fae6ec27ee99"},"schema_version":"1.0"},"canonical_sha256":"8f5f86c77a54fe935445174c6bcc208da0cb2cc912f3c28f0bc2d0dc4c9badbf","source":{"kind":"arxiv","id":"2302.00244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00244","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00244v1","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00244","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_12","alias_value":"R5PYNR32KT7J","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_16","alias_value":"R5PYNR32KT7JGVCF","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_8","alias_value":"R5PYNR32","created_at":"2026-07-05T05:38:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:R5PYNR32KT7JGVCFC5GGXTBARW","target":"record","payload":{"canonical_record":{"source":{"id":"2302.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-01T04:59:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f5fd19c8c7e25faaebc4bca1c0528a6a0d81d9a5480c11ba035dc12c2ad2de6","abstract_canon_sha256":"ec019f3a1a03d1d24f4c11fa74364a2b3d41c9948b753439f281fae6ec27ee99"},"schema_version":"1.0"},"canonical_sha256":"8f5f86c77a54fe935445174c6bcc208da0cb2cc912f3c28f0bc2d0dc4c9badbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:01.252479Z","signature_b64":"H1VoTk21EWrCRjjXQl3f0Q5u57ganwPAJWFOLOXlbCgvQIGtOpsC+uWN/L/XnVlFmKa8qPdKdwgRF+nD4HgmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5f86c77a54fe935445174c6bcc208da0cb2cc912f3c28f0bc2d0dc4c9badbf","last_reissued_at":"2026-07-05T05:38:01.252040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:01.252040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.00244","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-05T05:38:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdeGA7ux//dUVDLW+fMIuurPa0UaB8R90RY1J8KWUWNHe9oDb17YdK3xWok3MMG1iWoeseQAXyyGt6onD+yxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:57:40.028561Z"},"content_sha256":"9fabe6ed8ddc76a37eecb306a323f827076df58e0d03ec113a1d101bb6dc89cc","schema_version":"1.0","event_id":"sha256:9fabe6ed8ddc76a37eecb306a323f827076df58e0d03ec113a1d101bb6dc89cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:R5PYNR32KT7JGVCFC5GGXTBARW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Feng Wu, Jia Zeng, Jie Wang, Mingxuan Yuan, Xijun Li, Yongdong Zhang, Yufei Kuang, Zhihai Wang","submitted_at":"2023-02-01T04:59:55Z","abstract_excerpt":"Cutting planes (cuts) are important for solving mixed-integer linear programs (MILPs), which formulate a wide range of important real-world applications. Cut selection -- which aims to select a proper subset of the candidate cuts to improve the efficiency of solving MILPs -- heavily depends on (P1) which cuts should be preferred, and (P2) how many cuts should be selected. Although many modern MILP solvers tackle (P1)-(P2) by manually designed heuristics, machine learning offers a promising approach to learn more effective heuristics from MILPs collected from specific applications. However, man"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00244","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/2302.00244/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-05T05:38:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z3jR2DpGIXrYsJQVDus/CggXiuHxG0JEBslYc2xli+nMPnTef9KCfomJ3cazh2YCKPXHElVzkQW4q+Ni0q8WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:57:40.029501Z"},"content_sha256":"ca37d8482f0e2022b47e6b598dbe0f848f8075907154e3e6005747ab6d230a5d","schema_version":"1.0","event_id":"sha256:ca37d8482f0e2022b47e6b598dbe0f848f8075907154e3e6005747ab6d230a5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5PYNR32KT7JGVCFC5GGXTBARW/bundle.json","state_url":"https://pith.science/pith/R5PYNR32KT7JGVCFC5GGXTBARW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5PYNR32KT7JGVCFC5GGXTBARW/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-08T12:57:40Z","links":{"resolver":"https://pith.science/pith/R5PYNR32KT7JGVCFC5GGXTBARW","bundle":"https://pith.science/pith/R5PYNR32KT7JGVCFC5GGXTBARW/bundle.json","state":"https://pith.science/pith/R5PYNR32KT7JGVCFC5GGXTBARW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5PYNR32KT7JGVCFC5GGXTBARW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:R5PYNR32KT7JGVCFC5GGXTBARW","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":"ec019f3a1a03d1d24f4c11fa74364a2b3d41c9948b753439f281fae6ec27ee99","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-01T04:59:55Z","title_canon_sha256":"5f5fd19c8c7e25faaebc4bca1c0528a6a0d81d9a5480c11ba035dc12c2ad2de6"},"schema_version":"1.0","source":{"id":"2302.00244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.00244","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"arxiv_version","alias_value":"2302.00244v1","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00244","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_12","alias_value":"R5PYNR32KT7J","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_16","alias_value":"R5PYNR32KT7JGVCF","created_at":"2026-07-05T05:38:01Z"},{"alias_kind":"pith_short_8","alias_value":"R5PYNR32","created_at":"2026-07-05T05:38:01Z"}],"graph_snapshots":[{"event_id":"sha256:ca37d8482f0e2022b47e6b598dbe0f848f8075907154e3e6005747ab6d230a5d","target":"graph","created_at":"2026-07-05T05:38:01Z","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/2302.00244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cutting planes (cuts) are important for solving mixed-integer linear programs (MILPs), which formulate a wide range of important real-world applications. Cut selection -- which aims to select a proper subset of the candidate cuts to improve the efficiency of solving MILPs -- heavily depends on (P1) which cuts should be preferred, and (P2) how many cuts should be selected. Although many modern MILP solvers tackle (P1)-(P2) by manually designed heuristics, machine learning offers a promising approach to learn more effective heuristics from MILPs collected from specific applications. However, man","authors_text":"Feng Wu, Jia Zeng, Jie Wang, Mingxuan Yuan, Xijun Li, Yongdong Zhang, Yufei Kuang, Zhihai Wang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-01T04:59:55Z","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00244","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:9fabe6ed8ddc76a37eecb306a323f827076df58e0d03ec113a1d101bb6dc89cc","target":"record","created_at":"2026-07-05T05:38:01Z","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":"ec019f3a1a03d1d24f4c11fa74364a2b3d41c9948b753439f281fae6ec27ee99","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-01T04:59:55Z","title_canon_sha256":"5f5fd19c8c7e25faaebc4bca1c0528a6a0d81d9a5480c11ba035dc12c2ad2de6"},"schema_version":"1.0","source":{"id":"2302.00244","kind":"arxiv","version":1}},"canonical_sha256":"8f5f86c77a54fe935445174c6bcc208da0cb2cc912f3c28f0bc2d0dc4c9badbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f5f86c77a54fe935445174c6bcc208da0cb2cc912f3c28f0bc2d0dc4c9badbf","first_computed_at":"2026-07-05T05:38:01.252040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:01.252040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H1VoTk21EWrCRjjXQl3f0Q5u57ganwPAJWFOLOXlbCgvQIGtOpsC+uWN/L/XnVlFmKa8qPdKdwgRF+nD4HgmBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:01.252479Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.00244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fabe6ed8ddc76a37eecb306a323f827076df58e0d03ec113a1d101bb6dc89cc","sha256:ca37d8482f0e2022b47e6b598dbe0f848f8075907154e3e6005747ab6d230a5d"],"state_sha256":"0aac13cb45569f6a4e8f13c59459a5cb604f589d384513f577e1a8002ace6df9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NT6JK/0LtrS51VApMTz6/CuKopcZV3Ckt42cGSOdcoiVUlKxXDhd1BaSw9C5aMKur6LdD0DR5uvI5jgR8uhcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:57:40.037415Z","bundle_sha256":"0fe527d6f6b191101fd83fc3e9941abc3bf6bf28442acb3dba2e2343c776dd42"}}