{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XY7TZUDOERAR6BMME5SMPDXH43","short_pith_number":"pith:XY7TZUDO","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"},"canonical_sha256":"be3f3cd06e24411f058c2764c78ee7e6ebdf41c864323c39986cc5478aaee220","source":{"kind":"arxiv","id":"1407.4498","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4498","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4498v2","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4498","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"XY7TZUDOERAR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XY7TZUDOERAR6BMM","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XY7TZUDO","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XY7TZUDOERAR6BMME5SMPDXH43","target":"record","payload":{"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"},"canonical_sha256":"be3f3cd06e24411f058c2764c78ee7e6ebdf41c864323c39986cc5478aaee220","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"},"source_kind":"arxiv","source_id":"1407.4498","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cG2hhuJ8vkIL4P61gyJxQVleAkrgVwz9xl3GCSJOqTY6WtAK7MKoVLy2K0tJkHlYoVGbdsdsOfI2htG8LZ7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:12:54.101077Z"},"content_sha256":"4655f4c02aa84ff44bbda0c1c7ba6cbd5c4eb40f61d022e56b763955c09cf813","schema_version":"1.0","event_id":"sha256:4655f4c02aa84ff44bbda0c1c7ba6cbd5c4eb40f61d022e56b763955c09cf813"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XY7TZUDOERAR6BMME5SMPDXH43","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMyxfM350W01IuURLlK2pAowJ6AdEgCF7zW4NMRCAjJcX8R3Z+ePrP9Jy0/jdJkaHItLV3vSGP+NTe752ynvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:12:54.101838Z"},"content_sha256":"495d5416e4033d436434ba58cbe6a35d051d53c636e95376b86e57abbffb0262","schema_version":"1.0","event_id":"sha256:495d5416e4033d436434ba58cbe6a35d051d53c636e95376b86e57abbffb0262"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/bundle.json","state_url":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XY7TZUDOERAR6BMME5SMPDXH43/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T01:12:54Z","links":{"resolver":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43","bundle":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/bundle.json","state":"https://pith.science/pith/XY7TZUDOERAR6BMME5SMPDXH43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XY7TZUDOERAR6BMME5SMPDXH43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XY7TZUDOERAR6BMME5SMPDXH43","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"187214fb7c5ff4a7af381574cb9369fbe2e8a36d934e13c08d51e541c193ce95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T20:58:03Z","title_canon_sha256":"3bfa9d2c0617ad1520f3a8705c2c5f017bc7572ae6fc36633c3966b32046c88d"},"schema_version":"1.0","source":{"id":"1407.4498","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4498","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4498v2","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4498","created_at":"2026-05-18T02:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"XY7TZUDOERAR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XY7TZUDOERAR6BMM","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XY7TZUDO","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:495d5416e4033d436434ba58cbe6a35d051d53c636e95376b86e57abbffb0262","target":"graph","created_at":"2026-05-18T02:43:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Guy Even, Moti Medina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T20:58:03Z","title":"Online Packet-Routing in Grids with Bounded Buffers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4498","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4655f4c02aa84ff44bbda0c1c7ba6cbd5c4eb40f61d022e56b763955c09cf813","target":"record","created_at":"2026-05-18T02:43:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"187214fb7c5ff4a7af381574cb9369fbe2e8a36d934e13c08d51e541c193ce95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T20:58:03Z","title_canon_sha256":"3bfa9d2c0617ad1520f3a8705c2c5f017bc7572ae6fc36633c3966b32046c88d"},"schema_version":"1.0","source":{"id":"1407.4498","kind":"arxiv","version":2}},"canonical_sha256":"be3f3cd06e24411f058c2764c78ee7e6ebdf41c864323c39986cc5478aaee220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3f3cd06e24411f058c2764c78ee7e6ebdf41c864323c39986cc5478aaee220","first_computed_at":"2026-05-18T02:43:53.720679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:53.720679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WI5oy9HdaUfd1oNigkq1GfDLRGfJ4GH4tQX+Z6EqFTqHPwbBDofkLur+jpdKfK3B3QG9/pHvlAcEXy1TiFyrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:53.721117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4498","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4655f4c02aa84ff44bbda0c1c7ba6cbd5c4eb40f61d022e56b763955c09cf813","sha256:495d5416e4033d436434ba58cbe6a35d051d53c636e95376b86e57abbffb0262"],"state_sha256":"5b345c8420aab1c54e476bad6b59819c6067817aab1aa1a2558bdeda4ca855a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KW3jsS/aujX+CBPCXpsZsXn0CeOS+DLwDJMTfdAg0nFiCCnVJ7424Hjy+5Sm37EB8VMK7rAuWVLgAimHy0rFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:12:54.105936Z","bundle_sha256":"491f2c9328a33ce0866638edf68e6122f282530538e9ab4fe1c3abb062303294"}}