{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:74RPN77SYOFHHIRZ4NAQOHTHQ4","short_pith_number":"pith:74RPN77S","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"},"canonical_sha256":"ff22f6fff2c38a73a239e341071e67871926532eb57de8ae9d34fd05b2ef736e","source":{"kind":"arxiv","id":"2412.14409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14409","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14409v2","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14409","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"74RPN77SYOFH","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"pith_short_16","alias_value":"74RPN77SYOFHHIRZ","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"pith_short_8","alias_value":"74RPN77S","created_at":"2026-07-05T11:20:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:74RPN77SYOFHHIRZ4NAQOHTHQ4","target":"record","payload":{"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"},"canonical_sha256":"ff22f6fff2c38a73a239e341071e67871926532eb57de8ae9d34fd05b2ef736e","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"},"source_kind":"arxiv","source_id":"2412.14409","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crbdysr1Sr81hV3v2HV+dQMKrihCfk9AF0kTB49A4NLtWA0lQNT/hQ2f3CPPdJ0Gekgqnmy7fDgi1iuXSKi9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T20:14:35.279623Z"},"content_sha256":"5d7591c4c64a8e15c0707d23c3234c90906e3bb4810e5dde7dce1b51226e0132","schema_version":"1.0","event_id":"sha256:5d7591c4c64a8e15c0707d23c3234c90906e3bb4810e5dde7dce1b51226e0132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:74RPN77SYOFHHIRZ4NAQOHTHQ4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8dViGP4dJfjwy1xb7PDSJ4XFZt/dzFJ6qUFPajqT15nSisM8/ELD8qCq+8NhfUSC1QZEH7iQJ04rZL+gDvOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T20:14:35.280159Z"},"content_sha256":"a41252d1aef392db5280426770c0854250425456b864dd03c2b6631408035ea0","schema_version":"1.0","event_id":"sha256:a41252d1aef392db5280426770c0854250425456b864dd03c2b6631408035ea0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/bundle.json","state_url":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T20:14:35Z","links":{"resolver":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4","bundle":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/bundle.json","state":"https://pith.science/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74RPN77SYOFHHIRZ4NAQOHTHQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:74RPN77SYOFHHIRZ4NAQOHTHQ4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"54e514ba4ad228868115a088ca507dd5fc31d5aba2aaf125876e05c385f6dcc2","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-12-18T23:33:32Z","title_canon_sha256":"9c35bceb28007313353d8456284bedf6bcd0c6ce6eaf8065e49883abe8a20d29"},"schema_version":"1.0","source":{"id":"2412.14409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.14409","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"2412.14409v2","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14409","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"74RPN77SYOFH","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"pith_short_16","alias_value":"74RPN77SYOFHHIRZ","created_at":"2026-07-05T11:20:07Z"},{"alias_kind":"pith_short_8","alias_value":"74RPN77S","created_at":"2026-07-05T11:20:07Z"}],"graph_snapshots":[{"event_id":"sha256:a41252d1aef392db5280426770c0854250425456b864dd03c2b6631408035ea0","target":"graph","created_at":"2026-07-05T11:20:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.14409/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bistra Dilkina, Junyang Cai, Taoan Huang","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-12-18T23:33:32Z","title":"Multi-task Representation Learning for Mixed Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14409","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5d7591c4c64a8e15c0707d23c3234c90906e3bb4810e5dde7dce1b51226e0132","target":"record","created_at":"2026-07-05T11:20:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"54e514ba4ad228868115a088ca507dd5fc31d5aba2aaf125876e05c385f6dcc2","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-12-18T23:33:32Z","title_canon_sha256":"9c35bceb28007313353d8456284bedf6bcd0c6ce6eaf8065e49883abe8a20d29"},"schema_version":"1.0","source":{"id":"2412.14409","kind":"arxiv","version":2}},"canonical_sha256":"ff22f6fff2c38a73a239e341071e67871926532eb57de8ae9d34fd05b2ef736e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff22f6fff2c38a73a239e341071e67871926532eb57de8ae9d34fd05b2ef736e","first_computed_at":"2026-07-05T11:20:07.173686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:07.173686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aYa0c8hbE5utc8SS4URA7tl2zykmGRTq2E6Xy5cpEyUl7usZgl0ciFFJsaB0OgY9vjpO3qg+RHCiEHsw/ZH0Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:07.174122Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.14409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d7591c4c64a8e15c0707d23c3234c90906e3bb4810e5dde7dce1b51226e0132","sha256:a41252d1aef392db5280426770c0854250425456b864dd03c2b6631408035ea0"],"state_sha256":"de5b903cb1657c83fb3fbb8cb369f634590bb269498bb0d62208ad203cd1bec6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwjKMlVDpBfoYDo6QNEq3L0dROHyMmgUleVO2PJDW5Rzhgj7oBr895wUWarsWj5QFcXIXQ5XXCuphE14SjBXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T20:14:35.286318Z","bundle_sha256":"1e63ef3d914d90b1020ef68692661b2afdf430146adb73db7fbd34c4e1ccc102"}}