{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:R36ETNZRAPTWNR5ISHSKHEWYBW","short_pith_number":"pith:R36ETNZR","schema_version":"1.0","canonical_sha256":"8efc49b73103e766c7a891e4a392d80db97e22d57838726ef4183161a93bfbfc","source":{"kind":"arxiv","id":"2305.12197","version":2},"attestation_state":"computed","paper":{"title":"Learning Cuts via Enumeration Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boro Sofranac, Daniel Thuerck, Marc E. Pfetsch, Sebastian Pokutta","submitted_at":"2023-05-20T14:00:37Z","abstract_excerpt":"Cutting-planes are one of the most important building blocks for solving large-scale integer programming (IP) problems to (near) optimality. The majority of cutting plane approaches rely on explicit rules to derive valid inequalities that can separate the target point from the feasible set. Local cuts, on the other hand, seek to directly derive the facets of the underlying polyhedron and use them as cutting planes. However, current approaches rely on solving Linear Programming (LP) problems in order to derive such a hyperplane. In this paper, we present a novel generic approach for learning th"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.12197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-20T14:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"eae05f7f02533df4a5a67aab4ac4006b149d1adc512aeba2d07c2996b6390bdf","abstract_canon_sha256":"d59189c30afc728bfbac0d1f591cb419603e1822894eaa073c9afbd110b91073"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:28.935361Z","signature_b64":"4QozhygiDIRbaecEavTJewy0trgpyMmQgztDa2/N9vnP0HrFMAo2X0PyX1JBXX68tfAQ14ptLGomOHqty5OoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8efc49b73103e766c7a891e4a392d80db97e22d57838726ef4183161a93bfbfc","last_reissued_at":"2026-07-05T07:37:28.934884Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:28.934884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Cuts via Enumeration Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Boro Sofranac, Daniel Thuerck, Marc E. Pfetsch, Sebastian Pokutta","submitted_at":"2023-05-20T14:00:37Z","abstract_excerpt":"Cutting-planes are one of the most important building blocks for solving large-scale integer programming (IP) problems to (near) optimality. The majority of cutting plane approaches rely on explicit rules to derive valid inequalities that can separate the target point from the feasible set. Local cuts, on the other hand, seek to directly derive the facets of the underlying polyhedron and use them as cutting planes. However, current approaches rely on solving Linear Programming (LP) problems in order to derive such a hyperplane. In this paper, we present a novel generic approach for learning th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12197","kind":"arxiv","version":2},"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/2305.12197/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.12197","created_at":"2026-07-05T07:37:28.934942+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.12197v2","created_at":"2026-07-05T07:37:28.934942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12197","created_at":"2026-07-05T07:37:28.934942+00:00"},{"alias_kind":"pith_short_12","alias_value":"R36ETNZRAPTW","created_at":"2026-07-05T07:37:28.934942+00:00"},{"alias_kind":"pith_short_16","alias_value":"R36ETNZRAPTWNR5I","created_at":"2026-07-05T07:37:28.934942+00:00"},{"alias_kind":"pith_short_8","alias_value":"R36ETNZR","created_at":"2026-07-05T07:37:28.934942+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW","json":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW.json","graph_json":"https://pith.science/api/pith-number/R36ETNZRAPTWNR5ISHSKHEWYBW/graph.json","events_json":"https://pith.science/api/pith-number/R36ETNZRAPTWNR5ISHSKHEWYBW/events.json","paper":"https://pith.science/paper/R36ETNZR"},"agent_actions":{"view_html":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW","download_json":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW.json","view_paper":"https://pith.science/paper/R36ETNZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.12197&json=true","fetch_graph":"https://pith.science/api/pith-number/R36ETNZRAPTWNR5ISHSKHEWYBW/graph.json","fetch_events":"https://pith.science/api/pith-number/R36ETNZRAPTWNR5ISHSKHEWYBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW/action/storage_attestation","attest_author":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW/action/author_attestation","sign_citation":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW/action/citation_signature","submit_replication":"https://pith.science/pith/R36ETNZRAPTWNR5ISHSKHEWYBW/action/replication_record"}},"created_at":"2026-07-05T07:37:28.934942+00:00","updated_at":"2026-07-05T07:37:28.934942+00:00"}