{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UUV6VLXLJIKXLRAPTORQYTIDD3","short_pith_number":"pith:UUV6VLXL","schema_version":"1.0","canonical_sha256":"a52beaaeeb4a1575c40f9ba30c4d031ed84a1518b84e7c9e2a207f5b9e47028b","source":{"kind":"arxiv","id":"1306.5347","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5347","created_at":"2026-05-18T02:40:47.532503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5347v3","created_at":"2026-05-18T02:40:47.532503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5347","created_at":"2026-05-18T02:40:47.532503+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUV6VLXLJIKX","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUV6VLXLJIKXLRAP","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUV6VLXL","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3","json":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3.json","graph_json":"https://pith.science/api/pith-number/UUV6VLXLJIKXLRAPTORQYTIDD3/graph.json","events_json":"https://pith.science/api/pith-number/UUV6VLXLJIKXLRAPTORQYTIDD3/events.json","paper":"https://pith.science/paper/UUV6VLXL"},"agent_actions":{"view_html":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3","download_json":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3.json","view_paper":"https://pith.science/paper/UUV6VLXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5347&json=true","fetch_graph":"https://pith.science/api/pith-number/UUV6VLXLJIKXLRAPTORQYTIDD3/graph.json","fetch_events":"https://pith.science/api/pith-number/UUV6VLXLJIKXLRAPTORQYTIDD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/action/storage_attestation","attest_author":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/action/author_attestation","sign_citation":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/action/citation_signature","submit_replication":"https://pith.science/pith/UUV6VLXLJIKXLRAPTORQYTIDD3/action/replication_record"}},"created_at":"2026-05-18T02:40:47.532503+00:00","updated_at":"2026-05-18T02:40:47.532503+00:00"}