{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H4AXOSH7RZLSLLZFKQTDGC5KQJ","short_pith_number":"pith:H4AXOSH7","canonical_record":{"source":{"id":"1501.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T11:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"a8592ddb708b226b044cb13b409c58a415295b7248ed1e7c92406f27091b8f5b","abstract_canon_sha256":"be1d27a5d3a7fc803624243b870806f7f6f33cd3e35edd789a1167d66be5bab7"},"schema_version":"1.0"},"canonical_sha256":"3f017748ff8e5725af255426330baa825eced3d27e2c4533a01e7ece2fc307d6","source":{"kind":"arxiv","id":"1501.06140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06140","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06140v1","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06140","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"pith_short_12","alias_value":"H4AXOSH7RZLS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H4AXOSH7RZLSLLZF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H4AXOSH7","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H4AXOSH7RZLSLLZFKQTDGC5KQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T11:22:58Z","cross_cats_sorted":[],"title_canon_sha256":"a8592ddb708b226b044cb13b409c58a415295b7248ed1e7c92406f27091b8f5b","abstract_canon_sha256":"be1d27a5d3a7fc803624243b870806f7f6f33cd3e35edd789a1167d66be5bab7"},"schema_version":"1.0"},"canonical_sha256":"3f017748ff8e5725af255426330baa825eced3d27e2c4533a01e7ece2fc307d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:42.265643Z","signature_b64":"Fg5gZuNLfhvqgPPnJtEyPuTJDBFIeX63/mnytI7q4MNEYqjVpIQrRnVw4joUfIuhm4Vz4CsFRs/wMRzKBT7qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f017748ff8e5725af255426330baa825eced3d27e2c4533a01e7ece2fc307d6","last_reissued_at":"2026-05-18T02:28:42.264985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:42.264985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06140","source_version":1,"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:28:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cc4ia+ig65wLl247lHFMTqv+Inun9u50O42jA3vwypPe8Z6n81D+N8DMWXUrypzdAC5BlUnJ6iMPCWyG4sOECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:25:00.652191Z"},"content_sha256":"adf302b4379d4b5bc45e164aa341cc36016d64a336c11d5ad9908685f9324f91","schema_version":"1.0","event_id":"sha256:adf302b4379d4b5bc45e164aa341cc36016d64a336c11d5ad9908685f9324f91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H4AXOSH7RZLSLLZFKQTDGC5KQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Online Deterministic Packet Routing on Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boaz Patt-Shamir, Guy Even, Moti Medina","submitted_at":"2015-01-25T11:22:58Z","abstract_excerpt":"We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an $O\\left(\\log n\\right)$-competitive deterministic algorithm for an $n$-node line network (i.e., $1$-dimensional grid), requiring only that buffers can store at least $5$ packets, and that links can deliver "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06140","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"},"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:28:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4FtH+3aU+DRfZuQEIYf+/LnY1ETLCgIaqSBGH/xBVCKSzF8k3OTHSerl0qFWUUs+Gh/hIkurkem2vsSYoKZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:25:00.652550Z"},"content_sha256":"598a0d4208074c86935f8a46dd03b11cd1518670fb1acc35b19fb9340ce7ad5d","schema_version":"1.0","event_id":"sha256:598a0d4208074c86935f8a46dd03b11cd1518670fb1acc35b19fb9340ce7ad5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ/bundle.json","state_url":"https://pith.science/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ/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-03T07:25:00Z","links":{"resolver":"https://pith.science/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ","bundle":"https://pith.science/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ/bundle.json","state":"https://pith.science/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4AXOSH7RZLSLLZFKQTDGC5KQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H4AXOSH7RZLSLLZFKQTDGC5KQJ","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":"be1d27a5d3a7fc803624243b870806f7f6f33cd3e35edd789a1167d66be5bab7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T11:22:58Z","title_canon_sha256":"a8592ddb708b226b044cb13b409c58a415295b7248ed1e7c92406f27091b8f5b"},"schema_version":"1.0","source":{"id":"1501.06140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06140","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06140v1","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06140","created_at":"2026-05-18T02:28:42Z"},{"alias_kind":"pith_short_12","alias_value":"H4AXOSH7RZLS","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H4AXOSH7RZLSLLZF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H4AXOSH7","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:598a0d4208074c86935f8a46dd03b11cd1518670fb1acc35b19fb9340ce7ad5d","target":"graph","created_at":"2026-05-18T02:28:42Z","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 consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an $O\\left(\\log n\\right)$-competitive deterministic algorithm for an $n$-node line network (i.e., $1$-dimensional grid), requiring only that buffers can store at least $5$ packets, and that links can deliver ","authors_text":"Boaz Patt-Shamir, Guy Even, Moti Medina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T11:22:58Z","title":"Better Online Deterministic Packet Routing on Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06140","kind":"arxiv","version":1},"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:adf302b4379d4b5bc45e164aa341cc36016d64a336c11d5ad9908685f9324f91","target":"record","created_at":"2026-05-18T02:28:42Z","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":"be1d27a5d3a7fc803624243b870806f7f6f33cd3e35edd789a1167d66be5bab7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-25T11:22:58Z","title_canon_sha256":"a8592ddb708b226b044cb13b409c58a415295b7248ed1e7c92406f27091b8f5b"},"schema_version":"1.0","source":{"id":"1501.06140","kind":"arxiv","version":1}},"canonical_sha256":"3f017748ff8e5725af255426330baa825eced3d27e2c4533a01e7ece2fc307d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f017748ff8e5725af255426330baa825eced3d27e2c4533a01e7ece2fc307d6","first_computed_at":"2026-05-18T02:28:42.264985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:42.264985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fg5gZuNLfhvqgPPnJtEyPuTJDBFIeX63/mnytI7q4MNEYqjVpIQrRnVw4joUfIuhm4Vz4CsFRs/wMRzKBT7qDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:42.265643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adf302b4379d4b5bc45e164aa341cc36016d64a336c11d5ad9908685f9324f91","sha256:598a0d4208074c86935f8a46dd03b11cd1518670fb1acc35b19fb9340ce7ad5d"],"state_sha256":"dbb1f3ae4da7b6f78fd8aa4726ac2bcbc6a929f2d2d554732eb304acbaf6edb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qwW607z2pIFRv1SZosMjr99rpXPtedKCAdRUchWUuokAvwl0iPj1jZvqljGuvrOuJRZN0Tbm9P1ldhYFeYCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:25:00.654522Z","bundle_sha256":"b11148b483c09dc823b6acc0bc5b8ecc0a45fffd7ab00fad1ee20dad01fc70b8"}}