{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OO4PCNSUJR2M7T4GHC5IUBECBR","short_pith_number":"pith:OO4PCNSU","canonical_record":{"source":{"id":"1712.00790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-03T16:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"69e6f1a977b7d1a570f8d9831fdf510922dc59b087926ee7877929aae7ea614c","abstract_canon_sha256":"927251731751bc56d25eb441a06c376b2042b7d2109a2eba82e239ac4d2fd431"},"schema_version":"1.0"},"canonical_sha256":"73b8f136544c74cfcf8638ba8a04820c654abe7ea7a2782b16988803cf4d8bf1","source":{"kind":"arxiv","id":"1712.00790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00790","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00790v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00790","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"OO4PCNSUJR2M","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OO4PCNSUJR2M7T4G","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OO4PCNSU","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OO4PCNSUJR2M7T4GHC5IUBECBR","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-03T16:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"69e6f1a977b7d1a570f8d9831fdf510922dc59b087926ee7877929aae7ea614c","abstract_canon_sha256":"927251731751bc56d25eb441a06c376b2042b7d2109a2eba82e239ac4d2fd431"},"schema_version":"1.0"},"canonical_sha256":"73b8f136544c74cfcf8638ba8a04820c654abe7ea7a2782b16988803cf4d8bf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:08.082805Z","signature_b64":"bUfTQikMOWoEiq/qQhGxbuOXnwnen13wNR0b8GDBygswBknSWxSbnN4F0T3ywHKBzWSN7xPlMiZEyF4KVPq+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73b8f136544c74cfcf8638ba8a04820c654abe7ea7a2782b16988803cf4d8bf1","last_reissued_at":"2026-05-18T00:23:08.082113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:08.082113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00790","source_version":2,"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-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSzf1iwNXob6xkbSHU5/lEaOgVkMUUAP2P2lwVTbKDAlMfX2/fg4QRaVPnWA4uYEKx3OSVlnRBWbCPXuenLSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:45:36.196070Z"},"content_sha256":"a12d82c946f9cd192dd7a552b5bfde8783e6e4ef46b776d62bb07d56cc7a56b2","schema_version":"1.0","event_id":"sha256:a12d82c946f9cd192dd7a552b5bfde8783e6e4ef46b776d62bb07d56cc7a56b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OO4PCNSUJR2M7T4GHC5IUBECBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SOAP: One Clean Analysis of All Age-Based Scheduling Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Alan Scheller-Wolf, Mor Harchol-Balter, Ziv Scully","submitted_at":"2017-12-03T16:14:29Z","abstract_excerpt":"We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in the literature as well as an infinite number of variants which have never been analyzed, or maybe not even conceived. SOAP policies range from classic policies, like first-come, first-serve (FCFS), foreground-background (FB), class-based priority, and shortest remaining processing time (SRPT); to much more complicated scheduling rules, such as the famously complex Gittins index policy and other policies in which a job"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00790","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhJZKeoMfEBY9dsY+SG30b05tZ7c9BG2OC8VueF+UemUB9V9nGx02uk3X1smc4nBQF+r6HPBDdTkxkYHV1VbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:45:36.196423Z"},"content_sha256":"da76167b83735c172ae277824b28810f2ad2024951db4343681ad6251ad5d6f4","schema_version":"1.0","event_id":"sha256:da76167b83735c172ae277824b28810f2ad2024951db4343681ad6251ad5d6f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OO4PCNSUJR2M7T4GHC5IUBECBR/bundle.json","state_url":"https://pith.science/pith/OO4PCNSUJR2M7T4GHC5IUBECBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OO4PCNSUJR2M7T4GHC5IUBECBR/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-05T15:45:36Z","links":{"resolver":"https://pith.science/pith/OO4PCNSUJR2M7T4GHC5IUBECBR","bundle":"https://pith.science/pith/OO4PCNSUJR2M7T4GHC5IUBECBR/bundle.json","state":"https://pith.science/pith/OO4PCNSUJR2M7T4GHC5IUBECBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OO4PCNSUJR2M7T4GHC5IUBECBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OO4PCNSUJR2M7T4GHC5IUBECBR","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":"927251731751bc56d25eb441a06c376b2042b7d2109a2eba82e239ac4d2fd431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-03T16:14:29Z","title_canon_sha256":"69e6f1a977b7d1a570f8d9831fdf510922dc59b087926ee7877929aae7ea614c"},"schema_version":"1.0","source":{"id":"1712.00790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00790","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00790v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00790","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"OO4PCNSUJR2M","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OO4PCNSUJR2M7T4G","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OO4PCNSU","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:da76167b83735c172ae277824b28810f2ad2024951db4343681ad6251ad5d6f4","target":"graph","created_at":"2026-05-18T00:23:08Z","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"},"paper":{"abstract_excerpt":"We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in the literature as well as an infinite number of variants which have never been analyzed, or maybe not even conceived. SOAP policies range from classic policies, like first-come, first-serve (FCFS), foreground-background (FB), class-based priority, and shortest remaining processing time (SRPT); to much more complicated scheduling rules, such as the famously complex Gittins index policy and other policies in which a job","authors_text":"Alan Scheller-Wolf, Mor Harchol-Balter, Ziv Scully","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-03T16:14:29Z","title":"SOAP: One Clean Analysis of All Age-Based Scheduling Policies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00790","kind":"arxiv","version":2},"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:a12d82c946f9cd192dd7a552b5bfde8783e6e4ef46b776d62bb07d56cc7a56b2","target":"record","created_at":"2026-05-18T00:23:08Z","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":"927251731751bc56d25eb441a06c376b2042b7d2109a2eba82e239ac4d2fd431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-12-03T16:14:29Z","title_canon_sha256":"69e6f1a977b7d1a570f8d9831fdf510922dc59b087926ee7877929aae7ea614c"},"schema_version":"1.0","source":{"id":"1712.00790","kind":"arxiv","version":2}},"canonical_sha256":"73b8f136544c74cfcf8638ba8a04820c654abe7ea7a2782b16988803cf4d8bf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73b8f136544c74cfcf8638ba8a04820c654abe7ea7a2782b16988803cf4d8bf1","first_computed_at":"2026-05-18T00:23:08.082113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:08.082113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bUfTQikMOWoEiq/qQhGxbuOXnwnen13wNR0b8GDBygswBknSWxSbnN4F0T3ywHKBzWSN7xPlMiZEyF4KVPq+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:08.082805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a12d82c946f9cd192dd7a552b5bfde8783e6e4ef46b776d62bb07d56cc7a56b2","sha256:da76167b83735c172ae277824b28810f2ad2024951db4343681ad6251ad5d6f4"],"state_sha256":"b5ddadb69ac43812abfaf3dbfa9044dac048458da0ce0cc38e0be24c7b3bc169"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NzmK0F6jJv82E3clnP5GV5efVpXjNZTdyGzSzAwIvNgXwF0BJOwR9bc8uU8Xt/LztF2L8+Jx2XRm7hvjUwnKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:45:36.198403Z","bundle_sha256":"5cba9337d9e5449333ed59e207be1c7337df2fdb7acd5e608acb19a163d88a8a"}}