{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E2DSGUWRBW22EBHBCCUPLFLZ7C","short_pith_number":"pith:E2DSGUWR","canonical_record":{"source":{"id":"1807.02184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-05T21:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"0ae52bb70bce697508ef9b2ec7bfd8dfff9c27da4085ffa6b60d0a516b2a03b4","abstract_canon_sha256":"8f4dc0fdb56b566c10f6efa7c5c4b265610ccd645b150ad99a7ffe2db297b735"},"schema_version":"1.0"},"canonical_sha256":"26872352d10db5a204e110a8f59579f8b27bb56bbbd2bc7043f19dd3db541930","source":{"kind":"arxiv","id":"1807.02184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02184","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02184v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02184","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"E2DSGUWRBW22","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2DSGUWRBW22EBHB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2DSGUWR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E2DSGUWRBW22EBHBCCUPLFLZ7C","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-05T21:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"0ae52bb70bce697508ef9b2ec7bfd8dfff9c27da4085ffa6b60d0a516b2a03b4","abstract_canon_sha256":"8f4dc0fdb56b566c10f6efa7c5c4b265610ccd645b150ad99a7ffe2db297b735"},"schema_version":"1.0"},"canonical_sha256":"26872352d10db5a204e110a8f59579f8b27bb56bbbd2bc7043f19dd3db541930","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:22.886426Z","signature_b64":"AexDgB4mOpQJVk48XndU/bG2cgKgBDcw6Tn8AyZjq0/TNfMD5JmvbZ0wgjQCKJSJc2FTYHsYUOLqur7gUmTaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26872352d10db5a204e110a8f59579f8b27bb56bbbd2bc7043f19dd3db541930","last_reissued_at":"2026-05-18T00:11:22.885681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:22.885681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02184","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-18T00:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ifxzf4n/3dcG/w3bOQZlzBBCboOcLOENSmohGWzAfTeKqjRxgU0jY6YgUuG+qXy1KwPr4EOBYGSwmzzRPpwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:24:31.047414Z"},"content_sha256":"087b1138a603adba0fddc87c0e90c1df1662905918dd340741135ec1291237a3","schema_version":"1.0","event_id":"sha256:087b1138a603adba0fddc87c0e90c1df1662905918dd340741135ec1291237a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E2DSGUWRBW22EBHBCCUPLFLZ7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slytherin: Dynamic, Network-assisted Prioritization of Tail Packets in Datacenter Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Balajee Vamanan, Hamed Rezaei, Mojtaba Malekpourshahraki","submitted_at":"2018-07-05T21:21:06Z","abstract_excerpt":"Datacenter applications demand both low latency and high throughput; while interactive applications (e.g., Web Search) demand low tail latency for their short messages due to their partition-aggregate software architecture, many data-intensive applications (e.g., Map-Reduce) require high throughput for long flows as they move vast amounts of data across the network. Recent proposals improve latency of short flows and throughput of long flows by addressing the shortcomings of existing packet scheduling and congestion control algorithms, respectively. We make the key observation that long tails "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02184","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-18T00:11:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUh8JbrS7kW8BUoKkrvL/ii0cwp9PM07om6TUFbbsifHGg2L6TyrpP2j92Q/cCiZbpFA7bOZHYhZ6KC69n9iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:24:31.047754Z"},"content_sha256":"1e81a6d558950e000422b58054d056aa2114f6142749b2eb867d98fee9b4ea8e","schema_version":"1.0","event_id":"sha256:1e81a6d558950e000422b58054d056aa2114f6142749b2eb867d98fee9b4ea8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C/bundle.json","state_url":"https://pith.science/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C/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-26T22:24:31Z","links":{"resolver":"https://pith.science/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C","bundle":"https://pith.science/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C/bundle.json","state":"https://pith.science/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2DSGUWRBW22EBHBCCUPLFLZ7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E2DSGUWRBW22EBHBCCUPLFLZ7C","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":"8f4dc0fdb56b566c10f6efa7c5c4b265610ccd645b150ad99a7ffe2db297b735","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-05T21:21:06Z","title_canon_sha256":"0ae52bb70bce697508ef9b2ec7bfd8dfff9c27da4085ffa6b60d0a516b2a03b4"},"schema_version":"1.0","source":{"id":"1807.02184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02184","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02184v1","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02184","created_at":"2026-05-18T00:11:22Z"},{"alias_kind":"pith_short_12","alias_value":"E2DSGUWRBW22","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2DSGUWRBW22EBHB","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2DSGUWR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:1e81a6d558950e000422b58054d056aa2114f6142749b2eb867d98fee9b4ea8e","target":"graph","created_at":"2026-05-18T00:11:22Z","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":"Datacenter applications demand both low latency and high throughput; while interactive applications (e.g., Web Search) demand low tail latency for their short messages due to their partition-aggregate software architecture, many data-intensive applications (e.g., Map-Reduce) require high throughput for long flows as they move vast amounts of data across the network. Recent proposals improve latency of short flows and throughput of long flows by addressing the shortcomings of existing packet scheduling and congestion control algorithms, respectively. We make the key observation that long tails ","authors_text":"Balajee Vamanan, Hamed Rezaei, Mojtaba Malekpourshahraki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-05T21:21:06Z","title":"Slytherin: Dynamic, Network-assisted Prioritization of Tail Packets in Datacenter Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02184","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:087b1138a603adba0fddc87c0e90c1df1662905918dd340741135ec1291237a3","target":"record","created_at":"2026-05-18T00:11:22Z","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":"8f4dc0fdb56b566c10f6efa7c5c4b265610ccd645b150ad99a7ffe2db297b735","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-05T21:21:06Z","title_canon_sha256":"0ae52bb70bce697508ef9b2ec7bfd8dfff9c27da4085ffa6b60d0a516b2a03b4"},"schema_version":"1.0","source":{"id":"1807.02184","kind":"arxiv","version":1}},"canonical_sha256":"26872352d10db5a204e110a8f59579f8b27bb56bbbd2bc7043f19dd3db541930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26872352d10db5a204e110a8f59579f8b27bb56bbbd2bc7043f19dd3db541930","first_computed_at":"2026-05-18T00:11:22.885681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:22.885681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AexDgB4mOpQJVk48XndU/bG2cgKgBDcw6Tn8AyZjq0/TNfMD5JmvbZ0wgjQCKJSJc2FTYHsYUOLqur7gUmTaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:22.886426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:087b1138a603adba0fddc87c0e90c1df1662905918dd340741135ec1291237a3","sha256:1e81a6d558950e000422b58054d056aa2114f6142749b2eb867d98fee9b4ea8e"],"state_sha256":"f82069e1f1751ccede2d02d67cee3a3893ce5b2330c53c5bd45a806000ab646d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MdRFJnxAO8wU5GC3DK+UERtyH+atyjbMJyhu0W5jGpM8j7L88+MDzbE4H6GitkD2jlmkH1Iz2+sARmwn4upBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T22:24:31.049612Z","bundle_sha256":"fe782a7c6f3f0ef46dd5c1947e419a2c23b60bb089413988c3bb79717408ff8c"}}