{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RG5L2USGWQ3TYBACQMKCWGI2MF","short_pith_number":"pith:RG5L2USG","schema_version":"1.0","canonical_sha256":"89babd5246b4373c040283142b191a615796a80ffebb41e247df28901f1022b9","source":{"kind":"arxiv","id":"1905.08478","version":2},"attestation_state":"computed","paper":{"title":"TSN Algorithms for Large Scale Networks: A Survey and Conceptual Comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed Nasrallah, Akhilesh Thyagaturu, Hesham ElBakoury, Martin Reisslein, Venkatraman Balasubramanian","submitted_at":"2019-05-21T08:11:54Z","abstract_excerpt":"This paper provides a comprehensive survey of queueing and scheduling mechanisms for supporting large scale deterministic networks (LDNs). The survey finds that extensive mechanism design research and standards development for LDNs has been conducted over the past few years. However, these mechanism design studies have not been followed up with a comprehensive rigorous evaluation. The main outcome of this survey is a clear organization of the various research and standardization efforts towards queueing and scheduling mechanisms for LDNs as well as the identification of the main strands of mec"},"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":"1905.08478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-21T08:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"22ae8d8401e03476119e6fd41794fef20dd12d70e6493ca8fc58fe2d63f75593","abstract_canon_sha256":"78a3a20909f582c88e4acb693faa9efc0f153ba53a0f3f423ba87dd56a28526d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:58.180717Z","signature_b64":"YLC6BARBy5mkzNT5MsLMyJGI+KVmOwgfWnEaxN6UOzT16esiwEeO04ji91DEhIFkdDwgm9XoqjXGxhR39WbPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89babd5246b4373c040283142b191a615796a80ffebb41e247df28901f1022b9","last_reissued_at":"2026-05-17T23:42:58.180128Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:58.180128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TSN Algorithms for Large Scale Networks: A Survey and Conceptual Comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmed Nasrallah, Akhilesh Thyagaturu, Hesham ElBakoury, Martin Reisslein, Venkatraman Balasubramanian","submitted_at":"2019-05-21T08:11:54Z","abstract_excerpt":"This paper provides a comprehensive survey of queueing and scheduling mechanisms for supporting large scale deterministic networks (LDNs). The survey finds that extensive mechanism design research and standards development for LDNs has been conducted over the past few years. However, these mechanism design studies have not been followed up with a comprehensive rigorous evaluation. The main outcome of this survey is a clear organization of the various research and standardization efforts towards queueing and scheduling mechanisms for LDNs as well as the identification of the main strands of mec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08478","kind":"arxiv","version":2},"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":"1905.08478","created_at":"2026-05-17T23:42:58.180240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08478v2","created_at":"2026-05-17T23:42:58.180240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08478","created_at":"2026-05-17T23:42:58.180240+00:00"},{"alias_kind":"pith_short_12","alias_value":"RG5L2USGWQ3T","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RG5L2USGWQ3TYBAC","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RG5L2USG","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11596","citing_title":"Reconfiguration Algorithms for High Precision Communications in Time Sensitive Networks: Time-Aware Shaper Configuration with IEEE 802.1Qcc (Extended Version)","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF","json":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF.json","graph_json":"https://pith.science/api/pith-number/RG5L2USGWQ3TYBACQMKCWGI2MF/graph.json","events_json":"https://pith.science/api/pith-number/RG5L2USGWQ3TYBACQMKCWGI2MF/events.json","paper":"https://pith.science/paper/RG5L2USG"},"agent_actions":{"view_html":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF","download_json":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF.json","view_paper":"https://pith.science/paper/RG5L2USG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08478&json=true","fetch_graph":"https://pith.science/api/pith-number/RG5L2USGWQ3TYBACQMKCWGI2MF/graph.json","fetch_events":"https://pith.science/api/pith-number/RG5L2USGWQ3TYBACQMKCWGI2MF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF/action/storage_attestation","attest_author":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF/action/author_attestation","sign_citation":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF/action/citation_signature","submit_replication":"https://pith.science/pith/RG5L2USGWQ3TYBACQMKCWGI2MF/action/replication_record"}},"created_at":"2026-05-17T23:42:58.180240+00:00","updated_at":"2026-05-17T23:42:58.180240+00:00"}