{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7EY3U6VIBIVM5RLJDCFSK5WZ36","short_pith_number":"pith:7EY3U6VI","canonical_record":{"source":{"id":"2606.13133","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T09:55:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"34bf5bd7083bec208557df90563509ce18886118295c39839deee2ffd815da4d","abstract_canon_sha256":"b097de276dca9c923914053a9fa1f89ab5dee7fd512ca20b7e4de80753e12f03"},"schema_version":"1.0"},"canonical_sha256":"f931ba7aa80a2acec569188b2576d9df867a72dc4b1c2a944fb2fcd151f00e89","source":{"kind":"arxiv","id":"2606.13133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13133","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13133v1","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13133","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"7EY3U6VIBIVM","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"pith_short_16","alias_value":"7EY3U6VIBIVM5RLJ","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"pith_short_8","alias_value":"7EY3U6VI","created_at":"2026-06-12T01:09:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7EY3U6VIBIVM5RLJDCFSK5WZ36","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13133","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T09:55:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"34bf5bd7083bec208557df90563509ce18886118295c39839deee2ffd815da4d","abstract_canon_sha256":"b097de276dca9c923914053a9fa1f89ab5dee7fd512ca20b7e4de80753e12f03"},"schema_version":"1.0"},"canonical_sha256":"f931ba7aa80a2acec569188b2576d9df867a72dc4b1c2a944fb2fcd151f00e89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:42.071675Z","signature_b64":"zjUAZ49L4I0Vkb313YpyczHFFBUlIn6/W/q2PHX8cg9CYFC5gXJfkSrlrg0UPEbYTrZnnlk/ngdocAPrf5DWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f931ba7aa80a2acec569188b2576d9df867a72dc4b1c2a944fb2fcd151f00e89","last_reissued_at":"2026-06-12T01:09:42.070844Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:42.070844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13133","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-06-12T01:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDwtYl+FXGKAOPrvEjv192VcR/pDHskxeWdrayazByz5xx7H3eEfRUEauHbEev4jp9bKASTOEId9QvMgIvlKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:33:29.034401Z"},"content_sha256":"0914a8c2de9cb1d80c9dffe715236e1cc5961d81e903b452d48a9031ef2f008b","schema_version":"1.0","event_id":"sha256:0914a8c2de9cb1d80c9dffe715236e1cc5961d81e903b452d48a9031ef2f008b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7EY3U6VIBIVM5RLJDCFSK5WZ36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Evripidis Bampis, Giorgos Mitropoulos, Kaito Baba","submitted_at":"2026-06-11T09:55:33Z","abstract_excerpt":"Recently, Antoniadis et al. (ICLR 2025) proposed a framework for incorporating predictions to approximate NP-hard selection problems. Despite its simplicity, this approach tightly matches theoretical lower bounds, making its generalization highly compelling. We address an open question raised in the work of Antoniadis et al., concerning the extension of this approach to other important problems outside the class of selection problems, such as scheduling. We develop a learning-augmented algorithm for the makespan minimization problem on unrelated machines, denoted by $R\\|C_{\\max}$. By using pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13133","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/2606.13133/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-06-12T01:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vaDmkrNfrOPSoWi1r9bLs+gbhKoyxMZ+3T2I6V94y/xliH48eVQLjHIcjz6bssNdLY3Qqw5kaTZv+1od2Dm1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:33:29.034819Z"},"content_sha256":"021b472047bc7f3126d61c6724cabed576833d4cf97cafb675d4f9be4239f218","schema_version":"1.0","event_id":"sha256:021b472047bc7f3126d61c6724cabed576833d4cf97cafb675d4f9be4239f218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36/bundle.json","state_url":"https://pith.science/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36/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-06-27T12:33:29Z","links":{"resolver":"https://pith.science/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36","bundle":"https://pith.science/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36/bundle.json","state":"https://pith.science/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EY3U6VIBIVM5RLJDCFSK5WZ36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7EY3U6VIBIVM5RLJDCFSK5WZ36","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":"b097de276dca9c923914053a9fa1f89ab5dee7fd512ca20b7e4de80753e12f03","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T09:55:33Z","title_canon_sha256":"34bf5bd7083bec208557df90563509ce18886118295c39839deee2ffd815da4d"},"schema_version":"1.0","source":{"id":"2606.13133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13133","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13133v1","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13133","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"7EY3U6VIBIVM","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"pith_short_16","alias_value":"7EY3U6VIBIVM5RLJ","created_at":"2026-06-12T01:09:42Z"},{"alias_kind":"pith_short_8","alias_value":"7EY3U6VI","created_at":"2026-06-12T01:09:42Z"}],"graph_snapshots":[{"event_id":"sha256:021b472047bc7f3126d61c6724cabed576833d4cf97cafb675d4f9be4239f218","target":"graph","created_at":"2026-06-12T01:09:42Z","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/2606.13133/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, Antoniadis et al. (ICLR 2025) proposed a framework for incorporating predictions to approximate NP-hard selection problems. Despite its simplicity, this approach tightly matches theoretical lower bounds, making its generalization highly compelling. We address an open question raised in the work of Antoniadis et al., concerning the extension of this approach to other important problems outside the class of selection problems, such as scheduling. We develop a learning-augmented algorithm for the makespan minimization problem on unrelated machines, denoted by $R\\|C_{\\max}$. By using pre","authors_text":"Evripidis Bampis, Giorgos Mitropoulos, Kaito Baba","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T09:55:33Z","title":"Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13133","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:0914a8c2de9cb1d80c9dffe715236e1cc5961d81e903b452d48a9031ef2f008b","target":"record","created_at":"2026-06-12T01:09:42Z","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":"b097de276dca9c923914053a9fa1f89ab5dee7fd512ca20b7e4de80753e12f03","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-11T09:55:33Z","title_canon_sha256":"34bf5bd7083bec208557df90563509ce18886118295c39839deee2ffd815da4d"},"schema_version":"1.0","source":{"id":"2606.13133","kind":"arxiv","version":1}},"canonical_sha256":"f931ba7aa80a2acec569188b2576d9df867a72dc4b1c2a944fb2fcd151f00e89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f931ba7aa80a2acec569188b2576d9df867a72dc4b1c2a944fb2fcd151f00e89","first_computed_at":"2026-06-12T01:09:42.070844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:42.070844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zjUAZ49L4I0Vkb313YpyczHFFBUlIn6/W/q2PHX8cg9CYFC5gXJfkSrlrg0UPEbYTrZnnlk/ngdocAPrf5DWDA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:42.071675Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0914a8c2de9cb1d80c9dffe715236e1cc5961d81e903b452d48a9031ef2f008b","sha256:021b472047bc7f3126d61c6724cabed576833d4cf97cafb675d4f9be4239f218"],"state_sha256":"aa998e8f95dae32eaea1af0e526d84c9842ce0d9baab7cb68d4881a8acd40ece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HopHiPYwj8a0qzcvejrPbgrrF11riCUfZHwp6YyUcMGzHj0VSPZMoITTmGeJ3geByENRVUXWSrvy8s1FnHBgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:33:29.038531Z","bundle_sha256":"a28342861ddf97c68992b1d22010df7e6ad4c8bf95a201ea9e7bd647b64ffa5f"}}