{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YJ3CTZK5ZI4EJCPPGTKZVAAQR4","short_pith_number":"pith:YJ3CTZK5","schema_version":"1.0","canonical_sha256":"c27629e55dca384489ef34d59a80108f36f6125e4b2017dd6bac3bae00530ed9","source":{"kind":"arxiv","id":"1007.1535","version":3},"attestation_state":"computed","paper":{"title":"An Optimal Lower Bound for Buffer Management in Multi-Queue Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Bienkowski","submitted_at":"2010-07-09T09:05:38Z","abstract_excerpt":"In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input ports and one output port. This device forwards unit-size, unit-value packets from input ports to the output port. Buffers attached to input ports may accumulate incoming packets for later transmission; if they cannot accommodate all incoming packets, their excess is lost. A packet buffering algorithm has to choose from which buffers to transmit packets in order to minimize the number of lost packets and thus maximize t"},"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":"1007.1535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-09T09:05:38Z","cross_cats_sorted":[],"title_canon_sha256":"10bb7d25894a4f435648b5f67a80a9f9cbf66e2534146a7af01a3b3158ffa596","abstract_canon_sha256":"3e553eb70f2563dffab327ee5e9d6ecfb3279f58ea51d430be182aa189fd4fc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:48.322110Z","signature_b64":"yWa15/9+fOIqGzFjBEoYTv8YxGHEgAnRNU1uCUgByr65GSGONWkL3Zoom6krXydN9yjFzZfz/XPDhVc7mzXyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c27629e55dca384489ef34d59a80108f36f6125e4b2017dd6bac3bae00530ed9","last_reissued_at":"2026-05-18T03:48:48.321531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:48.321531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Lower Bound for Buffer Management in Multi-Queue Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Bienkowski","submitted_at":"2010-07-09T09:05:38Z","abstract_excerpt":"In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input ports and one output port. This device forwards unit-size, unit-value packets from input ports to the output port. Buffers attached to input ports may accumulate incoming packets for later transmission; if they cannot accommodate all incoming packets, their excess is lost. A packet buffering algorithm has to choose from which buffers to transmit packets in order to minimize the number of lost packets and thus maximize t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1535","kind":"arxiv","version":3},"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":"1007.1535","created_at":"2026-05-18T03:48:48.321623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1535v3","created_at":"2026-05-18T03:48:48.321623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1535","created_at":"2026-05-18T03:48:48.321623+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJ3CTZK5ZI4E","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJ3CTZK5ZI4EJCPP","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJ3CTZK5","created_at":"2026-05-18T12:26:17.028572+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/YJ3CTZK5ZI4EJCPPGTKZVAAQR4","json":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4.json","graph_json":"https://pith.science/api/pith-number/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/graph.json","events_json":"https://pith.science/api/pith-number/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/events.json","paper":"https://pith.science/paper/YJ3CTZK5"},"agent_actions":{"view_html":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4","download_json":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4.json","view_paper":"https://pith.science/paper/YJ3CTZK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1535&json=true","fetch_graph":"https://pith.science/api/pith-number/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/graph.json","fetch_events":"https://pith.science/api/pith-number/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/action/storage_attestation","attest_author":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/action/author_attestation","sign_citation":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/action/citation_signature","submit_replication":"https://pith.science/pith/YJ3CTZK5ZI4EJCPPGTKZVAAQR4/action/replication_record"}},"created_at":"2026-05-18T03:48:48.321623+00:00","updated_at":"2026-05-18T03:48:48.321623+00:00"}