{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DT4V5I2FFQDLFYQHWY676LYEL2","short_pith_number":"pith:DT4V5I2F","canonical_record":{"source":{"id":"1902.08069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T14:31:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"50496ba472b36fd661ae869de06556da36cceeaf68a047d1f963bef52eb1beb0","abstract_canon_sha256":"86e8f0cf238d05eb9a325e45e335af6e045ca0f77e90415dbbd31bb0f0263c4a"},"schema_version":"1.0"},"canonical_sha256":"1cf95ea3452c06b2e207b63dff2f045e99715255a7bf941a4ae4b1af3ab30083","source":{"kind":"arxiv","id":"1902.08069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08069","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08069v1","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08069","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"DT4V5I2FFQDL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DT4V5I2FFQDLFYQH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DT4V5I2F","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DT4V5I2FFQDLFYQHWY676LYEL2","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T14:31:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"50496ba472b36fd661ae869de06556da36cceeaf68a047d1f963bef52eb1beb0","abstract_canon_sha256":"86e8f0cf238d05eb9a325e45e335af6e045ca0f77e90415dbbd31bb0f0263c4a"},"schema_version":"1.0"},"canonical_sha256":"1cf95ea3452c06b2e207b63dff2f045e99715255a7bf941a4ae4b1af3ab30083","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:02.186877Z","signature_b64":"VCk0AteHJN0ejqvD6DrXiPAmuosBbrOyCJs03vGmnkMDXyxou1ByNOQHSAHc9ffo4GqoQAFRAFuV/cFVCIQcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf95ea3452c06b2e207b63dff2f045e99715255a7bf941a4ae4b1af3ab30083","last_reissued_at":"2026-05-17T23:53:02.186206Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:02.186206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08069","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-17T23:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MViiMs6z6KpjS3lfYwOnDmtCPGKKkKn40BYojIwbjzAYTRjfBj24WppGc8z6ogIqldoj9xwKHA5Ma46hkIFyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:58:20.108541Z"},"content_sha256":"b76e967102d8462e844c37e54695c12def837f37539050b70361ffbece3b5406","schema_version":"1.0","event_id":"sha256:b76e967102d8462e844c37e54695c12def837f37539050b70361ffbece3b5406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DT4V5I2FFQDLFYQHWY676LYEL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Avery Miller, Boaz Patt-Shamir, Will Rosenbaum","submitted_at":"2019-02-21T14:31:25Z","abstract_excerpt":"We consider the Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate $0\\le\\rho\\le1$ and burstiness $\\sigma\\ge0$. In this model, we analyze the size of buffers required to avoid overflows in the basic case of a path. Our main results characterize the space required by the average rate and the number of distinct destinations: we show that $O(k d^{1/k})$ space suffice, where $d$ is the number of distinct destinations and $k=\\lfloor 1/\\rho \\rfloor$; and we show that $\\Omega(\\frac 1 k d^{1/k})$ space is necessary. For directed trees, we describe an alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08069","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-17T23:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pa53auxMy9THOdzLUxZzVyQGMXMUywhtEdJXbZ8NbmRJpS75lRBE8V2xw7KaR6BJ1hh/4EHhwvdGADTpmN0YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:58:20.108917Z"},"content_sha256":"77b3d1394216312f57250334526cf3c61b45752ccdd7b93664011801975e67f7","schema_version":"1.0","event_id":"sha256:77b3d1394216312f57250334526cf3c61b45752ccdd7b93664011801975e67f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DT4V5I2FFQDLFYQHWY676LYEL2/bundle.json","state_url":"https://pith.science/pith/DT4V5I2FFQDLFYQHWY676LYEL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DT4V5I2FFQDLFYQHWY676LYEL2/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-12T07:58:20Z","links":{"resolver":"https://pith.science/pith/DT4V5I2FFQDLFYQHWY676LYEL2","bundle":"https://pith.science/pith/DT4V5I2FFQDLFYQHWY676LYEL2/bundle.json","state":"https://pith.science/pith/DT4V5I2FFQDLFYQHWY676LYEL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DT4V5I2FFQDLFYQHWY676LYEL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DT4V5I2FFQDLFYQHWY676LYEL2","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":"86e8f0cf238d05eb9a325e45e335af6e045ca0f77e90415dbbd31bb0f0263c4a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T14:31:25Z","title_canon_sha256":"50496ba472b36fd661ae869de06556da36cceeaf68a047d1f963bef52eb1beb0"},"schema_version":"1.0","source":{"id":"1902.08069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08069","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08069v1","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08069","created_at":"2026-05-17T23:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"DT4V5I2FFQDL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DT4V5I2FFQDLFYQH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DT4V5I2F","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:77b3d1394216312f57250334526cf3c61b45752ccdd7b93664011801975e67f7","target":"graph","created_at":"2026-05-17T23:53:02Z","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 Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate $0\\le\\rho\\le1$ and burstiness $\\sigma\\ge0$. In this model, we analyze the size of buffers required to avoid overflows in the basic case of a path. Our main results characterize the space required by the average rate and the number of distinct destinations: we show that $O(k d^{1/k})$ space suffice, where $d$ is the number of distinct destinations and $k=\\lfloor 1/\\rho \\rfloor$; and we show that $\\Omega(\\frac 1 k d^{1/k})$ space is necessary. For directed trees, we describe an alg","authors_text":"Avery Miller, Boaz Patt-Shamir, Will Rosenbaum","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T14:31:25Z","title":"With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08069","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:b76e967102d8462e844c37e54695c12def837f37539050b70361ffbece3b5406","target":"record","created_at":"2026-05-17T23:53:02Z","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":"86e8f0cf238d05eb9a325e45e335af6e045ca0f77e90415dbbd31bb0f0263c4a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-21T14:31:25Z","title_canon_sha256":"50496ba472b36fd661ae869de06556da36cceeaf68a047d1f963bef52eb1beb0"},"schema_version":"1.0","source":{"id":"1902.08069","kind":"arxiv","version":1}},"canonical_sha256":"1cf95ea3452c06b2e207b63dff2f045e99715255a7bf941a4ae4b1af3ab30083","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cf95ea3452c06b2e207b63dff2f045e99715255a7bf941a4ae4b1af3ab30083","first_computed_at":"2026-05-17T23:53:02.186206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:02.186206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCk0AteHJN0ejqvD6DrXiPAmuosBbrOyCJs03vGmnkMDXyxou1ByNOQHSAHc9ffo4GqoQAFRAFuV/cFVCIQcCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:02.186877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76e967102d8462e844c37e54695c12def837f37539050b70361ffbece3b5406","sha256:77b3d1394216312f57250334526cf3c61b45752ccdd7b93664011801975e67f7"],"state_sha256":"1c0bfd9a06a7c7a80d88abab90ef5c60a95e4d51636b84004903800ad3363506"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AX0jK39V9P7Efd1ZCnn+0Z+4gxZmRpGXM/IdTgRcuKq+4Xeh0SFk5bEdLQhulPO0UBoCSnC/nXbND/dwPhA3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T07:58:20.111411Z","bundle_sha256":"b0172bb0bd34df6f80267cdfc8817a5af1020c7db75a514c4dc97612d7e22c6e"}}