{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EGCMCNJPGFPT5ZMXLHIH6Z3VRX","short_pith_number":"pith:EGCMCNJP","canonical_record":{"source":{"id":"1406.4235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-17T04:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"a67874cf98143b6e36e965a7c4b861b2b43f165961012f753738fb8a351e377c","abstract_canon_sha256":"383fdad04d81e33de568ab174e08bb3968fa46b790ef5a9cffa539f595bc47cf"},"schema_version":"1.0"},"canonical_sha256":"2184c1352f315f3ee59759d07f67758dc1f2a476679f43071a3e1ba56bd76c1b","source":{"kind":"arxiv","id":"1406.4235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4235","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4235v1","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4235","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"EGCMCNJPGFPT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EGCMCNJPGFPT5ZMX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EGCMCNJP","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EGCMCNJPGFPT5ZMXLHIH6Z3VRX","target":"record","payload":{"canonical_record":{"source":{"id":"1406.4235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-17T04:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"a67874cf98143b6e36e965a7c4b861b2b43f165961012f753738fb8a351e377c","abstract_canon_sha256":"383fdad04d81e33de568ab174e08bb3968fa46b790ef5a9cffa539f595bc47cf"},"schema_version":"1.0"},"canonical_sha256":"2184c1352f315f3ee59759d07f67758dc1f2a476679f43071a3e1ba56bd76c1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:38.063452Z","signature_b64":"NOrU9O4HWFEKznMcaNp8jVU2gda/daEJUM+xAqTvmE06uXO+PhqL2/llbIeHSL4V4FhGknXHBuQH+qcGfYkxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2184c1352f315f3ee59759d07f67758dc1f2a476679f43071a3e1ba56bd76c1b","last_reissued_at":"2026-05-18T02:49:38.062991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:38.062991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.4235","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:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9W1kvc40dE1mO8r/6fyZ69G5sbcjhpjGbVSRHuuq65cGiTIeuCKokvQ0BPHv5mINyboRTeVp46fkv2F99bpnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:00:59.499145Z"},"content_sha256":"4b0ab9e08ef98f63cb05d6a983376bdf889603b7582f3041a8aebc59620cefba","schema_version":"1.0","event_id":"sha256:4b0ab9e08ef98f63cb05d6a983376bdf889603b7582f3041a8aebc59620cefba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EGCMCNJPGFPT5ZMXLHIH6Z3VRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Scheduling Algorithms for Crosspoint-Buffered Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Shivendra S. Panwar, Shunyuan Ye, Yanming Shen","submitted_at":"2014-06-17T04:46:49Z","abstract_excerpt":"Given the rapid increase in traffic, greater demands have been put on high-speed switching systems. Such systems have to simultaneously meet several constraints, e.g., high throughput, low delay and low complexity. This makes it challenging to design an efficient scheduling algorithm, and has consequently drawn considerable research interest. However, previous results either cannot provide a $100\\%$ throughput guarantee without a speedup, or require a complex centralized scheduler. In this paper, we design a {\\it distributed} $100 \\%$ throughput algorithm for crosspoint buffered switches, call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4235","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:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfiwdDHtAgSsrxmvypJA7n1LmMhZTUOzb6gimqgyhTW4zDkmkhqXnHldivcVWhcWrlgrg5i6b0tq0icjVwHeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:00:59.499507Z"},"content_sha256":"05ae0621bd09fe139efb7e4e56e4299c98fe181feb0284a490c952b597450978","schema_version":"1.0","event_id":"sha256:05ae0621bd09fe139efb7e4e56e4299c98fe181feb0284a490c952b597450978"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX/bundle.json","state_url":"https://pith.science/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX/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-02T07:00:59Z","links":{"resolver":"https://pith.science/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX","bundle":"https://pith.science/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX/bundle.json","state":"https://pith.science/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGCMCNJPGFPT5ZMXLHIH6Z3VRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EGCMCNJPGFPT5ZMXLHIH6Z3VRX","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":"383fdad04d81e33de568ab174e08bb3968fa46b790ef5a9cffa539f595bc47cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-17T04:46:49Z","title_canon_sha256":"a67874cf98143b6e36e965a7c4b861b2b43f165961012f753738fb8a351e377c"},"schema_version":"1.0","source":{"id":"1406.4235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.4235","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1406.4235v1","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4235","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"EGCMCNJPGFPT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EGCMCNJPGFPT5ZMX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EGCMCNJP","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:05ae0621bd09fe139efb7e4e56e4299c98fe181feb0284a490c952b597450978","target":"graph","created_at":"2026-05-18T02:49:38Z","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":"Given the rapid increase in traffic, greater demands have been put on high-speed switching systems. Such systems have to simultaneously meet several constraints, e.g., high throughput, low delay and low complexity. This makes it challenging to design an efficient scheduling algorithm, and has consequently drawn considerable research interest. However, previous results either cannot provide a $100\\%$ throughput guarantee without a speedup, or require a complex centralized scheduler. In this paper, we design a {\\it distributed} $100 \\%$ throughput algorithm for crosspoint buffered switches, call","authors_text":"Shivendra S. Panwar, Shunyuan Ye, Yanming Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-17T04:46:49Z","title":"Distributed Scheduling Algorithms for Crosspoint-Buffered Switches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4235","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:4b0ab9e08ef98f63cb05d6a983376bdf889603b7582f3041a8aebc59620cefba","target":"record","created_at":"2026-05-18T02:49:38Z","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":"383fdad04d81e33de568ab174e08bb3968fa46b790ef5a9cffa539f595bc47cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-06-17T04:46:49Z","title_canon_sha256":"a67874cf98143b6e36e965a7c4b861b2b43f165961012f753738fb8a351e377c"},"schema_version":"1.0","source":{"id":"1406.4235","kind":"arxiv","version":1}},"canonical_sha256":"2184c1352f315f3ee59759d07f67758dc1f2a476679f43071a3e1ba56bd76c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2184c1352f315f3ee59759d07f67758dc1f2a476679f43071a3e1ba56bd76c1b","first_computed_at":"2026-05-18T02:49:38.062991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:38.062991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NOrU9O4HWFEKznMcaNp8jVU2gda/daEJUM+xAqTvmE06uXO+PhqL2/llbIeHSL4V4FhGknXHBuQH+qcGfYkxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:38.063452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.4235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b0ab9e08ef98f63cb05d6a983376bdf889603b7582f3041a8aebc59620cefba","sha256:05ae0621bd09fe139efb7e4e56e4299c98fe181feb0284a490c952b597450978"],"state_sha256":"a3a5be78ca4d3742c579ee7551d24e5419e7407534fa2257db5bbb60cf2de885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eN90tc2Fsh/nbaJ1j160MiHWj7LjwxPXMME8+UJA60szjbp0GylDAZsxpMO1e43aoyOLKwa6fZy58yEainUwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:00:59.501549Z","bundle_sha256":"61d47c2d53e55faeade94b8725d951492046e577d5c561d46ddc8e7edcd8b1d2"}}