{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XY7TZUDOERAR6BMME5SMPDXH43","short_pith_number":"pith:XY7TZUDO","schema_version":"1.0","canonical_sha256":"be3f3cd06e24411f058c2764c78ee7e6ebdf41c864323c39986cc5478aaee220","source":{"kind":"arxiv","id":"1407.4498","version":2},"attestation_state":"computed","paper":{"title":"Online Packet-Routing in Grids with Bounded Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina","submitted_at":"2014-07-16T20:58:03Z","abstract_excerpt":"We present deterministic and randomized algorithms for the problem of online packet routing in grids in the competitive network throughput model \\cite{AKOR}. In this model the network has nodes with bounded buffers and bounded link capacities. The goal in this model is to maximize the throughput, i.e., the number of delivered packets.\n  Our deterministic algorithm is the first online algorithm with an $O\\left(\\log^{O(1)}(n)\\right)$ competitive ratio for uni-directional grids (where $n$ denotes the size of the network). The deterministic online algorithm is centralized and handles packets with "},"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":"1407.4498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T20:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"3bfa9d2c0617ad1520f3a8705c2c5f017bc7572ae6fc36633c3966b32046c88d","abstract_canon_sha256":"187214fb7c5ff4a7af381574cb9369fbe2e8a36d934e13c08d51e541c193ce95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:53.721117Z","signature_b64":"WI5oy9HdaUfd1oNigkq1GfDLRGfJ4GH4tQX+Z6EqFTqHPwbBDofkLur+jpdKfK3B3QG9/pHvlAcEXy1TiFyrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3f3cd06e24411f058c2764c78ee7e6ebdf41c864323c39986cc5478aaee220","last_reissued_at":"2026-05-18T02:43:53.720679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:53.720679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Packet-Routing in Grids with Bounded Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina","submitted_at":"2014-07-16T20:58:03Z","abstract_excerpt":"We present deterministic and randomized algorithms for the problem of online packet routing in grids in the competitive network throughput model \\cite{AKOR}. In this model the network has nodes with bounded buffers and bounded link capacities. The goal in this model is to maximize the throughput, i.e., the number of delivered packets.\n  Our deterministic algorithm is the first online algorithm with an $O\\left(\\log^{O(1)}(n)\\right)$ competitive ratio for uni-directional grids (where $n$ denotes the size of the network). The deterministic online algorithm is centralized and handles packets with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4498","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":"1407.4498","created_at":"2026-05-18T02:43:53.720736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4498v2","created_at":"2026-05-18T02:43:53.720736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4498","created_at":"2026-05-18T02:43:53.720736+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY7TZUDOERAR","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY7TZUDOERAR6BMM","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY7TZUDO","created_at":"2026-05-18T12:28:57.508820+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/XY7TZUDOERAR6BMME5SMPDXH43","json":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43.json","graph_json":"https://pith.science/api/pith-number/XY7TZUDOERAR6BMME5SMPDXH43/graph.json","events_json":"https://pith.science/api/pith-number/XY7TZUDOERAR6BMME5SMPDXH43/events.json","paper":"https://pith.science/paper/XY7TZUDO"},"agent_actions":{"view_html":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43","download_json":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43.json","view_paper":"https://pith.science/paper/XY7TZUDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4498&json=true","fetch_graph":"https://pith.science/api/pith-number/XY7TZUDOERAR6BMME5SMPDXH43/graph.json","fetch_events":"https://pith.science/api/pith-number/XY7TZUDOERAR6BMME5SMPDXH43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/action/storage_attestation","attest_author":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/action/author_attestation","sign_citation":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/action/citation_signature","submit_replication":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/action/replication_record"}},"created_at":"2026-05-18T02:43:53.720736+00:00","updated_at":"2026-05-18T02:43:53.720736+00:00"}