{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SWTI5SM6DX7QUV3HGQLRJTSEMS","short_pith_number":"pith:SWTI5SM6","schema_version":"1.0","canonical_sha256":"95a68ec99e1dff0a5767341714ce4464b26373a06cff4a5cf4dd46b4d819b74c","source":{"kind":"arxiv","id":"1606.07226","version":1},"attestation_state":"computed","paper":{"title":"Parallel Scheduling Algorithm based on Complex Coloring for Input-Queued Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Lingkang Wang, Tong Ye, Tony T. Lee, Weisheng Hu","submitted_at":"2016-06-23T08:43:07Z","abstract_excerpt":"This paper explores the application of a new algebraic method of edge coloring, called complex coloring, to the scheduling problems of input queued switches. The proposed distributed parallel scheduling algorithm possesses two important features: optimality and rearrangeability. Optimality ensures that the algorithm always returns a proper coloring with the minimum number of required colors, and rearrangeability allows partially re-coloring the existing connection patterns if the underlying graph only changes slightly. The running time of the proposed scheduling algorithm is on the order of $O"},"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":"1606.07226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-06-23T08:43:07Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ce77bca357a7aa84c4b52d58a0336fd0ccca6040bfd7b099f39917c3b4ebf914","abstract_canon_sha256":"e637567a505cea60ce6d0a02337292e83bb6f693e64c229acac731fcb23c2196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:58.425189Z","signature_b64":"NeYl7uK9kPyL2CCX3tufFNIpXCosdTtW/7V7KoGigjX4uyV0wCM1oc3vu+Ew26QIxaJ41gIg0WiYCpIOMhWWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95a68ec99e1dff0a5767341714ce4464b26373a06cff4a5cf4dd46b4d819b74c","last_reissued_at":"2026-05-18T01:11:58.424850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:58.424850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Scheduling Algorithm based on Complex Coloring for Input-Queued Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Lingkang Wang, Tong Ye, Tony T. Lee, Weisheng Hu","submitted_at":"2016-06-23T08:43:07Z","abstract_excerpt":"This paper explores the application of a new algebraic method of edge coloring, called complex coloring, to the scheduling problems of input queued switches. The proposed distributed parallel scheduling algorithm possesses two important features: optimality and rearrangeability. Optimality ensures that the algorithm always returns a proper coloring with the minimum number of required colors, and rearrangeability allows partially re-coloring the existing connection patterns if the underlying graph only changes slightly. The running time of the proposed scheduling algorithm is on the order of $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07226","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.07226","created_at":"2026-05-18T01:11:58.424908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07226v1","created_at":"2026-05-18T01:11:58.424908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07226","created_at":"2026-05-18T01:11:58.424908+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWTI5SM6DX7Q","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWTI5SM6DX7QUV3H","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWTI5SM6","created_at":"2026-05-18T12:30:44.179134+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/SWTI5SM6DX7QUV3HGQLRJTSEMS","json":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS.json","graph_json":"https://pith.science/api/pith-number/SWTI5SM6DX7QUV3HGQLRJTSEMS/graph.json","events_json":"https://pith.science/api/pith-number/SWTI5SM6DX7QUV3HGQLRJTSEMS/events.json","paper":"https://pith.science/paper/SWTI5SM6"},"agent_actions":{"view_html":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS","download_json":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS.json","view_paper":"https://pith.science/paper/SWTI5SM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07226&json=true","fetch_graph":"https://pith.science/api/pith-number/SWTI5SM6DX7QUV3HGQLRJTSEMS/graph.json","fetch_events":"https://pith.science/api/pith-number/SWTI5SM6DX7QUV3HGQLRJTSEMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS/action/storage_attestation","attest_author":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS/action/author_attestation","sign_citation":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS/action/citation_signature","submit_replication":"https://pith.science/pith/SWTI5SM6DX7QUV3HGQLRJTSEMS/action/replication_record"}},"created_at":"2026-05-18T01:11:58.424908+00:00","updated_at":"2026-05-18T01:11:58.424908+00:00"}