{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:53CBOXVZPIQXHFJNUNCLSWCTHH","short_pith_number":"pith:53CBOXVZ","canonical_record":{"source":{"id":"1309.4919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T10:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"5fa42e34c63bd73ed1907d07618dbdc8bcce131101f4aa36e65eb4046d3bab43","abstract_canon_sha256":"c2d0b0dc4c686aa027145b04395cb45a03e83e0864b28bed9d49b9e0a91b3e92"},"schema_version":"1.0"},"canonical_sha256":"eec4175eb97a2173952da344b9585339e9e3ca4a4166692aa21b88e1b18bab03","source":{"kind":"arxiv","id":"1309.4919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4919","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4919v2","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4919","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"53CBOXVZPIQX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"53CBOXVZPIQXHFJN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"53CBOXVZ","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:53CBOXVZPIQXHFJNUNCLSWCTHH","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T10:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"5fa42e34c63bd73ed1907d07618dbdc8bcce131101f4aa36e65eb4046d3bab43","abstract_canon_sha256":"c2d0b0dc4c686aa027145b04395cb45a03e83e0864b28bed9d49b9e0a91b3e92"},"schema_version":"1.0"},"canonical_sha256":"eec4175eb97a2173952da344b9585339e9e3ca4a4166692aa21b88e1b18bab03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:47.835671Z","signature_b64":"wwFc0IYtlDXeI+MYT3VAgHCjCQOUNU45/CGI2CAwOikOc4VnmkPdswSo2FZ8XtR3zL2sIiQbiGzl5rT4/lJHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eec4175eb97a2173952da344b9585339e9e3ca4a4166692aa21b88e1b18bab03","last_reissued_at":"2026-05-18T03:12:47.834915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:47.834915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4919","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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPDRN0bUtUMjXTyw2/VJp7zjFYkELdEAcCVHmUN9xZ0mt0pNCZV9S/hi4MWV9/xGwzkYD2XcKiux752B493+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:19:23.835823Z"},"content_sha256":"92d74a0be470de363a9a79117b4b25928ee78e05d6c823d9f4e8da491cf5ae7e","schema_version":"1.0","event_id":"sha256:92d74a0be470de363a9a79117b4b25928ee78e05d6c823d9f4e8da491cf5ae7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:53CBOXVZPIQXHFJNUNCLSWCTHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki","submitted_at":"2013-09-19T10:26:22Z","abstract_excerpt":"We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maximization problem ($k$-FTM). This problem models the situation where a large frame is fragmented into $k$ packets and transmitted through the Internet, and the receiver can reconstruct the frame only if he/she accepts all the $k$ packets. Kesselman et al.\\ introduced this problem and showed that its competitive ratio is unbounded even when $k=2$. They also introduced an \"order-respecting\" variant of $k$-FTM, called $k$-OFTM, where inputs are restricted in some natural way. They"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4919","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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wYuB1yeZcgk7QNlDYb4LgKYrtgLZ9UmzJlHCdyUDf4M+MqHN4ypmeKhCz5wxx9oe1y5JdViTUkmnhpzaYWTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:19:23.836175Z"},"content_sha256":"e42acd93a5514b2ee064d89d03435f76599d1588cd371552c42df84d84150c59","schema_version":"1.0","event_id":"sha256:e42acd93a5514b2ee064d89d03435f76599d1588cd371552c42df84d84150c59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/bundle.json","state_url":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/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-01T23:19:23Z","links":{"resolver":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH","bundle":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/bundle.json","state":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:53CBOXVZPIQXHFJNUNCLSWCTHH","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":"c2d0b0dc4c686aa027145b04395cb45a03e83e0864b28bed9d49b9e0a91b3e92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T10:26:22Z","title_canon_sha256":"5fa42e34c63bd73ed1907d07618dbdc8bcce131101f4aa36e65eb4046d3bab43"},"schema_version":"1.0","source":{"id":"1309.4919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4919","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4919v2","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4919","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"53CBOXVZPIQX","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"53CBOXVZPIQXHFJN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"53CBOXVZ","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:e42acd93a5514b2ee064d89d03435f76599d1588cd371552c42df84d84150c59","target":"graph","created_at":"2026-05-18T03:12:47Z","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 a variant of the online buffer management problem in network switches, called the $k$-frame throughput maximization problem ($k$-FTM). This problem models the situation where a large frame is fragmented into $k$ packets and transmitted through the Internet, and the receiver can reconstruct the frame only if he/she accepts all the $k$ packets. Kesselman et al.\\ introduced this problem and showed that its competitive ratio is unbounded even when $k=2$. They also introduced an \"order-respecting\" variant of $k$-FTM, called $k$-OFTM, where inputs are restricted in some natural way. They","authors_text":"Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T10:26:22Z","title":"Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4919","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:92d74a0be470de363a9a79117b4b25928ee78e05d6c823d9f4e8da491cf5ae7e","target":"record","created_at":"2026-05-18T03:12:47Z","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":"c2d0b0dc4c686aa027145b04395cb45a03e83e0864b28bed9d49b9e0a91b3e92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T10:26:22Z","title_canon_sha256":"5fa42e34c63bd73ed1907d07618dbdc8bcce131101f4aa36e65eb4046d3bab43"},"schema_version":"1.0","source":{"id":"1309.4919","kind":"arxiv","version":2}},"canonical_sha256":"eec4175eb97a2173952da344b9585339e9e3ca4a4166692aa21b88e1b18bab03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eec4175eb97a2173952da344b9585339e9e3ca4a4166692aa21b88e1b18bab03","first_computed_at":"2026-05-18T03:12:47.834915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:47.834915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wwFc0IYtlDXeI+MYT3VAgHCjCQOUNU45/CGI2CAwOikOc4VnmkPdswSo2FZ8XtR3zL2sIiQbiGzl5rT4/lJHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:47.835671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92d74a0be470de363a9a79117b4b25928ee78e05d6c823d9f4e8da491cf5ae7e","sha256:e42acd93a5514b2ee064d89d03435f76599d1588cd371552c42df84d84150c59"],"state_sha256":"beb8d615f8383760ffa1ff62f64c81ec14f504b5ea07bf996c60a3c39474b886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSIWSnLk//blE16jqyvBSqmSP7RRq/0eoQDZh5CB1dB8S2DH3Tt9+O5IHQCZfiNPLRRPfzNwM5X8espTHeECCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:19:23.838122Z","bundle_sha256":"1337e91fd1c8823a595682cf5d936d127bb25f31acd683666417cf40d27c6bfd"}}