{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:S43XJ3NZ7BDH7WP4LBXTNA2ZSE","short_pith_number":"pith:S43XJ3NZ","canonical_record":{"source":{"id":"1011.2187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-09T20:18:56Z","cross_cats_sorted":[],"title_canon_sha256":"352542250b70ef3fdb16bd82099714728bbe808a353dee0494b65ec6c67e1bf0","abstract_canon_sha256":"bcc6aac810560b22eb1dae0dd88c588cdf7caf1b7e30cf26ab9e03cab9946d5e"},"schema_version":"1.0"},"canonical_sha256":"973774edb9f8467fd9fc586f368359912402b188b7d05f651990b405c0ed84af","source":{"kind":"arxiv","id":"1011.2187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2187","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2187v1","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2187","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"S43XJ3NZ7BDH","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S43XJ3NZ7BDH7WP4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S43XJ3NZ","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:S43XJ3NZ7BDH7WP4LBXTNA2ZSE","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-09T20:18:56Z","cross_cats_sorted":[],"title_canon_sha256":"352542250b70ef3fdb16bd82099714728bbe808a353dee0494b65ec6c67e1bf0","abstract_canon_sha256":"bcc6aac810560b22eb1dae0dd88c588cdf7caf1b7e30cf26ab9e03cab9946d5e"},"schema_version":"1.0"},"canonical_sha256":"973774edb9f8467fd9fc586f368359912402b188b7d05f651990b405c0ed84af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:42.409063Z","signature_b64":"vfiOm1VDW/y2fIAnv6GUMNWwdHXx1kd6I8tH2NGryP0I3ow+8zydp1LZZq2BTSdT+RXO/Twub6XhORbZeH8OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973774edb9f8467fd9fc586f368359912402b188b7d05f651990b405c0ed84af","last_reissued_at":"2026-05-18T04:36:42.408623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:42.408623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2187","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-18T04:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9obXiQuL83j31HCqvyaba+FRc86EFt6FuB2DXA73FCH7D2unuy3tafhYlabuYRQ13ACimUt5B+Px9+3dR+PACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:40:32.281486Z"},"content_sha256":"1a278b9cc14d1ab5a8d20a9b79ddcb49ebecf765517ec7ee627aa5f6d03329f5","schema_version":"1.0","event_id":"sha256:1a278b9cc14d1ab5a8d20a9b79ddcb49ebecf765517ec7ee627aa5f6d03329f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:S43XJ3NZ7BDH7WP4LBXTNA2ZSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Scheduling on Identical Machines using SRPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Moseley, Kyle Fox","submitted_at":"2010-11-09T20:18:56Z","abstract_excerpt":"Due to its optimality on a single machine for the problem of minimizing average flow time, Shortest-Remaining-Processing-Time (\\srpt) appears to be the most natural algorithm to consider for the problem of minimizing average flow time on multiple identical machines. It is known that $\\srpt$ achieves the best possible competitive ratio on multiple machines up to a constant factor. Using resource augmentation, $\\srpt$ is known to achieve total flow time at most that of the optimal solution when given machines of speed $2- \\frac{1}{m}$. Further, it is known that $\\srpt$'s competitive ratio improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2187","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":""},"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-18T04:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdVZvviNJRUPBCef1fLxgV5DYoXIDyCOi3g62q82KWSRQ4urNI/gTrE3bELrSkDxfCFjZcY8NZ7kqsbueTOOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:40:32.282166Z"},"content_sha256":"9f2a11143df2cf9159736b4e414f7e2e29d8c0149eae4ecfaa46db5a3c54bbc8","schema_version":"1.0","event_id":"sha256:9f2a11143df2cf9159736b4e414f7e2e29d8c0149eae4ecfaa46db5a3c54bbc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE/bundle.json","state_url":"https://pith.science/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE/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-05-31T16:40:32Z","links":{"resolver":"https://pith.science/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE","bundle":"https://pith.science/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE/bundle.json","state":"https://pith.science/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S43XJ3NZ7BDH7WP4LBXTNA2ZSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S43XJ3NZ7BDH7WP4LBXTNA2ZSE","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":"bcc6aac810560b22eb1dae0dd88c588cdf7caf1b7e30cf26ab9e03cab9946d5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-09T20:18:56Z","title_canon_sha256":"352542250b70ef3fdb16bd82099714728bbe808a353dee0494b65ec6c67e1bf0"},"schema_version":"1.0","source":{"id":"1011.2187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2187","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2187v1","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2187","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"S43XJ3NZ7BDH","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S43XJ3NZ7BDH7WP4","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S43XJ3NZ","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:9f2a11143df2cf9159736b4e414f7e2e29d8c0149eae4ecfaa46db5a3c54bbc8","target":"graph","created_at":"2026-05-18T04:36: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"},"paper":{"abstract_excerpt":"Due to its optimality on a single machine for the problem of minimizing average flow time, Shortest-Remaining-Processing-Time (\\srpt) appears to be the most natural algorithm to consider for the problem of minimizing average flow time on multiple identical machines. It is known that $\\srpt$ achieves the best possible competitive ratio on multiple machines up to a constant factor. Using resource augmentation, $\\srpt$ is known to achieve total flow time at most that of the optimal solution when given machines of speed $2- \\frac{1}{m}$. Further, it is known that $\\srpt$'s competitive ratio improv","authors_text":"Benjamin Moseley, Kyle Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-09T20:18:56Z","title":"Online Scheduling on Identical Machines using SRPT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2187","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:1a278b9cc14d1ab5a8d20a9b79ddcb49ebecf765517ec7ee627aa5f6d03329f5","target":"record","created_at":"2026-05-18T04:36: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":"bcc6aac810560b22eb1dae0dd88c588cdf7caf1b7e30cf26ab9e03cab9946d5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-09T20:18:56Z","title_canon_sha256":"352542250b70ef3fdb16bd82099714728bbe808a353dee0494b65ec6c67e1bf0"},"schema_version":"1.0","source":{"id":"1011.2187","kind":"arxiv","version":1}},"canonical_sha256":"973774edb9f8467fd9fc586f368359912402b188b7d05f651990b405c0ed84af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"973774edb9f8467fd9fc586f368359912402b188b7d05f651990b405c0ed84af","first_computed_at":"2026-05-18T04:36:42.408623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:42.408623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vfiOm1VDW/y2fIAnv6GUMNWwdHXx1kd6I8tH2NGryP0I3ow+8zydp1LZZq2BTSdT+RXO/Twub6XhORbZeH8OCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:42.409063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a278b9cc14d1ab5a8d20a9b79ddcb49ebecf765517ec7ee627aa5f6d03329f5","sha256:9f2a11143df2cf9159736b4e414f7e2e29d8c0149eae4ecfaa46db5a3c54bbc8"],"state_sha256":"d137914567cb67259c0acf49a4a6fd74095c67b495b1df8d9a3f5b39ee8e21c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epwnXvdDPNQ49NXw/0vCHahRyxWpb/C7Quml5r69XF3pwJmwWNDQHlgFj/evqes8FdHl5Lz3HIDNuYxO4OexAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:40:32.285870Z","bundle_sha256":"dfe02a3ff5fd1582ab7e1847ca5dbf0b515b776acfb1f38acbbae6870a257536"}}