{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2A6YFHTVUH4D36QDVRJ5VUPZJG","short_pith_number":"pith:2A6YFHTV","schema_version":"1.0","canonical_sha256":"d03d829e75a1f83dfa03ac53dad1f9499c3ed59804ada6496b7e854bb740cba3","source":{"kind":"arxiv","id":"1606.09395","version":1},"attestation_state":"computed","paper":{"title":"Online Packet Scheduling with Bounded Delay and Lookahead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fei Li, Ji\\v{r}\\'i Sgall, {\\L}ukasz Je\\.z, Marek Chrobak, Martin B\\\"ohm, Pavel Vesel\\'y","submitted_at":"2016-06-30T09:02:03Z","abstract_excerpt":"We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the literature, yet its optimal competitive ratio remains unknown: the best upper bound is $1.828$, still quite far from the best lower bound of $\\phi \\approx 1.618$.\n  In the variant of BDPS with $s$-bounded instances, each "},"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":"1606.09395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-30T09:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"ba68bf921f5ee57e3ce7641cd13f25c57ca667632f8203f25e59957f23e4fcb0","abstract_canon_sha256":"15009fcbcda4cc29bbd2e61144b7ea05a815ec30ce516a0b8d9a7671868a6dcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:40.531835Z","signature_b64":"pbQnhLRell0QRYk4B9LfHtswRENNI1Gy4XyhmcQaRMrLLpxA8jRiqGyUQJ/GDF6F+2v597hYcOpkLoTlX8P9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03d829e75a1f83dfa03ac53dad1f9499c3ed59804ada6496b7e854bb740cba3","last_reissued_at":"2026-05-18T01:11:40.531414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:40.531414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Packet Scheduling with Bounded Delay and Lookahead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fei Li, Ji\\v{r}\\'i Sgall, {\\L}ukasz Je\\.z, Marek Chrobak, Martin B\\\"ohm, Pavel Vesel\\'y","submitted_at":"2016-06-30T09:02:03Z","abstract_excerpt":"We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the literature, yet its optimal competitive ratio remains unknown: the best upper bound is $1.828$, still quite far from the best lower bound of $\\phi \\approx 1.618$.\n  In the variant of BDPS with $s$-bounded instances, each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09395","kind":"arxiv","version":1},"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":"1606.09395","created_at":"2026-05-18T01:11:40.531472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09395v1","created_at":"2026-05-18T01:11:40.531472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09395","created_at":"2026-05-18T01:11:40.531472+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A6YFHTVUH4D","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A6YFHTVUH4D36QD","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A6YFHTV","created_at":"2026-05-18T12:29:52.810259+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/2A6YFHTVUH4D36QDVRJ5VUPZJG","json":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG.json","graph_json":"https://pith.science/api/pith-number/2A6YFHTVUH4D36QDVRJ5VUPZJG/graph.json","events_json":"https://pith.science/api/pith-number/2A6YFHTVUH4D36QDVRJ5VUPZJG/events.json","paper":"https://pith.science/paper/2A6YFHTV"},"agent_actions":{"view_html":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG","download_json":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG.json","view_paper":"https://pith.science/paper/2A6YFHTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09395&json=true","fetch_graph":"https://pith.science/api/pith-number/2A6YFHTVUH4D36QDVRJ5VUPZJG/graph.json","fetch_events":"https://pith.science/api/pith-number/2A6YFHTVUH4D36QDVRJ5VUPZJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG/action/storage_attestation","attest_author":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG/action/author_attestation","sign_citation":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG/action/citation_signature","submit_replication":"https://pith.science/pith/2A6YFHTVUH4D36QDVRJ5VUPZJG/action/replication_record"}},"created_at":"2026-05-18T01:11:40.531472+00:00","updated_at":"2026-05-18T01:11:40.531472+00:00"}