{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5OZ66Y2TCZW33U6AJYP2M7GI65","short_pith_number":"pith:5OZ66Y2T","canonical_record":{"source":{"id":"1112.4214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-19T02:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"767894dc4f37f957b30c25463e3a914e5c4ba0b0bdb85647eef328d52b0110d5","abstract_canon_sha256":"15c6786536ea7c22d86a297ffce152becae2d1a99be84e2613bc9e7accfb48e3"},"schema_version":"1.0"},"canonical_sha256":"ebb3ef6353166dbdd3c04e1fa67cc8f773fee26fa34f5a962e2d9602579e3280","source":{"kind":"arxiv","id":"1112.4214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4214","created_at":"2026-05-18T04:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4214v1","created_at":"2026-05-18T04:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4214","created_at":"2026-05-18T04:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"5OZ66Y2TCZW3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5OZ66Y2TCZW33U6A","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5OZ66Y2T","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5OZ66Y2TCZW33U6AJYP2M7GI65","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-19T02:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"767894dc4f37f957b30c25463e3a914e5c4ba0b0bdb85647eef328d52b0110d5","abstract_canon_sha256":"15c6786536ea7c22d86a297ffce152becae2d1a99be84e2613bc9e7accfb48e3"},"schema_version":"1.0"},"canonical_sha256":"ebb3ef6353166dbdd3c04e1fa67cc8f773fee26fa34f5a962e2d9602579e3280","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:06.822194Z","signature_b64":"K/lpWjKLK179+EaUu66fEfz/JJ4ABwlghxWPevNww6Pd5mYBbie8tXzsDhFb8U4Hv6rKCN8XnZYYwBTYdmqACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb3ef6353166dbdd3c04e1fa67cc8f773fee26fa34f5a962e2d9602579e3280","last_reissued_at":"2026-05-18T04:06:06.821731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:06.821731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4214","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-18T04:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSTmGTrxXxtTN3PzYIKLnNGmRULTVYapRne8NwPVcG37k7W9FDdkrDb+P0HWVNcBQmhqaT3KuALqZ9hnvzN9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:45:59.630535Z"},"content_sha256":"cca8cb00aeab0660c864738b7539fb153a7c208ee9223ecc567f8982540ed00a","schema_version":"1.0","event_id":"sha256:cca8cb00aeab0660c864738b7539fb153a7c208ee9223ecc567f8982540ed00a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5OZ66Y2TCZW33U6AJYP2M7GI65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Scheduling Algorithm for High-Speed Switching Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Shivendra Panwar, Shunyuan Ye, Yanming Shen","submitted_at":"2011-12-19T02:08:23Z","abstract_excerpt":"Given the rapid increase in traffic, greater demands have been put on research in 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 distributed 100% throughput algorithm for crosspoint buffered switches, calle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4214","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-18T04:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmhykphie7YtpspTfq89klmPVBDcQ54en+FN5RoyooAJDPeCf8nnHd4yusejPHgCfiRW4xU9Y6WuxWMyFU3cDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:45:59.630880Z"},"content_sha256":"0f280a8f80be79df05c23e4ba9b6afd2e918c511971d77a4c193bc6ddf0ffc77","schema_version":"1.0","event_id":"sha256:0f280a8f80be79df05c23e4ba9b6afd2e918c511971d77a4c193bc6ddf0ffc77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OZ66Y2TCZW33U6AJYP2M7GI65/bundle.json","state_url":"https://pith.science/pith/5OZ66Y2TCZW33U6AJYP2M7GI65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OZ66Y2TCZW33U6AJYP2M7GI65/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-20T08:45:59Z","links":{"resolver":"https://pith.science/pith/5OZ66Y2TCZW33U6AJYP2M7GI65","bundle":"https://pith.science/pith/5OZ66Y2TCZW33U6AJYP2M7GI65/bundle.json","state":"https://pith.science/pith/5OZ66Y2TCZW33U6AJYP2M7GI65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OZ66Y2TCZW33U6AJYP2M7GI65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5OZ66Y2TCZW33U6AJYP2M7GI65","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":"15c6786536ea7c22d86a297ffce152becae2d1a99be84e2613bc9e7accfb48e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-19T02:08:23Z","title_canon_sha256":"767894dc4f37f957b30c25463e3a914e5c4ba0b0bdb85647eef328d52b0110d5"},"schema_version":"1.0","source":{"id":"1112.4214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4214","created_at":"2026-05-18T04:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4214v1","created_at":"2026-05-18T04:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4214","created_at":"2026-05-18T04:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"5OZ66Y2TCZW3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5OZ66Y2TCZW33U6A","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5OZ66Y2T","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:0f280a8f80be79df05c23e4ba9b6afd2e918c511971d77a4c193bc6ddf0ffc77","target":"graph","created_at":"2026-05-18T04:06:06Z","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 research in 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 distributed 100% throughput algorithm for crosspoint buffered switches, calle","authors_text":"Shivendra Panwar, Shunyuan Ye, Yanming Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-19T02:08:23Z","title":"A Distributed Scheduling Algorithm for High-Speed Switching Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4214","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:cca8cb00aeab0660c864738b7539fb153a7c208ee9223ecc567f8982540ed00a","target":"record","created_at":"2026-05-18T04:06:06Z","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":"15c6786536ea7c22d86a297ffce152becae2d1a99be84e2613bc9e7accfb48e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-12-19T02:08:23Z","title_canon_sha256":"767894dc4f37f957b30c25463e3a914e5c4ba0b0bdb85647eef328d52b0110d5"},"schema_version":"1.0","source":{"id":"1112.4214","kind":"arxiv","version":1}},"canonical_sha256":"ebb3ef6353166dbdd3c04e1fa67cc8f773fee26fa34f5a962e2d9602579e3280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebb3ef6353166dbdd3c04e1fa67cc8f773fee26fa34f5a962e2d9602579e3280","first_computed_at":"2026-05-18T04:06:06.821731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:06.821731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/lpWjKLK179+EaUu66fEfz/JJ4ABwlghxWPevNww6Pd5mYBbie8tXzsDhFb8U4Hv6rKCN8XnZYYwBTYdmqACA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:06.822194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cca8cb00aeab0660c864738b7539fb153a7c208ee9223ecc567f8982540ed00a","sha256:0f280a8f80be79df05c23e4ba9b6afd2e918c511971d77a4c193bc6ddf0ffc77"],"state_sha256":"de2039ed94ddae6c343313f271b73413ca16d85eb02a6e63cc201102f74f490f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koduqUP8arEyNVHxVQ8nO75alfqRJ3Su8Kdhk8+c0IED1kYtY7S8+V9kkFg3Fwsji4hzWUEqsSpgwTJ0v7lnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T08:45:59.632852Z","bundle_sha256":"10c2578c6c4e9e683a8394c8e0ca7020817443a34e6fddaf77c6df90aece7863"}}