{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UUV6VLXLJIKXLRAPTORQYTIDD3","short_pith_number":"pith:UUV6VLXL","canonical_record":{"source":{"id":"1306.5347","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-06-22T19:03:12Z","cross_cats_sorted":[],"title_canon_sha256":"3ab4022608c67e3f075a10100498bae3a774e000741486b6bd31f1dd50932aad","abstract_canon_sha256":"428a2899f4f8dc348b069b1e5332b8322a4c2101a0688e3d4892605fa12f90de"},"schema_version":"1.0"},"canonical_sha256":"a52beaaeeb4a1575c40f9ba30c4d031ed84a1518b84e7c9e2a207f5b9e47028b","source":{"kind":"arxiv","id":"1306.5347","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5347","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5347v3","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5347","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"UUV6VLXLJIKX","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UUV6VLXLJIKXLRAP","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UUV6VLXL","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UUV6VLXLJIKXLRAPTORQYTIDD3","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5347","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-06-22T19:03:12Z","cross_cats_sorted":[],"title_canon_sha256":"3ab4022608c67e3f075a10100498bae3a774e000741486b6bd31f1dd50932aad","abstract_canon_sha256":"428a2899f4f8dc348b069b1e5332b8322a4c2101a0688e3d4892605fa12f90de"},"schema_version":"1.0"},"canonical_sha256":"a52beaaeeb4a1575c40f9ba30c4d031ed84a1518b84e7c9e2a207f5b9e47028b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.533034Z","signature_b64":"h0n36cuOXUAxmcpEB57/jDMgX09i+SInoTR6jUoDoehfZa1m2nY3kYHZnExlxL48RljtK7f6tCqG9v5t4+OdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a52beaaeeb4a1575c40f9ba30c4d031ed84a1518b84e7c9e2a207f5b9e47028b","last_reissued_at":"2026-05-18T02:40:47.532392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.532392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5347","source_version":3,"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-18T02:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykKSu2nDWWD+HK8fRFYiPf4EQN+tKX2qPtxvMTiRhm69yeridzNv2coCSYINB1+xWbl8SyCgBcZBFgJdZnzpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:00:42.553741Z"},"content_sha256":"bc221c211bda9ac26de5a73028f811d46b30d7effbf80f0bce7cb169027791af","schema_version":"1.0","event_id":"sha256:bc221c211bda9ac26de5a73028f811d46b30d7effbf80f0bce7cb169027791af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UUV6VLXLJIKXLRAPTORQYTIDD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized longest-queue-first scheduling for large-scale buffered systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. B. Dieker, Tonghoon Suk","submitted_at":"2013-06-22T19:03:12Z","abstract_excerpt":"We develop diffusion approximations for parallel-queueing systems with the randomized longest-queue-first scheduling algorithm by establishing new mean-field limit theorems as the number of buffers $n\\to\\infty$. We achieve this by allowing the number of sampled buffers $d=d(n)$ to depend on the number of buffers $n$, which yields an asymptotic `decoupling' of the queue length processes.\n  We show through simulation experiments that the resulting approximation is accurate even for moderate values of $n$ and $d(n)$. To our knowledge, we are the first to derive diffusion approximations for a queu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5347","kind":"arxiv","version":3},"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-18T02:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nxWRaYU1zzUCiFgjCQTlWepOxF54ATsVhLwVOsGZRCAjIivwU+wi+vU0KqCi9oCDwozmz3jpYohBpRsXiEoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:00:42.554078Z"},"content_sha256":"78597840da90d1562d46dedc0055bedf1c2d7a332c6d019ddea3ea7d9e947fd5","schema_version":"1.0","event_id":"sha256:78597840da90d1562d46dedc0055bedf1c2d7a332c6d019ddea3ea7d9e947fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/bundle.json","state_url":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/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-01T18:00:42Z","links":{"resolver":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3","bundle":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/bundle.json","state":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UUV6VLXLJIKXLRAPTORQYTIDD3","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":"428a2899f4f8dc348b069b1e5332b8322a4c2101a0688e3d4892605fa12f90de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-06-22T19:03:12Z","title_canon_sha256":"3ab4022608c67e3f075a10100498bae3a774e000741486b6bd31f1dd50932aad"},"schema_version":"1.0","source":{"id":"1306.5347","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5347","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5347v3","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5347","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"UUV6VLXLJIKX","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UUV6VLXLJIKXLRAP","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UUV6VLXL","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:78597840da90d1562d46dedc0055bedf1c2d7a332c6d019ddea3ea7d9e947fd5","target":"graph","created_at":"2026-05-18T02:40:47Z","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 develop diffusion approximations for parallel-queueing systems with the randomized longest-queue-first scheduling algorithm by establishing new mean-field limit theorems as the number of buffers $n\\to\\infty$. We achieve this by allowing the number of sampled buffers $d=d(n)$ to depend on the number of buffers $n$, which yields an asymptotic `decoupling' of the queue length processes.\n  We show through simulation experiments that the resulting approximation is accurate even for moderate values of $n$ and $d(n)$. To our knowledge, we are the first to derive diffusion approximations for a queu","authors_text":"A. B. Dieker, Tonghoon Suk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-06-22T19:03:12Z","title":"Randomized longest-queue-first scheduling for large-scale buffered systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5347","kind":"arxiv","version":3},"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:bc221c211bda9ac26de5a73028f811d46b30d7effbf80f0bce7cb169027791af","target":"record","created_at":"2026-05-18T02:40:47Z","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":"428a2899f4f8dc348b069b1e5332b8322a4c2101a0688e3d4892605fa12f90de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-06-22T19:03:12Z","title_canon_sha256":"3ab4022608c67e3f075a10100498bae3a774e000741486b6bd31f1dd50932aad"},"schema_version":"1.0","source":{"id":"1306.5347","kind":"arxiv","version":3}},"canonical_sha256":"a52beaaeeb4a1575c40f9ba30c4d031ed84a1518b84e7c9e2a207f5b9e47028b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a52beaaeeb4a1575c40f9ba30c4d031ed84a1518b84e7c9e2a207f5b9e47028b","first_computed_at":"2026-05-18T02:40:47.532392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:47.532392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h0n36cuOXUAxmcpEB57/jDMgX09i+SInoTR6jUoDoehfZa1m2nY3kYHZnExlxL48RljtK7f6tCqG9v5t4+OdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:47.533034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5347","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc221c211bda9ac26de5a73028f811d46b30d7effbf80f0bce7cb169027791af","sha256:78597840da90d1562d46dedc0055bedf1c2d7a332c6d019ddea3ea7d9e947fd5"],"state_sha256":"f17b95a27afdd3ff7771ddb32862f68072d223255ce76ef069e1c96762187e74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEiOnV3ISMP4AiuK8qs8Xsnw5IUs6IOnXwea9PEfRWPP5NDgezSB7KxSymStl1uzbsUBpDM43g9o5ALx+mtdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:00:42.555990Z","bundle_sha256":"7676f334cdcd4f06a2c257afb16548321f0be38ece22a6d28c325f4f2aad7d2b"}}