{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7MV2PXEO6QRIQRSNUFN3XQJYEJ","short_pith_number":"pith:7MV2PXEO","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"},"canonical_sha256":"fb2ba7dc8ef42288464da15bbbc138226aa59230b2c5b665e72658be57f983fe","source":{"kind":"arxiv","id":"1903.00398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00398","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00398v1","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00398","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"7MV2PXEO6QRI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7MV2PXEO6QRIQRSN","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7MV2PXEO","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7MV2PXEO6QRIQRSNUFN3XQJYEJ","target":"record","payload":{"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"},"canonical_sha256":"fb2ba7dc8ef42288464da15bbbc138226aa59230b2c5b665e72658be57f983fe","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"},"source_kind":"arxiv","source_id":"1903.00398","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-17T23:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgiEFcnhKNmqk+HZMXtR8/OfQHewL+OSQD7u3ByG/72aLniaYe+6/Zf5kLApEbUSWAVh07ogAhXMEeKMMqRtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:37:30.497500Z"},"content_sha256":"51d585a7eceb5e090a18447c3a11f97006362205c6a7c14c2a964d2248bda99a","schema_version":"1.0","event_id":"sha256:51d585a7eceb5e090a18447c3a11f97006362205c6a7c14c2a964d2248bda99a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7MV2PXEO6QRIQRSNUFN3XQJYEJ","target":"graph","payload":{"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"},"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-17T23:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOnJ9n0wH9EdQc70edt57H5v44OUDe5nRemhvfW7h/dTuQIuSnCugI6pMAjJ+pydoHE8FKaZUr3UoXm74KaQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:37:30.497983Z"},"content_sha256":"aaf14ef682c639f616351d704c5b3a20dbdebaf9241b8be8d4845b4f567305eb","schema_version":"1.0","event_id":"sha256:aaf14ef682c639f616351d704c5b3a20dbdebaf9241b8be8d4845b4f567305eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/bundle.json","state_url":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/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-05-27T07:37:30Z","links":{"resolver":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ","bundle":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/bundle.json","state":"https://pith.science/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MV2PXEO6QRIQRSNUFN3XQJYEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7MV2PXEO6QRIQRSNUFN3XQJYEJ","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":"318564a0429e9db5c9055214357e949a1c90f73cd325ccc72926d632351882a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-01T16:43:52Z","title_canon_sha256":"5bac565f2fa96247ea31cdf26e01c92b322b1af3d28891877a7537df9c42f640"},"schema_version":"1.0","source":{"id":"1903.00398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00398","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00398v1","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00398","created_at":"2026-05-17T23:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"7MV2PXEO6QRI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7MV2PXEO6QRIQRSN","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7MV2PXEO","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:aaf14ef682c639f616351d704c5b3a20dbdebaf9241b8be8d4845b4f567305eb","target":"graph","created_at":"2026-05-17T23:52:19Z","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":"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(\\","authors_text":"Jiaming Xu, Yuan Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-01T16:43:52Z","title":"Improved queue-size scaling for input-queued switches via graph factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00398","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:51d585a7eceb5e090a18447c3a11f97006362205c6a7c14c2a964d2248bda99a","target":"record","created_at":"2026-05-17T23:52:19Z","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":"318564a0429e9db5c9055214357e949a1c90f73cd325ccc72926d632351882a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-01T16:43:52Z","title_canon_sha256":"5bac565f2fa96247ea31cdf26e01c92b322b1af3d28891877a7537df9c42f640"},"schema_version":"1.0","source":{"id":"1903.00398","kind":"arxiv","version":1}},"canonical_sha256":"fb2ba7dc8ef42288464da15bbbc138226aa59230b2c5b665e72658be57f983fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb2ba7dc8ef42288464da15bbbc138226aa59230b2c5b665e72658be57f983fe","first_computed_at":"2026-05-17T23:52:19.789372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:19.789372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2hqj5koQNFwayLJqKrQFWDGqXgL4ik2lGDaWVeqGBVs7ArMkBQ28TVZmWJQUqaF8VTVt4rTCSNin77wwMzjDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:19.790114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51d585a7eceb5e090a18447c3a11f97006362205c6a7c14c2a964d2248bda99a","sha256:aaf14ef682c639f616351d704c5b3a20dbdebaf9241b8be8d4845b4f567305eb"],"state_sha256":"9a6d310b5c0bf10f9d79aa205daafa80942abd733d9789053af20a82ee4ec005"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPFSb5EWgqHCQMRYIsm47yCGqIt3ymalaRHR2bpBQKnOA9QvTEaPQNdHv0r0W6UGsIjMUpo35XglVIXoTp7SCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:37:30.501428Z","bundle_sha256":"ea0ed31bcd53714025132db4dc9d00baa1cda21ffbda6f9b62cd048024d2d476"}}