{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:74RPN77SYOFHHIRZ4NAQOHTHQ4","short_pith_number":"pith:74RPN77S","schema_version":"1.0","canonical_sha256":"ff22f6fff2c38a73a239e341071e67871926532eb57de8ae9d34fd05b2ef736e","source":{"kind":"arxiv","id":"2412.14409","version":2},"attestation_state":"computed","paper":{"title":"Multi-task Representation Learning for Mixed Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.AI","authors_text":"Bistra Dilkina, Junyang Cai, Taoan Huang","submitted_at":"2024-12-18T23:33:32Z","abstract_excerpt":"Mixed Integer Linear Programs (MILPs) are highly flexible and powerful tools for modeling and solving complex real-world combinatorial optimization problems. Recently, machine learning (ML)-guided approaches have demonstrated significant potential in improving MILP-solving efficiency. However, these methods typically rely on separate offline data collection and training processes, which limits their scalability and adaptability. This paper introduces the first multi-task learning framework for ML-guided MILP solving. The proposed framework provides MILP embeddings helpful in guiding MILP solvi"},"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":"2412.14409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-12-18T23:33:32Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9c35bceb28007313353d8456284bedf6bcd0c6ce6eaf8065e49883abe8a20d29","abstract_canon_sha256":"54e514ba4ad228868115a088ca507dd5fc31d5aba2aaf125876e05c385f6dcc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:07.174122Z","signature_b64":"aYa0c8hbE5utc8SS4URA7tl2zykmGRTq2E6Xy5cpEyUl7usZgl0ciFFJsaB0OgY9vjpO3qg+RHCiEHsw/ZH0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff22f6fff2c38a73a239e341071e67871926532eb57de8ae9d34fd05b2ef736e","last_reissued_at":"2026-07-05T11:20:07.173686Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:07.173686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-task Representation Learning for Mixed Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.AI","authors_text":"Bistra Dilkina, Junyang Cai, Taoan Huang","submitted_at":"2024-12-18T23:33:32Z","abstract_excerpt":"Mixed Integer Linear Programs (MILPs) are highly flexible and powerful tools for modeling and solving complex real-world combinatorial optimization problems. Recently, machine learning (ML)-guided approaches have demonstrated significant potential in improving MILP-solving efficiency. However, these methods typically rely on separate offline data collection and training processes, which limits their scalability and adaptability. This paper introduces the first multi-task learning framework for ML-guided MILP solving. The proposed framework provides MILP embeddings helpful in guiding MILP solvi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14409","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/2412.14409/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":"2412.14409","created_at":"2026-07-05T11:20:07.173742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14409v2","created_at":"2026-07-05T11:20:07.173742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14409","created_at":"2026-07-05T11:20:07.173742+00:00"},{"alias_kind":"pith_short_12","alias_value":"74RPN77SYOFH","created_at":"2026-07-05T11:20:07.173742+00:00"},{"alias_kind":"pith_short_16","alias_value":"74RPN77SYOFHHIRZ","created_at":"2026-07-05T11:20:07.173742+00:00"},{"alias_kind":"pith_short_8","alias_value":"74RPN77S","created_at":"2026-07-05T11:20:07.173742+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14382","citing_title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4","json":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4.json","graph_json":"https://pith.science/api/pith-number/74RPN77SYOFHHIRZ4NAQOHTHQ4/graph.json","events_json":"https://pith.science/api/pith-number/74RPN77SYOFHHIRZ4NAQOHTHQ4/events.json","paper":"https://pith.science/paper/74RPN77S"},"agent_actions":{"view_html":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4","download_json":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4.json","view_paper":"https://pith.science/paper/74RPN77S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14409&json=true","fetch_graph":"https://pith.science/api/pith-number/74RPN77SYOFHHIRZ4NAQOHTHQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/74RPN77SYOFHHIRZ4NAQOHTHQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/action/storage_attestation","attest_author":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/action/author_attestation","sign_citation":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/action/citation_signature","submit_replication":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/action/replication_record"}},"created_at":"2026-07-05T11:20:07.173742+00:00","updated_at":"2026-07-05T11:20:07.173742+00:00"}