{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:53CBOXVZPIQXHFJNUNCLSWCTHH","short_pith_number":"pith:53CBOXVZ","schema_version":"1.0","canonical_sha256":"eec4175eb97a2173952da344b9585339e9e3ca4a4166692aa21b88e1b18bab03","source":{"kind":"arxiv","id":"1309.4919","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.4919","created_at":"2026-05-18T03:12:47.835019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4919v2","created_at":"2026-05-18T03:12:47.835019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4919","created_at":"2026-05-18T03:12:47.835019+00:00"},{"alias_kind":"pith_short_12","alias_value":"53CBOXVZPIQX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"53CBOXVZPIQXHFJN","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"53CBOXVZ","created_at":"2026-05-18T12:27:34.582898+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/53CBOXVZPIQXHFJNUNCLSWCTHH","json":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH.json","graph_json":"https://pith.science/api/pith-number/53CBOXVZPIQXHFJNUNCLSWCTHH/graph.json","events_json":"https://pith.science/api/pith-number/53CBOXVZPIQXHFJNUNCLSWCTHH/events.json","paper":"https://pith.science/paper/53CBOXVZ"},"agent_actions":{"view_html":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH","download_json":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH.json","view_paper":"https://pith.science/paper/53CBOXVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4919&json=true","fetch_graph":"https://pith.science/api/pith-number/53CBOXVZPIQXHFJNUNCLSWCTHH/graph.json","fetch_events":"https://pith.science/api/pith-number/53CBOXVZPIQXHFJNUNCLSWCTHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/action/storage_attestation","attest_author":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/action/author_attestation","sign_citation":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/action/citation_signature","submit_replication":"https://pith.science/pith/53CBOXVZPIQXHFJNUNCLSWCTHH/action/replication_record"}},"created_at":"2026-05-18T03:12:47.835019+00:00","updated_at":"2026-05-18T03:12:47.835019+00:00"}