{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D5SZ5EMZOVAB2S6U65MVFDULRV","short_pith_number":"pith:D5SZ5EMZ","schema_version":"1.0","canonical_sha256":"1f659e919975401d4bd4f759528e8b8d73ad442f64fd3540628c19b26c0609b2","source":{"kind":"arxiv","id":"1710.07234","version":4},"attestation_state":"computed","paper":{"title":"SERENADE: A Parallel Randomized Algorithm Suite for Crossbar Scheduling in Input-Queued Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Jun Xu, Liang Liu, Long Gong, Sen Yang, Xinbing Wang, Yi Xie","submitted_at":"2017-10-19T16:26:51Z","abstract_excerpt":"Most of today's high-speed switches and routers adopt an input-queued crossbar switch architecture. Such a switch needs to compute a matching (crossbar schedule) between the input ports and output ports during each switching cycle (time slot). A key research challenge in designing large (in number of input/output ports $N$) input-queued crossbar switches is to develop crossbar scheduling algorithms that can compute \"high quality\" matchings -- i.e., those that result in high switch throughput (ideally $100\\%$) and low queueing delays for packets -- at line rates. SERENA is one such algorithm: i"},"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":"1710.07234","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-19T16:26:51Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0219e60024180944de426943fc5ccbb953041815b088243c0cfba30024ff784f","abstract_canon_sha256":"cdcddf4a4a58c6d4db59fd4a1bbac0392feddff13e58a28d2dec96045c41a93d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:06.214842Z","signature_b64":"ZdT4rBPr6KYdRspfTReil9SeKMmSYT5XJEJkxFauvQlidxfc2uhnk6n8PV4QCUOXZSu8uC8jJb7rBj4v3jgMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f659e919975401d4bd4f759528e8b8d73ad442f64fd3540628c19b26c0609b2","last_reissued_at":"2026-05-17T23:51:06.214247Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:06.214247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SERENADE: A Parallel Randomized Algorithm Suite for Crossbar Scheduling in Input-Queued Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Jun Xu, Liang Liu, Long Gong, Sen Yang, Xinbing Wang, Yi Xie","submitted_at":"2017-10-19T16:26:51Z","abstract_excerpt":"Most of today's high-speed switches and routers adopt an input-queued crossbar switch architecture. Such a switch needs to compute a matching (crossbar schedule) between the input ports and output ports during each switching cycle (time slot). A key research challenge in designing large (in number of input/output ports $N$) input-queued crossbar switches is to develop crossbar scheduling algorithms that can compute \"high quality\" matchings -- i.e., those that result in high switch throughput (ideally $100\\%$) and low queueing delays for packets -- at line rates. SERENA is one such algorithm: i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07234","kind":"arxiv","version":4},"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":"1710.07234","created_at":"2026-05-17T23:51:06.214324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07234v4","created_at":"2026-05-17T23:51:06.214324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07234","created_at":"2026-05-17T23:51:06.214324+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5SZ5EMZOVAB","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5SZ5EMZOVAB2S6U","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5SZ5EMZ","created_at":"2026-05-18T12:31:10.602751+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/D5SZ5EMZOVAB2S6U65MVFDULRV","json":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV.json","graph_json":"https://pith.science/api/pith-number/D5SZ5EMZOVAB2S6U65MVFDULRV/graph.json","events_json":"https://pith.science/api/pith-number/D5SZ5EMZOVAB2S6U65MVFDULRV/events.json","paper":"https://pith.science/paper/D5SZ5EMZ"},"agent_actions":{"view_html":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV","download_json":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV.json","view_paper":"https://pith.science/paper/D5SZ5EMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07234&json=true","fetch_graph":"https://pith.science/api/pith-number/D5SZ5EMZOVAB2S6U65MVFDULRV/graph.json","fetch_events":"https://pith.science/api/pith-number/D5SZ5EMZOVAB2S6U65MVFDULRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV/action/storage_attestation","attest_author":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV/action/author_attestation","sign_citation":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV/action/citation_signature","submit_replication":"https://pith.science/pith/D5SZ5EMZOVAB2S6U65MVFDULRV/action/replication_record"}},"created_at":"2026-05-17T23:51:06.214324+00:00","updated_at":"2026-05-17T23:51:06.214324+00:00"}