{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7MV2PXEO6QRIQRSNUFN3XQJYEJ","short_pith_number":"pith:7MV2PXEO","schema_version":"1.0","canonical_sha256":"fb2ba7dc8ef42288464da15bbbc138226aa59230b2c5b665e72658be57f983fe","source":{"kind":"arxiv","id":"1903.00398","version":1},"attestation_state":"computed","paper":{"title":"Improved queue-size scaling for input-queued switches via graph factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jiaming Xu, Yuan Zhong","submitted_at":"2019-03-01T16:43:52Z","abstract_excerpt":"This paper studies the scaling of the expected total queue size in an $n\\times n$ input-queued switch, as a function of both the load $\\rho$ and the system scale $n$. We provide a new class of scheduling policies under which the expected total queue size scales as $O\\left( n(1-\\rho)^{-4/3} \\log \\left(\\max\\{\\frac{1}{1-\\rho}, n\\}\\right)\\right)$, over all $n$ and $\\rho<1$, when the arrival rates are uniform. This improves over the previously best-known scalings in two regimes: $O\\left(n^{1.5}(1-\\rho)^{-1} \\log \\frac{1}{1-\\rho}\\right)$ when $\\Omega(n^{-1.5}) \\le 1-\\rho \\le O(n^{-1})$ and $O\\left(\\"},"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":"1903.00398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-01T16:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"5bac565f2fa96247ea31cdf26e01c92b322b1af3d28891877a7537df9c42f640","abstract_canon_sha256":"318564a0429e9db5c9055214357e949a1c90f73cd325ccc72926d632351882a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:19.790114Z","signature_b64":"T2hqj5koQNFwayLJqKrQFWDGqXgL4ik2lGDaWVeqGBVs7ArMkBQ28TVZmWJQUqaF8VTVt4rTCSNin77wwMzjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb2ba7dc8ef42288464da15bbbc138226aa59230b2c5b665e72658be57f983fe","last_reissued_at":"2026-05-17T23:52:19.789372Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:19.789372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved queue-size scaling for input-queued switches via graph factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jiaming Xu, Yuan Zhong","submitted_at":"2019-03-01T16:43:52Z","abstract_excerpt":"This paper studies the scaling of the expected total queue size in an $n\\times n$ input-queued switch, as a function of both the load $\\rho$ and the system scale $n$. We provide a new class of scheduling policies under which the expected total queue size scales as $O\\left( n(1-\\rho)^{-4/3} \\log \\left(\\max\\{\\frac{1}{1-\\rho}, n\\}\\right)\\right)$, over all $n$ and $\\rho<1$, when the arrival rates are uniform. This improves over the previously best-known scalings in two regimes: $O\\left(n^{1.5}(1-\\rho)^{-1} \\log \\frac{1}{1-\\rho}\\right)$ when $\\Omega(n^{-1.5}) \\le 1-\\rho \\le O(n^{-1})$ and $O\\left(\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00398","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.00398","created_at":"2026-05-17T23:52:19.789521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00398v1","created_at":"2026-05-17T23:52:19.789521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00398","created_at":"2026-05-17T23:52:19.789521+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MV2PXEO6QRI","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MV2PXEO6QRIQRSN","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MV2PXEO","created_at":"2026-05-18T12:33:12.712433+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/7MV2PXEO6QRIQRSNUFN3XQJYEJ","json":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ.json","graph_json":"https://pith.science/api/pith-number/7MV2PXEO6QRIQRSNUFN3XQJYEJ/graph.json","events_json":"https://pith.science/api/pith-number/7MV2PXEO6QRIQRSNUFN3XQJYEJ/events.json","paper":"https://pith.science/paper/7MV2PXEO"},"agent_actions":{"view_html":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ","download_json":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ.json","view_paper":"https://pith.science/paper/7MV2PXEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00398&json=true","fetch_graph":"https://pith.science/api/pith-number/7MV2PXEO6QRIQRSNUFN3XQJYEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7MV2PXEO6QRIQRSNUFN3XQJYEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/action/storage_attestation","attest_author":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/action/author_attestation","sign_citation":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/action/citation_signature","submit_replication":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/action/replication_record"}},"created_at":"2026-05-17T23:52:19.789521+00:00","updated_at":"2026-05-17T23:52:19.789521+00:00"}