{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MRSUL7SHX5WQLJ7W6RUBHLHTR3","short_pith_number":"pith:MRSUL7SH","canonical_record":{"source":{"id":"1907.04399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-07-09T20:33:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2a5409b03dbf434cf4a85ef241e00153f81ac7e56664c1fa3904287aa2b880bc","abstract_canon_sha256":"c90f71c7d9da5c0150154d625f33def74498fcd7dd2ac2700a892e80b3c385f6"},"schema_version":"1.0"},"canonical_sha256":"646545fe47bf6d05a7f6f46813acf38edf8cc483c248380619de7c4d52b27eea","source":{"kind":"arxiv","id":"1907.04399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04399","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04399v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04399","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"MRSUL7SHX5WQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MRSUL7SHX5WQLJ7W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MRSUL7SH","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MRSUL7SHX5WQLJ7W6RUBHLHTR3","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-07-09T20:33:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2a5409b03dbf434cf4a85ef241e00153f81ac7e56664c1fa3904287aa2b880bc","abstract_canon_sha256":"c90f71c7d9da5c0150154d625f33def74498fcd7dd2ac2700a892e80b3c385f6"},"schema_version":"1.0"},"canonical_sha256":"646545fe47bf6d05a7f6f46813acf38edf8cc483c248380619de7c4d52b27eea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.866976Z","signature_b64":"UMgE8SDbZmDYhP5sKxqUPJp8oOEw39rDqAc2DQLyhprE6Xcg3a3GTJ5BmglUAkJKmCti++eeGnXZZUoqvct+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"646545fe47bf6d05a7f6f46813acf38edf8cc483c248380619de7c4d52b27eea","last_reissued_at":"2026-05-17T23:41:01.866213Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.866213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04399","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:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hgp2PHRbdO/4azzl6k8RDjtI2kjcbeTU095kDakkJaljkGR90r4JPLEOrSaHy02N1gxShrTtWrh/nmubBpeJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:54:51.051425Z"},"content_sha256":"cc0385b7ec691abe9704917070795eb79b46ee4ed788613718caa5aa4aaa7b13","schema_version":"1.0","event_id":"sha256:cc0385b7ec691abe9704917070795eb79b46ee4ed788613718caa5aa4aaa7b13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MRSUL7SHX5WQLJ7W6RUBHLHTR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Competitiveness Bounds for the Shared Memory Switch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Alex Davydow, Ivan Bochkov, Nikita Gaevoy, Sergey I. Nikolenko","submitted_at":"2019-07-09T20:33:39Z","abstract_excerpt":"We consider one of the simplest and best known buffer management architectures: the shared memory switch with multiple output queues and uniform packets. It was one of the first models studied by competitive analysis, with the Longest Queue Drop (LQD) buffer management policy shown to be at least $\\sqrt{2}$- and at most $2$-competitive; a general lower bound of $4/3$ has been proven for all deterministic online algorithms. Closing the gap between $\\sqrt{2}$ and $2$ has remained an open problem in competitive analysis for more than a decade, with only marginal success in reducing the upper boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04399","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:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9X10ttzOI3q1tOCODh6NWTAyOAoPxNnQXhIQU0r6Lb7Ix5w3wt9iypm6XZI/6VWe1E/XX0uzwqKH7APUt40DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:54:51.052101Z"},"content_sha256":"2876f6f5be9b856723b09bc31802e147c1b79927d795644b9b04df5acc61c378","schema_version":"1.0","event_id":"sha256:2876f6f5be9b856723b09bc31802e147c1b79927d795644b9b04df5acc61c378"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/bundle.json","state_url":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/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-05-25T22:54:51Z","links":{"resolver":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3","bundle":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/bundle.json","state":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MRSUL7SHX5WQLJ7W6RUBHLHTR3","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":"c90f71c7d9da5c0150154d625f33def74498fcd7dd2ac2700a892e80b3c385f6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-07-09T20:33:39Z","title_canon_sha256":"2a5409b03dbf434cf4a85ef241e00153f81ac7e56664c1fa3904287aa2b880bc"},"schema_version":"1.0","source":{"id":"1907.04399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04399","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04399v1","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04399","created_at":"2026-05-17T23:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"MRSUL7SHX5WQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MRSUL7SHX5WQLJ7W","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MRSUL7SH","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2876f6f5be9b856723b09bc31802e147c1b79927d795644b9b04df5acc61c378","target":"graph","created_at":"2026-05-17T23:41:01Z","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 one of the simplest and best known buffer management architectures: the shared memory switch with multiple output queues and uniform packets. It was one of the first models studied by competitive analysis, with the Longest Queue Drop (LQD) buffer management policy shown to be at least $\\sqrt{2}$- and at most $2$-competitive; a general lower bound of $4/3$ has been proven for all deterministic online algorithms. Closing the gap between $\\sqrt{2}$ and $2$ has remained an open problem in competitive analysis for more than a decade, with only marginal success in reducing the upper boun","authors_text":"Alex Davydow, Ivan Bochkov, Nikita Gaevoy, Sergey I. Nikolenko","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-07-09T20:33:39Z","title":"New Competitiveness Bounds for the Shared Memory Switch"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04399","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:cc0385b7ec691abe9704917070795eb79b46ee4ed788613718caa5aa4aaa7b13","target":"record","created_at":"2026-05-17T23:41:01Z","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":"c90f71c7d9da5c0150154d625f33def74498fcd7dd2ac2700a892e80b3c385f6","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-07-09T20:33:39Z","title_canon_sha256":"2a5409b03dbf434cf4a85ef241e00153f81ac7e56664c1fa3904287aa2b880bc"},"schema_version":"1.0","source":{"id":"1907.04399","kind":"arxiv","version":1}},"canonical_sha256":"646545fe47bf6d05a7f6f46813acf38edf8cc483c248380619de7c4d52b27eea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"646545fe47bf6d05a7f6f46813acf38edf8cc483c248380619de7c4d52b27eea","first_computed_at":"2026-05-17T23:41:01.866213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:01.866213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UMgE8SDbZmDYhP5sKxqUPJp8oOEw39rDqAc2DQLyhprE6Xcg3a3GTJ5BmglUAkJKmCti++eeGnXZZUoqvct+Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:01.866976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc0385b7ec691abe9704917070795eb79b46ee4ed788613718caa5aa4aaa7b13","sha256:2876f6f5be9b856723b09bc31802e147c1b79927d795644b9b04df5acc61c378"],"state_sha256":"0d5693bbf32777a46e8a1d3c75fcb3ab7e096e0832fd465bb3b7bf50f60f9076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCr3Vsecdi8Lbm6uGHSTdMj3edAB64WNC9ijLQ74g23XXTydMNxT3b4n2T6dlhdrHbkW0fW+/tKorbQzypXWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:54:51.055584Z","bundle_sha256":"4b7e418362636ed8b6531ade412d2a336c024b352f07a12878a8d42056bc0701"}}