{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LR3KILCFSCBC23PJGKJUANZGYR","short_pith_number":"pith:LR3KILCF","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"},"canonical_sha256":"5c76a42c4590822d6de93293403726c45b246c36cabc6d8acd90df86868eca36","source":{"kind":"arxiv","id":"2605.23255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23255","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23255v1","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23255","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"LR3KILCFSCBC","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"LR3KILCFSCBC23PJ","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"LR3KILCF","created_at":"2026-05-25T02:01:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LR3KILCFSCBC23PJGKJUANZGYR","target":"record","payload":{"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"},"canonical_sha256":"5c76a42c4590822d6de93293403726c45b246c36cabc6d8acd90df86868eca36","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"},"source_kind":"arxiv","source_id":"2605.23255","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-05-25T02:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBJrVkTNjNguBp9OUpj2P1la2+TnKkBw8yaV4h8OyA38gaMFg8jkr1/3KTb3nHxeHmq6OBkXZZBiEDiIvvPlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:46:06.095263Z"},"content_sha256":"739fcc3e76df91a01daf19b337d4e30c37bbe24404a6322705b3124fcf2af060","schema_version":"1.0","event_id":"sha256:739fcc3e76df91a01daf19b337d4e30c37bbe24404a6322705b3124fcf2af060"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LR3KILCFSCBC23PJGKJUANZGYR","target":"graph","payload":{"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"},"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-05-25T02:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykYAlo3/rJy405/wW/OSVqohxu9iOOZw9IcUb0ejl5ma2H6L0d9tCpMhkRpWbVLOioCPQ1vbMYqpqDI9HeKJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:46:06.096140Z"},"content_sha256":"9bc50227307d0e21dedd9c8675fb5a649b2c125dfec81e86282f633e364e4ec7","schema_version":"1.0","event_id":"sha256:9bc50227307d0e21dedd9c8675fb5a649b2c125dfec81e86282f633e364e4ec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/bundle.json","state_url":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR3KILCFSCBC23PJGKJUANZGYR/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-10T02:46:06Z","links":{"resolver":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR","bundle":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/bundle.json","state":"https://pith.science/pith/LR3KILCFSCBC23PJGKJUANZGYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR3KILCFSCBC23PJGKJUANZGYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LR3KILCFSCBC23PJGKJUANZGYR","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":"78266a38a7cd3b5cf651e59f2fbfa46e7ee6e2613b2a7c87dd04ad589c36b4a6","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:58:52Z","title_canon_sha256":"9c7035fede8803192bd9710882521d7a6875154c556003f91bfbfdd2be56b080"},"schema_version":"1.0","source":{"id":"2605.23255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23255","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23255v1","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23255","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"LR3KILCFSCBC","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"LR3KILCFSCBC23PJ","created_at":"2026-05-25T02:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"LR3KILCF","created_at":"2026-05-25T02:01:45Z"}],"graph_snapshots":[{"event_id":"sha256:9bc50227307d0e21dedd9c8675fb5a649b2c125dfec81e86282f633e364e4ec7","target":"graph","created_at":"2026-05-25T02:01:45Z","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/2605.23255/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Lindermayr, Mugen Blue, Sungjin Im","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:58:52Z","title":"Learning-Augmented Online Scheduling with Parsimonious Preemption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23255","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:739fcc3e76df91a01daf19b337d4e30c37bbe24404a6322705b3124fcf2af060","target":"record","created_at":"2026-05-25T02:01:45Z","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":"78266a38a7cd3b5cf651e59f2fbfa46e7ee6e2613b2a7c87dd04ad589c36b4a6","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T05:58:52Z","title_canon_sha256":"9c7035fede8803192bd9710882521d7a6875154c556003f91bfbfdd2be56b080"},"schema_version":"1.0","source":{"id":"2605.23255","kind":"arxiv","version":1}},"canonical_sha256":"5c76a42c4590822d6de93293403726c45b246c36cabc6d8acd90df86868eca36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c76a42c4590822d6de93293403726c45b246c36cabc6d8acd90df86868eca36","first_computed_at":"2026-05-25T02:01:45.893149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:45.893149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XLSAmFUaPqg0wHAf450ZVvfen8OlmGO5oDSDrBJ5CUNDbwoD/qF1hvcaRKar6N4rGS9R0kBpSqjOTHl+XUdhDA==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:45.893678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:739fcc3e76df91a01daf19b337d4e30c37bbe24404a6322705b3124fcf2af060","sha256:9bc50227307d0e21dedd9c8675fb5a649b2c125dfec81e86282f633e364e4ec7"],"state_sha256":"48d6489e70d8f8ed91adccf5c067e5652a57913f1e0014b98b6e5bccd6722eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3O83UgCzZL3JCi5WkMv12atCqhM4Bd1KeNz3E//vNhDuisBMj21VkQwqdOe6I1ZILAH7YtS3Q6y4laNV6tEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:46:06.100799Z","bundle_sha256":"22fe47c9451384dad8ebd713e2263eef8a8767465de1c642c73ea3dcc1fab2e4"}}