{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SC3TYIWKGOWJNU2T2T7SHLS644","short_pith_number":"pith:SC3TYIWK","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"},"canonical_sha256":"90b73c22ca33ac96d353d4ff23ae5ee7027aa6944d583f048f51f7af6ff80efb","source":{"kind":"arxiv","id":"1109.6060","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6060","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6060v6","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6060","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"SC3TYIWKGOWJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SC3TYIWKGOWJNU2T","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SC3TYIWK","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SC3TYIWKGOWJNU2T2T7SHLS644","target":"record","payload":{"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"},"canonical_sha256":"90b73c22ca33ac96d353d4ff23ae5ee7027aa6944d583f048f51f7af6ff80efb","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"},"source_kind":"arxiv","source_id":"1109.6060","source_version":6,"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-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT/52EL7LjcPSm84iyr5V2UOyOQSzIDxleH/dQ3pgpVdnjbuceQY2pc0tSI5Kspge1ep0rVNqKkFRU3wE+kqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:47:15.202546Z"},"content_sha256":"b9ef27db93afcfed2e2fda9ea812ed31ac50a7441c6d495d7d93b676e6a47975","schema_version":"1.0","event_id":"sha256:b9ef27db93afcfed2e2fda9ea812ed31ac50a7441c6d495d7d93b676e6a47975"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SC3TYIWKGOWJNU2T2T7SHLS644","target":"graph","payload":{"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"},"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-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5P7fM/B/h/ZHqtvDU4O8bd+MbnhFwO2c9oCSiWzGOSKCu97GJQiHnhjH/Vy018GO87Kd/uvVO8+expEAfj9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:47:15.202936Z"},"content_sha256":"0497ae95fcedf977df416d85327fe86ba33c4d0b6ce7d68dbcb032d1880c32d1","schema_version":"1.0","event_id":"sha256:0497ae95fcedf977df416d85327fe86ba33c4d0b6ce7d68dbcb032d1880c32d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/bundle.json","state_url":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SC3TYIWKGOWJNU2T2T7SHLS644/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-20T04:47:15Z","links":{"resolver":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644","bundle":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/bundle.json","state":"https://pith.science/pith/SC3TYIWKGOWJNU2T2T7SHLS644/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SC3TYIWKGOWJNU2T2T7SHLS644/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SC3TYIWKGOWJNU2T2T7SHLS644","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":"b7927e82461d21a8b2845b61fad755bed7e0cf9b50f27b896a184a15a7f9a0ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-27T23:14:18Z","title_canon_sha256":"3beae574a7df73274ed6570f1bddbb5122719dc18beaa3ad8529ab710deb2b45"},"schema_version":"1.0","source":{"id":"1109.6060","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6060","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6060v6","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6060","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"SC3TYIWKGOWJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SC3TYIWKGOWJNU2T","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SC3TYIWK","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:0497ae95fcedf977df416d85327fe86ba33c4d0b6ce7d68dbcb032d1880c32d1","target":"graph","created_at":"2026-05-18T04:05:38Z","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":"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} ","authors_text":"Seiji Yoshimoto, Toshiya Itoh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-27T23:14:18Z","title":"Greedy Algorithms for Multi-Queue Buffer Management with Class Segregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6060","kind":"arxiv","version":6},"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:b9ef27db93afcfed2e2fda9ea812ed31ac50a7441c6d495d7d93b676e6a47975","target":"record","created_at":"2026-05-18T04:05:38Z","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":"b7927e82461d21a8b2845b61fad755bed7e0cf9b50f27b896a184a15a7f9a0ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-27T23:14:18Z","title_canon_sha256":"3beae574a7df73274ed6570f1bddbb5122719dc18beaa3ad8529ab710deb2b45"},"schema_version":"1.0","source":{"id":"1109.6060","kind":"arxiv","version":6}},"canonical_sha256":"90b73c22ca33ac96d353d4ff23ae5ee7027aa6944d583f048f51f7af6ff80efb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90b73c22ca33ac96d353d4ff23ae5ee7027aa6944d583f048f51f7af6ff80efb","first_computed_at":"2026-05-18T04:05:38.279924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:38.279924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tDSoAv5SnCpFLkUaP2WXDYD5WF3KnMQuEWI1xhWQyBqz1Z/HsBHWiP75EplnwvqqBvHglDUx40FmYXy9q3tFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:38.280287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6060","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9ef27db93afcfed2e2fda9ea812ed31ac50a7441c6d495d7d93b676e6a47975","sha256:0497ae95fcedf977df416d85327fe86ba33c4d0b6ce7d68dbcb032d1880c32d1"],"state_sha256":"98206fad4cf5fc351f43c8e1267548f590dee54ed16144428974d8ba825fcc17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INpYvTVQY8a+DCLBTurdRW/4Wt4axGmS9rIh67Q5CKcOuX9N6xdufzzC40smYEVwCizytQz+FJVTQA7pv8NZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:47:15.204908Z","bundle_sha256":"9d2c80568ae7189d5e86e6dfb7c9759033298271a8803da39ed7640425b8c07b"}}