{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BTZ24JYN3YGWGABOSHV2ERSLZA","short_pith_number":"pith:BTZ24JYN","canonical_record":{"source":{"id":"1202.5755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-26T12:53:15Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"58d22975c6afc20fffe4baea1e019ea685a37992243935258258c8ddc1e46dca","abstract_canon_sha256":"ca6734148ce5c860a9c3adbebe00bfff2c83125ee9105807088030e3e3adfb6e"},"schema_version":"1.0"},"canonical_sha256":"0cf3ae270dde0d63002e91eba2464bc8101a1a48d0c5c15b80d3a1b3f29d0f70","source":{"kind":"arxiv","id":"1202.5755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5755","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5755v2","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5755","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"pith_short_12","alias_value":"BTZ24JYN3YGW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTZ24JYN3YGWGABO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTZ24JYN","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BTZ24JYN3YGWGABOSHV2ERSLZA","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-26T12:53:15Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"58d22975c6afc20fffe4baea1e019ea685a37992243935258258c8ddc1e46dca","abstract_canon_sha256":"ca6734148ce5c860a9c3adbebe00bfff2c83125ee9105807088030e3e3adfb6e"},"schema_version":"1.0"},"canonical_sha256":"0cf3ae270dde0d63002e91eba2464bc8101a1a48d0c5c15b80d3a1b3f29d0f70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:08.794872Z","signature_b64":"wihRT6SgRhLTCBUHFi60NJFMRG8aLcnME2eir+iSjqC7R0hVM0LryimS7qjd/LEFWNMWZJsCYaMgDaughHO6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cf3ae270dde0d63002e91eba2464bc8101a1a48d0c5c15b80d3a1b3f29d0f70","last_reissued_at":"2026-05-18T03:14:08.794330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:08.794330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5755","source_version":2,"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-18T03:14:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELy2cctUj+L+RyozzkxNncV5eexVkuIYQ0AlU5H73IhHuJA03HIIUVSjdAf6YbmUraT1miFkE0vaYJrUYva9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:26:50.619207Z"},"content_sha256":"14320fa69623f7ce451d5ef5ad050fe422f654dcb7fa0acb31fb54a76e9ac81e","schema_version":"1.0","event_id":"sha256:14320fa69623f7ce451d5ef5ad050fe422f654dcb7fa0acb31fb54a76e9ac81e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BTZ24JYN3YGWGABOSHV2ERSLZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balancing Work and Size with Bounded Buffers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NI","authors_text":"Alejandro Lopez-Ortiz, Gabriel Scalosub, Kirill Kogan, Michael Segal, Sergey I. Nikolenko","submitted_at":"2012-02-26T12:53:15Z","abstract_excerpt":"We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processing before it can be transmitted from the queue buffer. The goal in such an environment is to maximize the overall size of packets that are successfully transmitted. This model is motivated by the ever-growing ubiquity of network processors architectures, which must deal with heterogeneously-sized traffic, with heterogeneous processing requirements. Our work addresses the tension between two conflicting algorithmic ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5755","kind":"arxiv","version":2},"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-18T03:14:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLfb9xj+vBeZZ4pRBL4V+Rle5rpVoQcpE+FNAgFhHbccFFx1SkalmosnpDchlUomAknIVIK/yVv5CpeIT+4tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:26:50.619862Z"},"content_sha256":"08491b157c196b58f16b4be98d9781b0c8a80dea9f84b9720c1ac4d02bcf691b","schema_version":"1.0","event_id":"sha256:08491b157c196b58f16b4be98d9781b0c8a80dea9f84b9720c1ac4d02bcf691b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTZ24JYN3YGWGABOSHV2ERSLZA/bundle.json","state_url":"https://pith.science/pith/BTZ24JYN3YGWGABOSHV2ERSLZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTZ24JYN3YGWGABOSHV2ERSLZA/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-31T11:26:50Z","links":{"resolver":"https://pith.science/pith/BTZ24JYN3YGWGABOSHV2ERSLZA","bundle":"https://pith.science/pith/BTZ24JYN3YGWGABOSHV2ERSLZA/bundle.json","state":"https://pith.science/pith/BTZ24JYN3YGWGABOSHV2ERSLZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTZ24JYN3YGWGABOSHV2ERSLZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BTZ24JYN3YGWGABOSHV2ERSLZA","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":"ca6734148ce5c860a9c3adbebe00bfff2c83125ee9105807088030e3e3adfb6e","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-26T12:53:15Z","title_canon_sha256":"58d22975c6afc20fffe4baea1e019ea685a37992243935258258c8ddc1e46dca"},"schema_version":"1.0","source":{"id":"1202.5755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5755","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5755v2","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5755","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"pith_short_12","alias_value":"BTZ24JYN3YGW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTZ24JYN3YGWGABO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTZ24JYN","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:08491b157c196b58f16b4be98d9781b0c8a80dea9f84b9720c1ac4d02bcf691b","target":"graph","created_at":"2026-05-18T03:14:08Z","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 the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processing before it can be transmitted from the queue buffer. The goal in such an environment is to maximize the overall size of packets that are successfully transmitted. This model is motivated by the ever-growing ubiquity of network processors architectures, which must deal with heterogeneously-sized traffic, with heterogeneous processing requirements. Our work addresses the tension between two conflicting algorithmic ap","authors_text":"Alejandro Lopez-Ortiz, Gabriel Scalosub, Kirill Kogan, Michael Segal, Sergey I. Nikolenko","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-26T12:53:15Z","title":"Balancing Work and Size with Bounded Buffers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5755","kind":"arxiv","version":2},"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:14320fa69623f7ce451d5ef5ad050fe422f654dcb7fa0acb31fb54a76e9ac81e","target":"record","created_at":"2026-05-18T03:14:08Z","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":"ca6734148ce5c860a9c3adbebe00bfff2c83125ee9105807088030e3e3adfb6e","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-02-26T12:53:15Z","title_canon_sha256":"58d22975c6afc20fffe4baea1e019ea685a37992243935258258c8ddc1e46dca"},"schema_version":"1.0","source":{"id":"1202.5755","kind":"arxiv","version":2}},"canonical_sha256":"0cf3ae270dde0d63002e91eba2464bc8101a1a48d0c5c15b80d3a1b3f29d0f70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cf3ae270dde0d63002e91eba2464bc8101a1a48d0c5c15b80d3a1b3f29d0f70","first_computed_at":"2026-05-18T03:14:08.794330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:08.794330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wihRT6SgRhLTCBUHFi60NJFMRG8aLcnME2eir+iSjqC7R0hVM0LryimS7qjd/LEFWNMWZJsCYaMgDaughHO6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:08.794872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14320fa69623f7ce451d5ef5ad050fe422f654dcb7fa0acb31fb54a76e9ac81e","sha256:08491b157c196b58f16b4be98d9781b0c8a80dea9f84b9720c1ac4d02bcf691b"],"state_sha256":"f906f30e7f95c516cf99531d12e381e1a7c0673d65e8adf99429616df38fb43a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irc9nJPn0nshwMgKesHouTiZDvFoirKuMDNfcfX5jfW4TRrHaVBfHi6ZDHCgzCBYdV+E5Dpk13DWURFke4+dAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:26:50.623184Z","bundle_sha256":"9b0d93fc2eed6537ea5871e9ffe074f60993b0f4894b41c3a79384097b035b08"}}