{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QJJNYJDRLQSAEVTSOAYJWCZGVG","short_pith_number":"pith:QJJNYJDR","canonical_record":{"source":{"id":"1405.4764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-19T15:32:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f4200eaeffff426d7ea2ee86adf5652e7a5ac9e378df7147813bb33525a38eb4","abstract_canon_sha256":"468a7ca12bad304e10e65634236eb0472b94771a1b4601129b26acf0f681e573"},"schema_version":"1.0"},"canonical_sha256":"8252dc24715c2402567270309b0b26a9b4d8c259a63cb4220e1d06346dd5df31","source":{"kind":"arxiv","id":"1405.4764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4764","created_at":"2026-05-18T02:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4764v1","created_at":"2026-05-18T02:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4764","created_at":"2026-05-18T02:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"QJJNYJDRLQSA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJJNYJDRLQSAEVTS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJJNYJDR","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QJJNYJDRLQSAEVTSOAYJWCZGVG","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-19T15:32:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f4200eaeffff426d7ea2ee86adf5652e7a5ac9e378df7147813bb33525a38eb4","abstract_canon_sha256":"468a7ca12bad304e10e65634236eb0472b94771a1b4601129b26acf0f681e573"},"schema_version":"1.0"},"canonical_sha256":"8252dc24715c2402567270309b0b26a9b4d8c259a63cb4220e1d06346dd5df31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:34.722010Z","signature_b64":"02p8/AYdM9jIFiQTC34Ro3sCpc8UWbd/PvE/KIr15pw46esfXJLX3CArTenRYPvhLpSqFEly94lWL74+b4ikDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8252dc24715c2402567270309b0b26a9b4d8c259a63cb4220e1d06346dd5df31","last_reissued_at":"2026-05-18T02:51:34.721551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:34.721551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4764","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-18T02:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cfLONTbtuTW1JtlZjAcdSq1yNVaTAFDguVjjEzN/Wn/2SgnfJKCjVlviXSvR5xXhNvEb8ZJsG8tj/ufO9EUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:46:38.080448Z"},"content_sha256":"f95adbc4828a0dab88e91d4b957311cb521c68d29f7c06651b3bac031525a6b8","schema_version":"1.0","event_id":"sha256:f95adbc4828a0dab88e91d4b957311cb521c68d29f7c06651b3bac031525a6b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QJJNYJDRLQSAEVTSOAYJWCZGVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Queue-Size Scaling for Input-Queued Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"Devavrat Shah, John. N. Tsitsiklis, Yuan Zhong","submitted_at":"2014-05-19T15:32:48Z","abstract_excerpt":"We study the optimal scaling of the expected total queue size in an $n\\times n$ input-queued switch, as a function of the number of ports $n$ and the load factor $\\rho$, which has been conjectured to be $\\Theta (n/(1-\\rho))$. In a recent work, the validity of this conjecture has been established for the regime where $1-\\rho = O(1/n^2)$. In this paper, we make further progress in the direction of this conjecture. We provide a new class of scheduling policies under which the expected total queue size scales as $O(n^{1.5}(1-\\rho)^{-1}\\log(1/(1-\\rho)))$ when $1-\\rho = O(1/n)$. This is an improveme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4764","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-18T02:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWy8Fm+dtdvbnOo2NL24A4PZAyBU9LYEf6Mbal6zrHRRE/D61iZ53rGIJEfvJjRuHchXhHIHfWDdgw6sq7DICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:46:38.080895Z"},"content_sha256":"2db7551f3f7a92f4052ca6a6a3a28b5e0dabef8854bdaf6836e6278b51e532e6","schema_version":"1.0","event_id":"sha256:2db7551f3f7a92f4052ca6a6a3a28b5e0dabef8854bdaf6836e6278b51e532e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG/bundle.json","state_url":"https://pith.science/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG/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-05T00:46:38Z","links":{"resolver":"https://pith.science/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG","bundle":"https://pith.science/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG/bundle.json","state":"https://pith.science/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJJNYJDRLQSAEVTSOAYJWCZGVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QJJNYJDRLQSAEVTSOAYJWCZGVG","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":"468a7ca12bad304e10e65634236eb0472b94771a1b4601129b26acf0f681e573","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-19T15:32:48Z","title_canon_sha256":"f4200eaeffff426d7ea2ee86adf5652e7a5ac9e378df7147813bb33525a38eb4"},"schema_version":"1.0","source":{"id":"1405.4764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4764","created_at":"2026-05-18T02:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4764v1","created_at":"2026-05-18T02:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4764","created_at":"2026-05-18T02:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"QJJNYJDRLQSA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJJNYJDRLQSAEVTS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJJNYJDR","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:2db7551f3f7a92f4052ca6a6a3a28b5e0dabef8854bdaf6836e6278b51e532e6","target":"graph","created_at":"2026-05-18T02:51:34Z","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 study the optimal scaling of the expected total queue size in an $n\\times n$ input-queued switch, as a function of the number of ports $n$ and the load factor $\\rho$, which has been conjectured to be $\\Theta (n/(1-\\rho))$. In a recent work, the validity of this conjecture has been established for the regime where $1-\\rho = O(1/n^2)$. In this paper, we make further progress in the direction of this conjecture. We provide a new class of scheduling policies under which the expected total queue size scales as $O(n^{1.5}(1-\\rho)^{-1}\\log(1/(1-\\rho)))$ when $1-\\rho = O(1/n)$. This is an improveme","authors_text":"Devavrat Shah, John. N. Tsitsiklis, Yuan Zhong","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-19T15:32:48Z","title":"On Queue-Size Scaling for Input-Queued Switches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4764","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:f95adbc4828a0dab88e91d4b957311cb521c68d29f7c06651b3bac031525a6b8","target":"record","created_at":"2026-05-18T02:51:34Z","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":"468a7ca12bad304e10e65634236eb0472b94771a1b4601129b26acf0f681e573","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-19T15:32:48Z","title_canon_sha256":"f4200eaeffff426d7ea2ee86adf5652e7a5ac9e378df7147813bb33525a38eb4"},"schema_version":"1.0","source":{"id":"1405.4764","kind":"arxiv","version":1}},"canonical_sha256":"8252dc24715c2402567270309b0b26a9b4d8c259a63cb4220e1d06346dd5df31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8252dc24715c2402567270309b0b26a9b4d8c259a63cb4220e1d06346dd5df31","first_computed_at":"2026-05-18T02:51:34.721551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:34.721551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"02p8/AYdM9jIFiQTC34Ro3sCpc8UWbd/PvE/KIr15pw46esfXJLX3CArTenRYPvhLpSqFEly94lWL74+b4ikDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:34.722010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f95adbc4828a0dab88e91d4b957311cb521c68d29f7c06651b3bac031525a6b8","sha256:2db7551f3f7a92f4052ca6a6a3a28b5e0dabef8854bdaf6836e6278b51e532e6"],"state_sha256":"89f7f4d52977343c45d2884971751f384ee315f2ba8552a170c7affa4c9fe93e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ic9eDSAAud8BHsL6nKM/SDCjPWkw/VwsWO1+B4hfFtLHkzPhVGNjY4bKY9HKOcoKVb5W+zlk4Gyjn60zkNCfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:46:38.082901Z","bundle_sha256":"abe9c0af229576fa86f29fce2137b8014f8d3a4565a33b91b0aa469cafb8d3f2"}}