{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HRLCKGHX2DZ6CN7WYTFJGGK2RP","short_pith_number":"pith:HRLCKGHX","canonical_record":{"source":{"id":"2405.13992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T20:56:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"83e3f9aaf74df241e08e61646fa93bf2eaa6836d7300a8167db2e75c24cdf341","abstract_canon_sha256":"aa558720f39ed9fb332155e758253fbc156caceb23f03d43b8ca6bf3ba5581e8"},"schema_version":"1.0"},"canonical_sha256":"3c562518f7d0f3e137f6c4ca93195a8bfcba6316e98bc6650f3e694dd7431129","source":{"kind":"arxiv","id":"2405.13992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.13992","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.13992v1","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13992","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"HRLCKGHX2DZ6","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"pith_short_16","alias_value":"HRLCKGHX2DZ6CN7W","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"pith_short_8","alias_value":"HRLCKGHX","created_at":"2026-07-05T08:22:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HRLCKGHX2DZ6CN7WYTFJGGK2RP","target":"record","payload":{"canonical_record":{"source":{"id":"2405.13992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T20:56:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"83e3f9aaf74df241e08e61646fa93bf2eaa6836d7300a8167db2e75c24cdf341","abstract_canon_sha256":"aa558720f39ed9fb332155e758253fbc156caceb23f03d43b8ca6bf3ba5581e8"},"schema_version":"1.0"},"canonical_sha256":"3c562518f7d0f3e137f6c4ca93195a8bfcba6316e98bc6650f3e694dd7431129","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:09.116505Z","signature_b64":"0V3IIGgbD45QxWcdxy9t8wOka7YWnyvgV7ghOF4562dQSGwaPoHGAt2108TnC+gQbhFs4dbEhq1r2VbTkISRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c562518f7d0f3e137f6c4ca93195a8bfcba6316e98bc6650f3e694dd7431129","last_reissued_at":"2026-07-05T08:22:09.115942Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:09.115942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.13992","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-05T08:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzNdbwNtKd8ntft0ocjLp77jCUh3gQ2WWpMLZSHCOzDHxA/i1PnVAhZ2GC341jLnpxCuvofQ+yeabRgps/JCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:44:07.943284Z"},"content_sha256":"e396a565330a304527b96228291a3ab49d809fb278a095531328ccdca392c6c5","schema_version":"1.0","event_id":"sha256:e396a565330a304527b96228291a3ab49d809fb278a095531328ccdca392c6c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HRLCKGHX2DZ6CN7WYTFJGGK2RP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Cut Generating Functions for Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Amitabh Basu, Hongyu Cheng","submitted_at":"2024-05-22T20:56:34Z","abstract_excerpt":"The branch-and-cut algorithm is the method of choice to solve large scale integer programming problems in practice. A key ingredient of branch-and-cut is the use of cutting planes which are derived constraints that reduce the search space for an optimal solution. Selecting effective cutting planes to produce small branch-and-cut trees is a critical challenge in the branch-and-cut algorithm. Recent advances have employed a data-driven approach to select optimal cutting planes from a parameterized family, aimed at reducing the branch-and-bound tree size (in expectation) for a given distribution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13992","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/2405.13992/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-05T08:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NR6lDeKimjXJLJ5Dj5VHPHxHsdK00z/MVZ3uZ+Sn7ao6bT5pQCUlXHAaApxZR9PjcB9bTQGDLfOSwJJ94l/lAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:44:07.943805Z"},"content_sha256":"4c3366351976d05ca7b1abf10498a2ad78ed554b1480df2aa0f2b6f500512150","schema_version":"1.0","event_id":"sha256:4c3366351976d05ca7b1abf10498a2ad78ed554b1480df2aa0f2b6f500512150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP/bundle.json","state_url":"https://pith.science/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP/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-18T21:44:07Z","links":{"resolver":"https://pith.science/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP","bundle":"https://pith.science/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP/bundle.json","state":"https://pith.science/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRLCKGHX2DZ6CN7WYTFJGGK2RP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HRLCKGHX2DZ6CN7WYTFJGGK2RP","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":"aa558720f39ed9fb332155e758253fbc156caceb23f03d43b8ca6bf3ba5581e8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T20:56:34Z","title_canon_sha256":"83e3f9aaf74df241e08e61646fa93bf2eaa6836d7300a8167db2e75c24cdf341"},"schema_version":"1.0","source":{"id":"2405.13992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.13992","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"2405.13992v1","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13992","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"HRLCKGHX2DZ6","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"pith_short_16","alias_value":"HRLCKGHX2DZ6CN7W","created_at":"2026-07-05T08:22:09Z"},{"alias_kind":"pith_short_8","alias_value":"HRLCKGHX","created_at":"2026-07-05T08:22:09Z"}],"graph_snapshots":[{"event_id":"sha256:4c3366351976d05ca7b1abf10498a2ad78ed554b1480df2aa0f2b6f500512150","target":"graph","created_at":"2026-07-05T08:22:09Z","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/2405.13992/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The branch-and-cut algorithm is the method of choice to solve large scale integer programming problems in practice. A key ingredient of branch-and-cut is the use of cutting planes which are derived constraints that reduce the search space for an optimal solution. Selecting effective cutting planes to produce small branch-and-cut trees is a critical challenge in the branch-and-cut algorithm. Recent advances have employed a data-driven approach to select optimal cutting planes from a parameterized family, aimed at reducing the branch-and-bound tree size (in expectation) for a given distribution ","authors_text":"Amitabh Basu, Hongyu Cheng","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T20:56:34Z","title":"Learning Cut Generating Functions for Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13992","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:e396a565330a304527b96228291a3ab49d809fb278a095531328ccdca392c6c5","target":"record","created_at":"2026-07-05T08:22:09Z","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":"aa558720f39ed9fb332155e758253fbc156caceb23f03d43b8ca6bf3ba5581e8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-22T20:56:34Z","title_canon_sha256":"83e3f9aaf74df241e08e61646fa93bf2eaa6836d7300a8167db2e75c24cdf341"},"schema_version":"1.0","source":{"id":"2405.13992","kind":"arxiv","version":1}},"canonical_sha256":"3c562518f7d0f3e137f6c4ca93195a8bfcba6316e98bc6650f3e694dd7431129","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c562518f7d0f3e137f6c4ca93195a8bfcba6316e98bc6650f3e694dd7431129","first_computed_at":"2026-07-05T08:22:09.115942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:22:09.115942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0V3IIGgbD45QxWcdxy9t8wOka7YWnyvgV7ghOF4562dQSGwaPoHGAt2108TnC+gQbhFs4dbEhq1r2VbTkISRCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:22:09.116505Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.13992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e396a565330a304527b96228291a3ab49d809fb278a095531328ccdca392c6c5","sha256:4c3366351976d05ca7b1abf10498a2ad78ed554b1480df2aa0f2b6f500512150"],"state_sha256":"de09099ed5ff2faab32bd102ffd168df1ef146d1467e4b0c6df84f50fc41ed71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5AH4Hx6MwVXE1QaRRlBj0MuMpN9s8WaF2j6z1rn5oUwnnkf/HT/Zq8cpnqY4M8P/Wgn9YueknGKGr+eD58dAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T21:44:07.947872Z","bundle_sha256":"bd27ce96fab183376ce89970e6ef12285b122b6bce92e73572e52d80caaa8e66"}}