{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MRSUL7SHX5WQLJ7W6RUBHLHTR3","short_pith_number":"pith:MRSUL7SH","schema_version":"1.0","canonical_sha256":"646545fe47bf6d05a7f6f46813acf38edf8cc483c248380619de7c4d52b27eea","source":{"kind":"arxiv","id":"1907.04399","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.04399","created_at":"2026-05-17T23:41:01.866311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04399v1","created_at":"2026-05-17T23:41:01.866311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04399","created_at":"2026-05-17T23:41:01.866311+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRSUL7SHX5WQ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRSUL7SHX5WQLJ7W","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRSUL7SH","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3","json":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3.json","graph_json":"https://pith.science/api/pith-number/MRSUL7SHX5WQLJ7W6RUBHLHTR3/graph.json","events_json":"https://pith.science/api/pith-number/MRSUL7SHX5WQLJ7W6RUBHLHTR3/events.json","paper":"https://pith.science/paper/MRSUL7SH"},"agent_actions":{"view_html":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3","download_json":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3.json","view_paper":"https://pith.science/paper/MRSUL7SH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04399&json=true","fetch_graph":"https://pith.science/api/pith-number/MRSUL7SHX5WQLJ7W6RUBHLHTR3/graph.json","fetch_events":"https://pith.science/api/pith-number/MRSUL7SHX5WQLJ7W6RUBHLHTR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/action/storage_attestation","attest_author":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/action/author_attestation","sign_citation":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/action/citation_signature","submit_replication":"https://pith.science/pith/MRSUL7SHX5WQLJ7W6RUBHLHTR3/action/replication_record"}},"created_at":"2026-05-17T23:41:01.866311+00:00","updated_at":"2026-05-17T23:41:01.866311+00:00"}