{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GF6BAG3HODRLRSU4ORKL2ATLSH","short_pith_number":"pith:GF6BAG3H","schema_version":"1.0","canonical_sha256":"317c101b6770e2b8ca9c7454bd026b91f7a5347ab6f601e717e8d951dc59f8e7","source":{"kind":"arxiv","id":"2608.13079","version":1},"attestation_state":"computed","paper":{"title":"Learning Discrete Decisions for MIPs with Constraint-Aware Diffusion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Deepjyoti Deka, Ferdinando Fioretto, Kaarthik Sundar, Mehdi Taghizadeh, Vincenzo Di Vito","submitted_at":"2026-08-13T10:46:18Z","abstract_excerpt":"This paper proposes a novel learning-based approach to approximately solve instances of mixed-integer optimization problems. These problems are computationally challenging, as they require jointly determining discrete and continuous decisions while satisfying complex combinatorial constraints. The proposed method relies on a graph-based generative diffusion model that learns the discrete component of mixed-integer optimization problems while integrating a training-free feasibility projection operator directly into the reverse diffusion process to steer intermediate samples toward the feasible "},"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":"2608.13079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-13T10:46:18Z","cross_cats_sorted":[],"title_canon_sha256":"38c442184ba4e8d6a796dc357e9e0a3cd94370ae1469d1976ca2adf3f5688ad8","abstract_canon_sha256":"2ac0d18af62e906223648683cefbce2c5dc611a3060840ea15af8879d6c4fb2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T01:00:17.429498Z","signature_b64":"ZnWg0KwTyjYnIbg9G2XIHn4IuPzVJIP495wlhRDd8aG9H8Tqb7jgAAw/LcNFh+1YkQmUEpTvH5M7Q9NRTNocBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"317c101b6770e2b8ca9c7454bd026b91f7a5347ab6f601e717e8d951dc59f8e7","last_reissued_at":"2026-08-14T01:00:17.427512Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T01:00:17.427512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Discrete Decisions for MIPs with Constraint-Aware Diffusion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Deepjyoti Deka, Ferdinando Fioretto, Kaarthik Sundar, Mehdi Taghizadeh, Vincenzo Di Vito","submitted_at":"2026-08-13T10:46:18Z","abstract_excerpt":"This paper proposes a novel learning-based approach to approximately solve instances of mixed-integer optimization problems. These problems are computationally challenging, as they require jointly determining discrete and continuous decisions while satisfying complex combinatorial constraints. The proposed method relies on a graph-based generative diffusion model that learns the discrete component of mixed-integer optimization problems while integrating a training-free feasibility projection operator directly into the reverse diffusion process to steer intermediate samples toward the feasible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13079","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/2608.13079/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":"2608.13079","created_at":"2026-08-14T01:00:17.428486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.13079v1","created_at":"2026-08-14T01:00:17.428486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13079","created_at":"2026-08-14T01:00:17.428486+00:00"},{"alias_kind":"pith_short_12","alias_value":"GF6BAG3HODRL","created_at":"2026-08-14T01:00:17.428486+00:00"},{"alias_kind":"pith_short_16","alias_value":"GF6BAG3HODRLRSU4","created_at":"2026-08-14T01:00:17.428486+00:00"},{"alias_kind":"pith_short_8","alias_value":"GF6BAG3H","created_at":"2026-08-14T01:00:17.428486+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/GF6BAG3HODRLRSU4ORKL2ATLSH","json":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH.json","graph_json":"https://pith.science/api/pith-number/GF6BAG3HODRLRSU4ORKL2ATLSH/graph.json","events_json":"https://pith.science/api/pith-number/GF6BAG3HODRLRSU4ORKL2ATLSH/events.json","paper":"https://pith.science/paper/GF6BAG3H"},"agent_actions":{"view_html":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH","download_json":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH.json","view_paper":"https://pith.science/paper/GF6BAG3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.13079&json=true","fetch_graph":"https://pith.science/api/pith-number/GF6BAG3HODRLRSU4ORKL2ATLSH/graph.json","fetch_events":"https://pith.science/api/pith-number/GF6BAG3HODRLRSU4ORKL2ATLSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH/action/storage_attestation","attest_author":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH/action/author_attestation","sign_citation":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH/action/citation_signature","submit_replication":"https://pith.science/pith/GF6BAG3HODRLRSU4ORKL2ATLSH/action/replication_record"}},"created_at":"2026-08-14T01:00:17.428486+00:00","updated_at":"2026-08-14T01:00:17.428486+00:00"}