{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FTBP5EFUDZDO6H42ZM5OVRT7L2","short_pith_number":"pith:FTBP5EFU","schema_version":"1.0","canonical_sha256":"2cc2fe90b41e46ef1f9acb3aeac67f5ea201855b5f251e4c117f5c2be9a2389f","source":{"kind":"arxiv","id":"1707.03856","version":1},"attestation_state":"computed","paper":{"title":"Buffer Size for Routing Limited-Rate Adversarial Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Avery Miller, Boaz Patt-Shamir","submitted_at":"2017-07-12T18:31:52Z","abstract_excerpt":"We consider the slight variation of the adversarial queuing theory model, in which an adversary injects packets with routes into the network subject to the following constraint: For any link $e$, the total number of packets injected in any time window $[t,t')$ and whose route contains $e$, is at most $\\rho(t'-t)+\\sigma$, where $\\rho$ and $\\sigma$ are non-negative parameters. Informally, $\\rho$ bounds the long-term rate of injections and $\\sigma$ bounds the \"burstiness\" of injection: $\\sigma=0$ means that the injection is as smooth as it can be.\n  It is known that greedy scheduling of the packe"},"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":"1707.03856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-12T18:31:52Z","cross_cats_sorted":[],"title_canon_sha256":"8a81e33622ad5a9777912daa84187ef008a6dc6289d050a7a9485f4fb89871b4","abstract_canon_sha256":"04e8e4edb6ac53ac0d2ab23758d4a90a24f953ce493c0f0e91f747facf6a216c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:23.373798Z","signature_b64":"kQqNTMTLan8xGtWEEgIWHALoXoVxyVdDlFlPE5f82uCEUfo2H2CxgTF28FR/SpkGn+aAWd154U2iKjHjWP8xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc2fe90b41e46ef1f9acb3aeac67f5ea201855b5f251e4c117f5c2be9a2389f","last_reissued_at":"2026-05-18T00:40:23.373114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:23.373114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Buffer Size for Routing Limited-Rate Adversarial Traffic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Avery Miller, Boaz Patt-Shamir","submitted_at":"2017-07-12T18:31:52Z","abstract_excerpt":"We consider the slight variation of the adversarial queuing theory model, in which an adversary injects packets with routes into the network subject to the following constraint: For any link $e$, the total number of packets injected in any time window $[t,t')$ and whose route contains $e$, is at most $\\rho(t'-t)+\\sigma$, where $\\rho$ and $\\sigma$ are non-negative parameters. Informally, $\\rho$ bounds the long-term rate of injections and $\\sigma$ bounds the \"burstiness\" of injection: $\\sigma=0$ means that the injection is as smooth as it can be.\n  It is known that greedy scheduling of the packe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03856","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":"1707.03856","created_at":"2026-05-18T00:40:23.373212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03856v1","created_at":"2026-05-18T00:40:23.373212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03856","created_at":"2026-05-18T00:40:23.373212+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTBP5EFUDZDO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTBP5EFUDZDO6H42","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTBP5EFU","created_at":"2026-05-18T12:31:15.632608+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/FTBP5EFUDZDO6H42ZM5OVRT7L2","json":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2.json","graph_json":"https://pith.science/api/pith-number/FTBP5EFUDZDO6H42ZM5OVRT7L2/graph.json","events_json":"https://pith.science/api/pith-number/FTBP5EFUDZDO6H42ZM5OVRT7L2/events.json","paper":"https://pith.science/paper/FTBP5EFU"},"agent_actions":{"view_html":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2","download_json":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2.json","view_paper":"https://pith.science/paper/FTBP5EFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03856&json=true","fetch_graph":"https://pith.science/api/pith-number/FTBP5EFUDZDO6H42ZM5OVRT7L2/graph.json","fetch_events":"https://pith.science/api/pith-number/FTBP5EFUDZDO6H42ZM5OVRT7L2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2/action/storage_attestation","attest_author":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2/action/author_attestation","sign_citation":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2/action/citation_signature","submit_replication":"https://pith.science/pith/FTBP5EFUDZDO6H42ZM5OVRT7L2/action/replication_record"}},"created_at":"2026-05-18T00:40:23.373212+00:00","updated_at":"2026-05-18T00:40:23.373212+00:00"}