{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RXTAPIQVYR6ZVS4PECDTHRGDEP","short_pith_number":"pith:RXTAPIQV","canonical_record":{"source":{"id":"2504.10743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T22:30:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ed3cafa59e6b4e7f287851b1c6d88c936dbadc27171a8a69dbe400719b6e1b7b","abstract_canon_sha256":"fcf3e742bcfa2bbb5ab26edc80f557ed59ca7d48eaaff5bc02dbd92cc754fee5"},"schema_version":"1.0"},"canonical_sha256":"8de607a215c47d9acb8f208733c4c323c1a0d5b7e7cf495a1bfcfa6ed465b199","source":{"kind":"arxiv","id":"2504.10743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.10743","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.10743v1","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10743","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"RXTAPIQVYR6Z","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"pith_short_16","alias_value":"RXTAPIQVYR6ZVS4P","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"pith_short_8","alias_value":"RXTAPIQV","created_at":"2026-07-05T10:49:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RXTAPIQVYR6ZVS4PECDTHRGDEP","target":"record","payload":{"canonical_record":{"source":{"id":"2504.10743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T22:30:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ed3cafa59e6b4e7f287851b1c6d88c936dbadc27171a8a69dbe400719b6e1b7b","abstract_canon_sha256":"fcf3e742bcfa2bbb5ab26edc80f557ed59ca7d48eaaff5bc02dbd92cc754fee5"},"schema_version":"1.0"},"canonical_sha256":"8de607a215c47d9acb8f208733c4c323c1a0d5b7e7cf495a1bfcfa6ed465b199","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:23.508624Z","signature_b64":"Pz8mUgyREzVoFYZv/HP42BWhii8fD2CGGd5IDVadhuifQk4XPQu/acWE09QK1H4l3oosPcw0DoN+9qJ9EIbVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de607a215c47d9acb8f208733c4c323c1a0d5b7e7cf495a1bfcfa6ed465b199","last_reissued_at":"2026-07-05T10:49:23.508130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:23.508130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.10743","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-05T10:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHQI72gQKBlyrXlnYMl++VdVmHitXo2jSLRxmQHSJNR3+uaVvWI2Y9q86ShnqDfynr9GErYOOX3DQKLuJic2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:50:50.054862Z"},"content_sha256":"83ceee9dfbec27f14775698cd98dc452c6bdda6c79b89c8d7afad83dfc93d2d4","schema_version":"1.0","event_id":"sha256:83ceee9dfbec27f14775698cd98dc452c6bdda6c79b89c8d7afad83dfc93d2d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RXTAPIQVYR6ZVS4PECDTHRGDEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Gittins for Stochastic Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Benjamin Moseley, Heather Newman, Kirk Pruhs, Rudy Zhou","submitted_at":"2025-04-14T22:30:23Z","abstract_excerpt":"A common theme in stochastic optimization problems is that, theoretically, stochastic algorithms need to \"know\" relatively rich information about the underlying distributions. This is at odds with most applications, where distributions are rough predictions based on historical data. Thus, commonly, stochastic algorithms are making decisions using imperfect predicted distributions, while trying to optimize over some unknown true distributions. We consider the fundamental problem of scheduling stochastic jobs preemptively on a single machine to minimize expected mean completion time in the setti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10743","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/2504.10743/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-05T10:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ErxRImSf1uhHceH5DHEuR0DtHohuXtiQoFyY0GNCLvzX/uRShmaD/yII+7wyEye7Y9PMwUSa5baUjEodcTHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:50:50.055849Z"},"content_sha256":"0de5849af249e116c550619598d7b657c7da2602aa7241323f17aca6d60dd121","schema_version":"1.0","event_id":"sha256:0de5849af249e116c550619598d7b657c7da2602aa7241323f17aca6d60dd121"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP/bundle.json","state_url":"https://pith.science/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP/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-07T22:50:50Z","links":{"resolver":"https://pith.science/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP","bundle":"https://pith.science/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP/bundle.json","state":"https://pith.science/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXTAPIQVYR6ZVS4PECDTHRGDEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RXTAPIQVYR6ZVS4PECDTHRGDEP","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":"fcf3e742bcfa2bbb5ab26edc80f557ed59ca7d48eaaff5bc02dbd92cc754fee5","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T22:30:23Z","title_canon_sha256":"ed3cafa59e6b4e7f287851b1c6d88c936dbadc27171a8a69dbe400719b6e1b7b"},"schema_version":"1.0","source":{"id":"2504.10743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.10743","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.10743v1","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10743","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"RXTAPIQVYR6Z","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"pith_short_16","alias_value":"RXTAPIQVYR6ZVS4P","created_at":"2026-07-05T10:49:23Z"},{"alias_kind":"pith_short_8","alias_value":"RXTAPIQV","created_at":"2026-07-05T10:49:23Z"}],"graph_snapshots":[{"event_id":"sha256:0de5849af249e116c550619598d7b657c7da2602aa7241323f17aca6d60dd121","target":"graph","created_at":"2026-07-05T10:49:23Z","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/2504.10743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A common theme in stochastic optimization problems is that, theoretically, stochastic algorithms need to \"know\" relatively rich information about the underlying distributions. This is at odds with most applications, where distributions are rough predictions based on historical data. Thus, commonly, stochastic algorithms are making decisions using imperfect predicted distributions, while trying to optimize over some unknown true distributions. We consider the fundamental problem of scheduling stochastic jobs preemptively on a single machine to minimize expected mean completion time in the setti","authors_text":"Benjamin Moseley, Heather Newman, Kirk Pruhs, Rudy Zhou","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T22:30:23Z","title":"Robust Gittins for Stochastic Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10743","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:83ceee9dfbec27f14775698cd98dc452c6bdda6c79b89c8d7afad83dfc93d2d4","target":"record","created_at":"2026-07-05T10:49:23Z","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":"fcf3e742bcfa2bbb5ab26edc80f557ed59ca7d48eaaff5bc02dbd92cc754fee5","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T22:30:23Z","title_canon_sha256":"ed3cafa59e6b4e7f287851b1c6d88c936dbadc27171a8a69dbe400719b6e1b7b"},"schema_version":"1.0","source":{"id":"2504.10743","kind":"arxiv","version":1}},"canonical_sha256":"8de607a215c47d9acb8f208733c4c323c1a0d5b7e7cf495a1bfcfa6ed465b199","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8de607a215c47d9acb8f208733c4c323c1a0d5b7e7cf495a1bfcfa6ed465b199","first_computed_at":"2026-07-05T10:49:23.508130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:23.508130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pz8mUgyREzVoFYZv/HP42BWhii8fD2CGGd5IDVadhuifQk4XPQu/acWE09QK1H4l3oosPcw0DoN+9qJ9EIbVDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:23.508624Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.10743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83ceee9dfbec27f14775698cd98dc452c6bdda6c79b89c8d7afad83dfc93d2d4","sha256:0de5849af249e116c550619598d7b657c7da2602aa7241323f17aca6d60dd121"],"state_sha256":"dc54f8aaf71c4630c859cfc806d361a9eab1d983c960b49ae940d476e497d103"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlAKdrrZul8Snm1r+hFrFffkLIH+m9WpHD02IsRG7onZtADBDrDyFCI3B2xqMdRW48lpTLLjY3HhBnT0hzwrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:50:50.061747Z","bundle_sha256":"7ea825c5b88f4e7c243b8bef1dde0a14aa689568f829c9011a7729ddadf1b9b8"}}