{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NBHJRHFDRL565A7UMGIICJ6A2O","short_pith_number":"pith:NBHJRHFD","schema_version":"1.0","canonical_sha256":"684e989ca38afbee83f461908127c0d3bc614e5b27bbcc7ef634a8aa4ee4e803","source":{"kind":"arxiv","id":"1705.07018","version":3},"attestation_state":"computed","paper":{"title":"On Packet Scheduling with Adversarial Jamming and Speedup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji\\v{r}\\'i Sgall, {\\L}ukasz Je\\.z, Martin B\\\"ohm, Pavel Vesel\\'y","submitted_at":"2017-05-19T14:28:14Z","abstract_excerpt":"In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission taking place at the time of jamming is corrupt, and the algorithm learns this fact immediately. An online algorithm maximizes the total size of packets it successfully transmits and the goal is to develop an algorithm with the lowest possible asymptotic competitive ratio, where the additive constant may depend on packet sizes.\n  Our main contributio"},"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":"1705.07018","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T14:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"d51a93c60b859a43e8efc27ee353ea9a9434a655d08e6622cf55a3e18d6085d7","abstract_canon_sha256":"a60cd18e977d3713adc2c48402bfcc2da262fbc8531201dcd1b5bbf2d2f81d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:55.307103Z","signature_b64":"j82PsCtu7bGJRPLRXStxvs47BmD3pRi4HbIeaBJ56m65zlgPHVjv/FZ9e2SrTKkOn1PC2/9UnsWbiKb7rRmZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684e989ca38afbee83f461908127c0d3bc614e5b27bbcc7ef634a8aa4ee4e803","last_reissued_at":"2026-05-18T00:08:55.306590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:55.306590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Packet Scheduling with Adversarial Jamming and Speedup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji\\v{r}\\'i Sgall, {\\L}ukasz Je\\.z, Martin B\\\"ohm, Pavel Vesel\\'y","submitted_at":"2017-05-19T14:28:14Z","abstract_excerpt":"In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission taking place at the time of jamming is corrupt, and the algorithm learns this fact immediately. An online algorithm maximizes the total size of packets it successfully transmits and the goal is to develop an algorithm with the lowest possible asymptotic competitive ratio, where the additive constant may depend on packet sizes.\n  Our main contributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07018","kind":"arxiv","version":3},"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":"1705.07018","created_at":"2026-05-18T00:08:55.306671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07018v3","created_at":"2026-05-18T00:08:55.306671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07018","created_at":"2026-05-18T00:08:55.306671+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBHJRHFDRL56","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBHJRHFDRL565A7U","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBHJRHFD","created_at":"2026-05-18T12:31:31.346846+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/NBHJRHFDRL565A7UMGIICJ6A2O","json":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O.json","graph_json":"https://pith.science/api/pith-number/NBHJRHFDRL565A7UMGIICJ6A2O/graph.json","events_json":"https://pith.science/api/pith-number/NBHJRHFDRL565A7UMGIICJ6A2O/events.json","paper":"https://pith.science/paper/NBHJRHFD"},"agent_actions":{"view_html":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O","download_json":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O.json","view_paper":"https://pith.science/paper/NBHJRHFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07018&json=true","fetch_graph":"https://pith.science/api/pith-number/NBHJRHFDRL565A7UMGIICJ6A2O/graph.json","fetch_events":"https://pith.science/api/pith-number/NBHJRHFDRL565A7UMGIICJ6A2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O/action/storage_attestation","attest_author":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O/action/author_attestation","sign_citation":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O/action/citation_signature","submit_replication":"https://pith.science/pith/NBHJRHFDRL565A7UMGIICJ6A2O/action/replication_record"}},"created_at":"2026-05-18T00:08:55.306671+00:00","updated_at":"2026-05-18T00:08:55.306671+00:00"}