{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LR3KILCFSCBC23PJGKJUANZGYR","short_pith_number":"pith:LR3KILCF","schema_version":"1.0","canonical_sha256":"5c76a42c4590822d6de93293403726c45b246c36cabc6d8acd90df86868eca36","source":{"kind":"arxiv","id":"2605.23255","version":1},"attestation_state":"computed","paper":{"title":"Learning-Augmented Online Scheduling with Parsimonious Preemption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Alexander Lindermayr, Mugen Blue, Sungjin Im","submitted_at":"2026-05-22T05:58:52Z","abstract_excerpt":"Learning-augmented algorithms have emerged as a powerful paradigm to surpass traditional worst-case lower bounds by integrating potentially noisy predictions. While this framework has seen success in online scheduling, existing work primarily optimizes job latency while relying on frequent, ``blind'' preemptions. This ignores the fundamental trade-off between algorithmic performance and preemption complexity. We provide the first systematic study of learning-augmented scheduling that curbs preemption while optimizing latency. We establish that the gap between theoretical latency bounds and pre"},"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":"2605.23255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:58:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9c7035fede8803192bd9710882521d7a6875154c556003f91bfbfdd2be56b080","abstract_canon_sha256":"78266a38a7cd3b5cf651e59f2fbfa46e7ee6e2613b2a7c87dd04ad589c36b4a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:45.893678Z","signature_b64":"XLSAmFUaPqg0wHAf450ZVvfen8OlmGO5oDSDrBJ5CUNDbwoD/qF1hvcaRKar6N4rGS9R0kBpSqjOTHl+XUdhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c76a42c4590822d6de93293403726c45b246c36cabc6d8acd90df86868eca36","last_reissued_at":"2026-05-25T02:01:45.893149Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:45.893149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning-Augmented Online Scheduling with Parsimonious Preemption","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Alexander Lindermayr, Mugen Blue, Sungjin Im","submitted_at":"2026-05-22T05:58:52Z","abstract_excerpt":"Learning-augmented algorithms have emerged as a powerful paradigm to surpass traditional worst-case lower bounds by integrating potentially noisy predictions. While this framework has seen success in online scheduling, existing work primarily optimizes job latency while relying on frequent, ``blind'' preemptions. This ignores the fundamental trade-off between algorithmic performance and preemption complexity. We provide the first systematic study of learning-augmented scheduling that curbs preemption while optimizing latency. We establish that the gap between theoretical latency bounds and pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23255","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/2605.23255/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":"2605.23255","created_at":"2026-05-25T02:01:45.893231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23255v1","created_at":"2026-05-25T02:01:45.893231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23255","created_at":"2026-05-25T02:01:45.893231+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR3KILCFSCBC","created_at":"2026-05-25T02:01:45.893231+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR3KILCFSCBC23PJ","created_at":"2026-05-25T02:01:45.893231+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR3KILCF","created_at":"2026-05-25T02:01:45.893231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR","json":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR.json","graph_json":"https://pith.science/api/pith-number/LR3KILCFSCBC23PJGKJUANZGYR/graph.json","events_json":"https://pith.science/api/pith-number/LR3KILCFSCBC23PJGKJUANZGYR/events.json","paper":"https://pith.science/paper/LR3KILCF"},"agent_actions":{"view_html":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR","download_json":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR.json","view_paper":"https://pith.science/paper/LR3KILCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23255&json=true","fetch_graph":"https://pith.science/api/pith-number/LR3KILCFSCBC23PJGKJUANZGYR/graph.json","fetch_events":"https://pith.science/api/pith-number/LR3KILCFSCBC23PJGKJUANZGYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/action/storage_attestation","attest_author":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/action/author_attestation","sign_citation":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/action/citation_signature","submit_replication":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/action/replication_record"}},"created_at":"2026-05-25T02:01:45.893231+00:00","updated_at":"2026-05-25T02:01:45.893231+00:00"}