{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SC3TYIWKGOWJNU2T2T7SHLS644","short_pith_number":"pith:SC3TYIWK","schema_version":"1.0","canonical_sha256":"90b73c22ca33ac96d353d4ff23ae5ee7027aa6944d583f048f51f7af6ff80efb","source":{"kind":"arxiv","id":"1109.6060","version":6},"attestation_state":"computed","paper":{"title":"Greedy Algorithms for Multi-Queue Buffer Management with Class Segregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Seiji Yoshimoto, Toshiya Itoh","submitted_at":"2011-09-27T23:14:18Z","abstract_excerpt":"In this paper, we focus on a multi-queue buffer management in which packets of different values are segregated in different queues. Our model consists of m packets values and m queues. Recently, Al-Bawani and Souza (arXiv:1103.6049v2 [cs.DS] 30 Mar 2011) presented an online multi-queue buffer management algorithm Greedy and showed that it is 2-competitive for the general m-valued case, i.e., m packet values are 0 < v_{1} < v_{2} < ... < v_{m}, and (1+v_{1}/v_{2})-competitive for the two-valued case, i.e., two packet values are 0 < v_{1} < v_{2}. For the general m-valued case, let c_i = (v_{i} "},"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":"1109.6060","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-27T23:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"3beae574a7df73274ed6570f1bddbb5122719dc18beaa3ad8529ab710deb2b45","abstract_canon_sha256":"b7927e82461d21a8b2845b61fad755bed7e0cf9b50f27b896a184a15a7f9a0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:38.280287Z","signature_b64":"tDSoAv5SnCpFLkUaP2WXDYD5WF3KnMQuEWI1xhWQyBqz1Z/HsBHWiP75EplnwvqqBvHglDUx40FmYXy9q3tFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b73c22ca33ac96d353d4ff23ae5ee7027aa6944d583f048f51f7af6ff80efb","last_reissued_at":"2026-05-18T04:05:38.279924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:38.279924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Algorithms for Multi-Queue Buffer Management with Class Segregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Seiji Yoshimoto, Toshiya Itoh","submitted_at":"2011-09-27T23:14:18Z","abstract_excerpt":"In this paper, we focus on a multi-queue buffer management in which packets of different values are segregated in different queues. Our model consists of m packets values and m queues. Recently, Al-Bawani and Souza (arXiv:1103.6049v2 [cs.DS] 30 Mar 2011) presented an online multi-queue buffer management algorithm Greedy and showed that it is 2-competitive for the general m-valued case, i.e., m packet values are 0 < v_{1} < v_{2} < ... < v_{m}, and (1+v_{1}/v_{2})-competitive for the two-valued case, i.e., two packet values are 0 < v_{1} < v_{2}. For the general m-valued case, let c_i = (v_{i} "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6060","kind":"arxiv","version":6},"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":"1109.6060","created_at":"2026-05-18T04:05:38.279979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6060v6","created_at":"2026-05-18T04:05:38.279979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6060","created_at":"2026-05-18T04:05:38.279979+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC3TYIWKGOWJ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC3TYIWKGOWJNU2T","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC3TYIWK","created_at":"2026-05-18T12:26:41.206345+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/SC3TYIWKGOWJNU2T2T7SHLS644","json":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644.json","graph_json":"https://pith.science/api/pith-number/SC3TYIWKGOWJNU2T2T7SHLS644/graph.json","events_json":"https://pith.science/api/pith-number/SC3TYIWKGOWJNU2T2T7SHLS644/events.json","paper":"https://pith.science/paper/SC3TYIWK"},"agent_actions":{"view_html":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644","download_json":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644.json","view_paper":"https://pith.science/paper/SC3TYIWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6060&json=true","fetch_graph":"https://pith.science/api/pith-number/SC3TYIWKGOWJNU2T2T7SHLS644/graph.json","fetch_events":"https://pith.science/api/pith-number/SC3TYIWKGOWJNU2T2T7SHLS644/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/action/storage_attestation","attest_author":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/action/author_attestation","sign_citation":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/action/citation_signature","submit_replication":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/action/replication_record"}},"created_at":"2026-05-18T04:05:38.279979+00:00","updated_at":"2026-05-18T04:05:38.279979+00:00"}