{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2EZ55QBB3Q4YZOO3HU7PGVUJAM","short_pith_number":"pith:2EZ55QBB","canonical_record":{"source":{"id":"1203.5040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-03-22T16:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"3ba9b1dcc065d8b7800d9c3d3c05d461c7bfe38cb14fa1000ba104ec2d549efc","abstract_canon_sha256":"f62ab3f3aa549309e933bd0620f8c37bb0854a27f25d7f31dc3ac9e9ce126fef"},"schema_version":"1.0"},"canonical_sha256":"d133dec021dc398cb9db3d3ef356890316aee28a2c7ca9d737d1d4410caae141","source":{"kind":"arxiv","id":"1203.5040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5040","created_at":"2026-05-18T03:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5040v1","created_at":"2026-05-18T03:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5040","created_at":"2026-05-18T03:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"2EZ55QBB3Q4Y","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2EZ55QBB3Q4YZOO3","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2EZ55QBB","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2EZ55QBB3Q4YZOO3HU7PGVUJAM","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-03-22T16:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"3ba9b1dcc065d8b7800d9c3d3c05d461c7bfe38cb14fa1000ba104ec2d549efc","abstract_canon_sha256":"f62ab3f3aa549309e933bd0620f8c37bb0854a27f25d7f31dc3ac9e9ce126fef"},"schema_version":"1.0"},"canonical_sha256":"d133dec021dc398cb9db3d3ef356890316aee28a2c7ca9d737d1d4410caae141","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:28.075660Z","signature_b64":"nnaDw56aBoZBVh9Xic8miAJJnsbIQ/BWIfu43pom/ChkxwP3cNGGYIMEsv/EotoL3gfmFI5+zgfiAVxT6qrMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d133dec021dc398cb9db3d3ef356890316aee28a2c7ca9d737d1d4410caae141","last_reissued_at":"2026-05-18T03:59:28.074869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:28.074869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5040","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-18T03:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2ID1glOk7QJhvPcJB1BkgRK/CwBRul66hSWFFXuQdxOZ5zoPk8uHot1ORVt6ehcflVEd6GF1JTWXJH/0pRcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:57:08.952154Z"},"content_sha256":"3370a08ea0a180ac8773bdd676ee2b293506bcac1177032a6f14367db05107f4","schema_version":"1.0","event_id":"sha256:3370a08ea0a180ac8773bdd676ee2b293506bcac1177032a6f14367db05107f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2EZ55QBB3Q4YZOO3HU7PGVUJAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Slowdown in Heterogeneous Size-Aware Dispatching Systems (full version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Aleksi Penttinen, Esa Hyyti\\\"a, Samuli Aalto","submitted_at":"2012-03-22T16:51:55Z","abstract_excerpt":"We consider a system of parallel queues where tasks are assigned (dispatched) to one of the available servers upon arrival. The dispatching decision is based on the full state information, i.e., on the sizes of the new and existing jobs. We are interested in minimizing the so-called mean slowdown criterion corresponding to the mean of the sojourn time divided by the processing time. Assuming no new jobs arrive, the shortest-processing-time-product (SPTP) schedule is known to minimize the slowdown of the existing jobs. The main contribution of this paper is three-fold: 1) To show the optimality"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5040","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-18T03:59:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mF+oczGiDGHA9CI2EKTFrMw/LD8aPTCSvKNAVcdsS6Pbfbf2TLgmvQ1l/KP3VvDIPwwxealHODrL2djsEoQiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:57:08.952870Z"},"content_sha256":"2538eac2e39f622bd9430ffb69c0f9240de4ac1f6a25661fef5d3a6e38b0a919","schema_version":"1.0","event_id":"sha256:2538eac2e39f622bd9430ffb69c0f9240de4ac1f6a25661fef5d3a6e38b0a919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM/bundle.json","state_url":"https://pith.science/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM/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-01T03:57:08Z","links":{"resolver":"https://pith.science/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM","bundle":"https://pith.science/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM/bundle.json","state":"https://pith.science/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EZ55QBB3Q4YZOO3HU7PGVUJAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2EZ55QBB3Q4YZOO3HU7PGVUJAM","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":"f62ab3f3aa549309e933bd0620f8c37bb0854a27f25d7f31dc3ac9e9ce126fef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-03-22T16:51:55Z","title_canon_sha256":"3ba9b1dcc065d8b7800d9c3d3c05d461c7bfe38cb14fa1000ba104ec2d549efc"},"schema_version":"1.0","source":{"id":"1203.5040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5040","created_at":"2026-05-18T03:59:28Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5040v1","created_at":"2026-05-18T03:59:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5040","created_at":"2026-05-18T03:59:28Z"},{"alias_kind":"pith_short_12","alias_value":"2EZ55QBB3Q4Y","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2EZ55QBB3Q4YZOO3","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2EZ55QBB","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:2538eac2e39f622bd9430ffb69c0f9240de4ac1f6a25661fef5d3a6e38b0a919","target":"graph","created_at":"2026-05-18T03:59:28Z","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 a system of parallel queues where tasks are assigned (dispatched) to one of the available servers upon arrival. The dispatching decision is based on the full state information, i.e., on the sizes of the new and existing jobs. We are interested in minimizing the so-called mean slowdown criterion corresponding to the mean of the sojourn time divided by the processing time. Assuming no new jobs arrive, the shortest-processing-time-product (SPTP) schedule is known to minimize the slowdown of the existing jobs. The main contribution of this paper is three-fold: 1) To show the optimality","authors_text":"Aleksi Penttinen, Esa Hyyti\\\"a, Samuli Aalto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-03-22T16:51:55Z","title":"Minimizing Slowdown in Heterogeneous Size-Aware Dispatching Systems (full version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5040","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:3370a08ea0a180ac8773bdd676ee2b293506bcac1177032a6f14367db05107f4","target":"record","created_at":"2026-05-18T03:59:28Z","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":"f62ab3f3aa549309e933bd0620f8c37bb0854a27f25d7f31dc3ac9e9ce126fef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-03-22T16:51:55Z","title_canon_sha256":"3ba9b1dcc065d8b7800d9c3d3c05d461c7bfe38cb14fa1000ba104ec2d549efc"},"schema_version":"1.0","source":{"id":"1203.5040","kind":"arxiv","version":1}},"canonical_sha256":"d133dec021dc398cb9db3d3ef356890316aee28a2c7ca9d737d1d4410caae141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d133dec021dc398cb9db3d3ef356890316aee28a2c7ca9d737d1d4410caae141","first_computed_at":"2026-05-18T03:59:28.074869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:28.074869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nnaDw56aBoZBVh9Xic8miAJJnsbIQ/BWIfu43pom/ChkxwP3cNGGYIMEsv/EotoL3gfmFI5+zgfiAVxT6qrMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:28.075660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3370a08ea0a180ac8773bdd676ee2b293506bcac1177032a6f14367db05107f4","sha256:2538eac2e39f622bd9430ffb69c0f9240de4ac1f6a25661fef5d3a6e38b0a919"],"state_sha256":"c0e9b9da0fe862e39675b48b35e1af19d034ca9f8ac50dd1dbfb28de886df593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9ShMkjGGAQthzomp93qFfJE4iNtRVaHpDVrE+KRHL/2IpEcrB7/mKsWI5T+Cj4O3BpR02uwfe49l6W1idKaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:57:08.956391Z","bundle_sha256":"5ff9c9a2d54894a1dd02dea7cb3db14f1036dfb2be8a823630d1f28698a9ce42"}}