{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TERWZVCZNGXHOVOXGUW4KPBA6K","short_pith_number":"pith:TERWZVCZ","schema_version":"1.0","canonical_sha256":"99236cd45969ae7755d7352dc53c20f2ba526006cf0c74338e26e2ed5a9a3a51","source":{"kind":"arxiv","id":"1811.06128","version":2},"attestation_state":"computed","paper":{"title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Antoine Prouvost, Yoshua Bengio","submitted_at":"2018-11-15T00:40:32Z","abstract_excerpt":"This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems, state-of-the-art algorithms rely on handcrafted heuristics for making decisions that are otherwise too expensive to compute or mathematically not well defined. Thus, machine learning looks like a natural candidate to make such decisions in a more principled and optimized way. We advocate for pushing further the integration of machine learning and combinatorial optimizatio"},"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":"1811.06128","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-15T00:40:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8ea6858384d9eb9b8a37297020d75ae6bceb284b93acec6080d94744fac98c9c","abstract_canon_sha256":"9481d29acbc4238da28b1587ae8a3d953cee7b2250a0c52f0ea93c1cd9f16502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:36.694818Z","signature_b64":"SN1AKGIlQVb5rAA/71Bz9Hnhc52pCah2DJrT8uF9AjHaq8YujtaXrbZv3XmK3riUv/aV+ZB+RqLRPgn4ZHhPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99236cd45969ae7755d7352dc53c20f2ba526006cf0c74338e26e2ed5a9a3a51","last_reissued_at":"2026-07-05T00:47:36.694409Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:36.694409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Lodi, Antoine Prouvost, Yoshua Bengio","submitted_at":"2018-11-15T00:40:32Z","abstract_excerpt":"This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems, state-of-the-art algorithms rely on handcrafted heuristics for making decisions that are otherwise too expensive to compute or mathematically not well defined. Thus, machine learning looks like a natural candidate to make such decisions in a more principled and optimized way. We advocate for pushing further the integration of machine learning and combinatorial optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06128","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/1811.06128/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":"1811.06128","created_at":"2026-07-05T00:47:36.694473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06128v2","created_at":"2026-07-05T00:47:36.694473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06128","created_at":"2026-07-05T00:47:36.694473+00:00"},{"alias_kind":"pith_short_12","alias_value":"TERWZVCZNGXH","created_at":"2026-07-05T00:47:36.694473+00:00"},{"alias_kind":"pith_short_16","alias_value":"TERWZVCZNGXHOVOX","created_at":"2026-07-05T00:47:36.694473+00:00"},{"alias_kind":"pith_short_8","alias_value":"TERWZVCZ","created_at":"2026-07-05T00:47:36.694473+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31282","citing_title":"Revisiting the Volume Hypothesis","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30415","citing_title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07562","citing_title":"The Montparnasse Algorithm for RNA Design","ref_index":259,"is_internal_anchor":false},{"citing_arxiv_id":"1907.05912","citing_title":"MIPaaL: Mixed Integer Program as a Layer","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04243","citing_title":"Temporal Reasoning Is Not the Bottleneck: A Probabilistic Inconsistency Framework for Neuro-Symbolic QA","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K","json":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K.json","graph_json":"https://pith.science/api/pith-number/TERWZVCZNGXHOVOXGUW4KPBA6K/graph.json","events_json":"https://pith.science/api/pith-number/TERWZVCZNGXHOVOXGUW4KPBA6K/events.json","paper":"https://pith.science/paper/TERWZVCZ"},"agent_actions":{"view_html":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K","download_json":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K.json","view_paper":"https://pith.science/paper/TERWZVCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06128&json=true","fetch_graph":"https://pith.science/api/pith-number/TERWZVCZNGXHOVOXGUW4KPBA6K/graph.json","fetch_events":"https://pith.science/api/pith-number/TERWZVCZNGXHOVOXGUW4KPBA6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K/action/storage_attestation","attest_author":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K/action/author_attestation","sign_citation":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K/action/citation_signature","submit_replication":"https://pith.science/pith/TERWZVCZNGXHOVOXGUW4KPBA6K/action/replication_record"}},"created_at":"2026-07-05T00:47:36.694473+00:00","updated_at":"2026-07-05T00:47:36.694473+00:00"}