{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MXAKYZVBVTL5YE2SX4B3ZDPBRK","short_pith_number":"pith:MXAKYZVB","canonical_record":{"source":{"id":"2412.08206","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-11T08:53:12Z","cross_cats_sorted":[],"title_canon_sha256":"ab0d589b9ced4e4bd7c6ca14793d76aa97b57d0c4822e434d4439b6febe2dea1","abstract_canon_sha256":"2ac3f4bd18a2d247a8c12d273f5a561cb9ca871d36fd857c5bf1113d3a5ae46b"},"schema_version":"1.0"},"canonical_sha256":"65c0ac66a1acd7dc1352bf03bc8de18aaa3ce49d3213947fa3a69a9f15b244e8","source":{"kind":"arxiv","id":"2412.08206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08206","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08206v1","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08206","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"pith_short_12","alias_value":"MXAKYZVBVTL5","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"pith_short_16","alias_value":"MXAKYZVBVTL5YE2S","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"pith_short_8","alias_value":"MXAKYZVB","created_at":"2026-07-05T09:47:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MXAKYZVBVTL5YE2SX4B3ZDPBRK","target":"record","payload":{"canonical_record":{"source":{"id":"2412.08206","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-11T08:53:12Z","cross_cats_sorted":[],"title_canon_sha256":"ab0d589b9ced4e4bd7c6ca14793d76aa97b57d0c4822e434d4439b6febe2dea1","abstract_canon_sha256":"2ac3f4bd18a2d247a8c12d273f5a561cb9ca871d36fd857c5bf1113d3a5ae46b"},"schema_version":"1.0"},"canonical_sha256":"65c0ac66a1acd7dc1352bf03bc8de18aaa3ce49d3213947fa3a69a9f15b244e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:46.052739Z","signature_b64":"pV+P001KccTgWr3hniHWLqE0sbX0iQeYBZ0QdF3VoG1NI2naQZCxaaT6GjFCqqW8gGzCKEvOHe/ASwIuoM2EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65c0ac66a1acd7dc1352bf03bc8de18aaa3ce49d3213947fa3a69a9f15b244e8","last_reissued_at":"2026-07-05T09:47:46.052267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:46.052267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.08206","source_version":1,"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-05T09:47:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sckmcpKDe3o0sZ0dtilLsoPMSgjr0D3rDQk1NjwWwJxGovfShp0r20W2RP0N2vQLCG4Q3lpH97Y3JJc5y7uvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:40:35.338071Z"},"content_sha256":"ec930fbd0393ca8fbccac8ea0da21d0ac42892e44a8221077a0d2acee587174d","schema_version":"1.0","event_id":"sha256:ec930fbd0393ca8fbccac8ea0da21d0ac42892e44a8221077a0d2acee587174d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MXAKYZVBVTL5YE2SX4B3ZDPBRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed-Integer Linear Optimization via Learning-Based Two-Layer Large Neighborhood Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akang Wang, Qingjiang Shi, Wenbo Liu, Wenguo Yang","submitted_at":"2024-12-11T08:53:12Z","abstract_excerpt":"Mixed-integer linear programs (MILPs) are extensively used to model practical problems such as planning and scheduling. A prominent method for solving MILPs is large neighborhood search (LNS), which iteratively seeks improved solutions within specific neighborhoods. Recent advancements have integrated machine learning techniques into LNS to guide the construction of these neighborhoods effectively. However, for large-scale MILPs, the search step in LNS becomes a computational bottleneck, relying on off-the-shelf solvers to optimize auxiliary MILPs of substantial size. To address this challenge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08206","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/2412.08206/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-05T09:47:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3ThpjfM8ZqfFwqGmVX/Hw25nf4+lDr+p078HorWS78B89CFlIY+XVQCtNKPLkc4HypakmtjgsaXEFF27nDzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:40:35.338577Z"},"content_sha256":"aa7b52f07aafb879572ddaee740a8bd3699a836e8ed54f1a15cea7bc3b6ec25d","schema_version":"1.0","event_id":"sha256:aa7b52f07aafb879572ddaee740a8bd3699a836e8ed54f1a15cea7bc3b6ec25d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK/bundle.json","state_url":"https://pith.science/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK/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-13T10:40:35Z","links":{"resolver":"https://pith.science/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK","bundle":"https://pith.science/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK/bundle.json","state":"https://pith.science/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXAKYZVBVTL5YE2SX4B3ZDPBRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MXAKYZVBVTL5YE2SX4B3ZDPBRK","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":"2ac3f4bd18a2d247a8c12d273f5a561cb9ca871d36fd857c5bf1113d3a5ae46b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-11T08:53:12Z","title_canon_sha256":"ab0d589b9ced4e4bd7c6ca14793d76aa97b57d0c4822e434d4439b6febe2dea1"},"schema_version":"1.0","source":{"id":"2412.08206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08206","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08206v1","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08206","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"pith_short_12","alias_value":"MXAKYZVBVTL5","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"pith_short_16","alias_value":"MXAKYZVBVTL5YE2S","created_at":"2026-07-05T09:47:46Z"},{"alias_kind":"pith_short_8","alias_value":"MXAKYZVB","created_at":"2026-07-05T09:47:46Z"}],"graph_snapshots":[{"event_id":"sha256:aa7b52f07aafb879572ddaee740a8bd3699a836e8ed54f1a15cea7bc3b6ec25d","target":"graph","created_at":"2026-07-05T09:47:46Z","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.08206/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Mixed-integer linear programs (MILPs) are extensively used to model practical problems such as planning and scheduling. A prominent method for solving MILPs is large neighborhood search (LNS), which iteratively seeks improved solutions within specific neighborhoods. Recent advancements have integrated machine learning techniques into LNS to guide the construction of these neighborhoods effectively. However, for large-scale MILPs, the search step in LNS becomes a computational bottleneck, relying on off-the-shelf solvers to optimize auxiliary MILPs of substantial size. To address this challenge","authors_text":"Akang Wang, Qingjiang Shi, Wenbo Liu, Wenguo Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-11T08:53:12Z","title":"Mixed-Integer Linear Optimization via Learning-Based Two-Layer Large Neighborhood Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08206","kind":"arxiv","version":1},"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:ec930fbd0393ca8fbccac8ea0da21d0ac42892e44a8221077a0d2acee587174d","target":"record","created_at":"2026-07-05T09:47:46Z","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":"2ac3f4bd18a2d247a8c12d273f5a561cb9ca871d36fd857c5bf1113d3a5ae46b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-11T08:53:12Z","title_canon_sha256":"ab0d589b9ced4e4bd7c6ca14793d76aa97b57d0c4822e434d4439b6febe2dea1"},"schema_version":"1.0","source":{"id":"2412.08206","kind":"arxiv","version":1}},"canonical_sha256":"65c0ac66a1acd7dc1352bf03bc8de18aaa3ce49d3213947fa3a69a9f15b244e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65c0ac66a1acd7dc1352bf03bc8de18aaa3ce49d3213947fa3a69a9f15b244e8","first_computed_at":"2026-07-05T09:47:46.052267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:46.052267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pV+P001KccTgWr3hniHWLqE0sbX0iQeYBZ0QdF3VoG1NI2naQZCxaaT6GjFCqqW8gGzCKEvOHe/ASwIuoM2EBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:46.052739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.08206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec930fbd0393ca8fbccac8ea0da21d0ac42892e44a8221077a0d2acee587174d","sha256:aa7b52f07aafb879572ddaee740a8bd3699a836e8ed54f1a15cea7bc3b6ec25d"],"state_sha256":"98f35b407f34f51b390f8eb790d1814420264e2a26a37a0d7517f442c5ce7ecf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63IBgnJQ10zTEH6GhiA+PkoQWnxZ5rx/QHq/JKIJ7E5bP+mKFKjkxyAFoJ34Fy+HuCJTXpI8Hivi4XjKs2u1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:40:35.343103Z","bundle_sha256":"ce91aad53badd4ecd97f003eefb4e20a51ffdcaddfcf55564f433474aa776d63"}}