{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZEYA6OQPTRHCCQ32QL7PRVEECQ","short_pith_number":"pith:ZEYA6OQP","schema_version":"1.0","canonical_sha256":"c9300f3a0f9c4e21437a82fef8d48414043797f77ea91e208812046d31ffca62","source":{"kind":"arxiv","id":"2103.16378","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Constrained Optimization Learning: A Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bryan Wilder, Ferdinando Fioretto, James Kotary, Pascal Van Hentenryck","submitted_at":"2021-03-30T14:19:30Z","abstract_excerpt":"This paper surveys the recent attempts at leveraging machine learning to solve constrained optimization problems. It focuses on surveying the work on integrating combinatorial solvers and optimization methods with machine learning architectures. These approaches hold the promise to develop new hybrid machine learning and optimization methods to predict fast, approximate, solutions to combinatorial problems and to enable structural logical inference. This paper presents a conceptual review of the recent advancements in this emerging area."},"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":"2103.16378","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-30T14:19:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"830c303823bd6f30f87038ba034be1cd6a8bad7043b299463434a074e7a74c63","abstract_canon_sha256":"9699115412620ea39fc9002d450ec0dbb865add8c2a598617586e11ddb526d5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:51.268763Z","signature_b64":"TzThQkF3qurLv4ZfQGmL7s17z9RLhw7LqK0xiJRb/Q7amul9Z/yl+iAmZWc2pCSfQWAq3zT4Xk0lnXwhHSfeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9300f3a0f9c4e21437a82fef8d48414043797f77ea91e208812046d31ffca62","last_reissued_at":"2026-07-05T02:27:51.268245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:51.268245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Constrained Optimization Learning: A Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bryan Wilder, Ferdinando Fioretto, James Kotary, Pascal Van Hentenryck","submitted_at":"2021-03-30T14:19:30Z","abstract_excerpt":"This paper surveys the recent attempts at leveraging machine learning to solve constrained optimization problems. It focuses on surveying the work on integrating combinatorial solvers and optimization methods with machine learning architectures. These approaches hold the promise to develop new hybrid machine learning and optimization methods to predict fast, approximate, solutions to combinatorial problems and to enable structural logical inference. This paper presents a conceptual review of the recent advancements in this emerging area."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.16378","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/2103.16378/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":"2103.16378","created_at":"2026-07-05T02:27:51.268349+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.16378v1","created_at":"2026-07-05T02:27:51.268349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16378","created_at":"2026-07-05T02:27:51.268349+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEYA6OQPTRHC","created_at":"2026-07-05T02:27:51.268349+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEYA6OQPTRHCCQ32","created_at":"2026-07-05T02:27:51.268349+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEYA6OQP","created_at":"2026-07-05T02:27:51.268349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21440","citing_title":"Fusing Backdoors, Machine Learning, and Optimization for Large-Scale Parametric Mixed-Integer Programs","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28340","citing_title":"Decision-focused learning for optimal PV-Battery scheduling","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14019","citing_title":"Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08408","citing_title":"AdamFLIP: Adaptive Momentum Feedback Linearization Optimization for Hard Constrained PINN Training","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ","json":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ.json","graph_json":"https://pith.science/api/pith-number/ZEYA6OQPTRHCCQ32QL7PRVEECQ/graph.json","events_json":"https://pith.science/api/pith-number/ZEYA6OQPTRHCCQ32QL7PRVEECQ/events.json","paper":"https://pith.science/paper/ZEYA6OQP"},"agent_actions":{"view_html":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ","download_json":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ.json","view_paper":"https://pith.science/paper/ZEYA6OQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.16378&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEYA6OQPTRHCCQ32QL7PRVEECQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEYA6OQPTRHCCQ32QL7PRVEECQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZEYA6OQPTRHCCQ32QL7PRVEECQ/action/replication_record"}},"created_at":"2026-07-05T02:27:51.268349+00:00","updated_at":"2026-07-05T02:27:51.268349+00:00"}