{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6AB3XUAVAVWDGQMHNBCOCLKHPS","short_pith_number":"pith:6AB3XUAV","schema_version":"1.0","canonical_sha256":"f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66","source":{"kind":"arxiv","id":"2605.16225","version":1},"attestation_state":"computed","paper":{"title":"Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Multi-threshold preemption policies using both packet age and system age achieve lower age of information than single-threshold or probabilistic policies under random update arrivals.","cross_cats":["cs.NI","cs.SY","eess.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus","submitted_at":"2026-05-15T17:35:52Z","abstract_excerpt":"The study of optimal preemption policies for status update systems has been a recurring topic in the age of information (AoI) literature, where threshold-based structures have been shown to be optimal under a generate-at-will update generation model under certain assumptions. In this work, we study the effectiveness of threshold-based policies for a system with random update arrivals. In this regard, we introduce an analytical framework for evaluating the AoI of multi-threshold preemption policies and present interesting characteristics of the structure of the optimal preemption policy. We sho"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.16225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T17:35:52Z","cross_cats_sorted":["cs.NI","cs.SY","eess.SY","math.IT"],"title_canon_sha256":"4c66831c998ef65d0dabd836a2986ce70e0c855bdb9019d124c2370119f15f0f","abstract_canon_sha256":"53a5d4eb933b78f0db094ac9aeab03f66ba2f41f54cc49a93742d04592c92fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:58.946045Z","signature_b64":"yzJq6FLs8HpppUkaeKTfPjwkXp3K45tctCZoKTrSXPx5CJPssXtEEM2NznAiN7Hx/XogHEzLFbic1BXczVp3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66","last_reissued_at":"2026-05-20T00:01:58.945231Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:58.945231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Multi-threshold preemption policies using both packet age and system age achieve lower age of information than single-threshold or probabilistic policies under random update arrivals.","cross_cats":["cs.NI","cs.SY","eess.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus","submitted_at":"2026-05-15T17:35:52Z","abstract_excerpt":"The study of optimal preemption policies for status update systems has been a recurring topic in the age of information (AoI) literature, where threshold-based structures have been shown to be optimal under a generate-at-will update generation model under certain assumptions. In this work, we study the effectiveness of threshold-based policies for a system with random update arrivals. In this regard, we introduce an analytical framework for evaluating the AoI of multi-threshold preemption policies and present interesting characteristics of the structure of the optimal preemption policy. We sho"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we observe that significant gains in terms of AoI can be obtained by utilizing both the age of the packet and the age of the system when designing these preemption policies.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The system follows a random update arrival process for which an analytical framework can accurately evaluate AoI under multi-threshold preemption (abstract: 'we study the effectiveness of threshold-based policies for a system with random update arrivals' and 'introduce an analytical framework for evaluating the AoI of multi-threshold preemption policies').","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Multi-threshold preemption policies that consider both packet age and system age achieve significant AoI reductions compared to probabilistic and single-threshold policies in random-arrival status update systems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Multi-threshold preemption policies using both packet age and system age achieve lower age of information than single-threshold or probabilistic policies under random update arrivals.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"59c9274c8578b19644004caf2978e7adc2a1fd8811fe4ee27508ed966a9b7c75"},"source":{"id":"2605.16225","kind":"arxiv","version":1},"verdict":{"id":"4000a99a-e933-4fae-9fa3-10d06bfa843e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T18:32:23.759493Z","strongest_claim":"we observe that significant gains in terms of AoI can be obtained by utilizing both the age of the packet and the age of the system when designing these preemption policies.","one_line_summary":"Multi-threshold preemption policies that consider both packet age and system age achieve significant AoI reductions compared to probabilistic and single-threshold policies in random-arrival status update systems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The system follows a random update arrival process for which an analytical framework can accurately evaluate AoI under multi-threshold preemption (abstract: 'we study the effectiveness of threshold-based policies for a system with random update arrivals' and 'introduce an analytical framework for evaluating the AoI of multi-threshold preemption policies').","pith_extraction_headline":"Multi-threshold preemption policies using both packet age and system age achieve lower age of information than single-threshold or probabilistic policies under random update arrivals."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16225/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.876027Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:40:53.095249Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T17:49:43.972537Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:43.632656Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:24.333595Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T17:31:30.914286Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T17:22:05.275019Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.378992Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3abce1ed106b88b9e71434a67440efa22ed8060a52801783968f2aee6cd6fc38"},"references":{"count":17,"sample":[{"doi":"","year":null,"title":"Kaul, Sanjit and Yates, Roy and Gruteser, Marco , title =. Proc. IEEE INFOCOM , year =","work_id":"ca339fac-f45b-4aa1-bcc6-b65a1189075b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1975,"title":"IEEE Transactions on Reliability , volume =","work_id":"d7ee8c75-3e81-4043-ac86-ca587d403e59","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"and Dattero, Ronald , title =","work_id":"eb5d806d-09c3-41a4-9289-d2b72e4e4290","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1967,"title":"and Berlekamp, Elwyn R","work_id":"2cd02360-f9e6-4f12-a560-3fe695f25d62","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Wozencraft, John M. , title =. IRE National Convention Record , volume =","work_id":"75a4782d-a43b-4879-a86b-d240c607eedf","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"a06ab1942c9e8fdf573bd65849782a6cce5584a2dad4b3476217f97434c79911","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":"2605.16225","created_at":"2026-05-20T00:01:58.945370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16225v1","created_at":"2026-05-20T00:01:58.945370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16225","created_at":"2026-05-20T00:01:58.945370+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AB3XUAVAVWD","created_at":"2026-05-20T00:01:58.945370+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AB3XUAVAVWDGQMH","created_at":"2026-05-20T00:01:58.945370+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AB3XUAV","created_at":"2026-05-20T00:01:58.945370+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/6AB3XUAVAVWDGQMHNBCOCLKHPS","json":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS.json","graph_json":"https://pith.science/api/pith-number/6AB3XUAVAVWDGQMHNBCOCLKHPS/graph.json","events_json":"https://pith.science/api/pith-number/6AB3XUAVAVWDGQMHNBCOCLKHPS/events.json","paper":"https://pith.science/paper/6AB3XUAV"},"agent_actions":{"view_html":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS","download_json":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS.json","view_paper":"https://pith.science/paper/6AB3XUAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16225&json=true","fetch_graph":"https://pith.science/api/pith-number/6AB3XUAVAVWDGQMHNBCOCLKHPS/graph.json","fetch_events":"https://pith.science/api/pith-number/6AB3XUAVAVWDGQMHNBCOCLKHPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/action/storage_attestation","attest_author":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/action/author_attestation","sign_citation":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/action/citation_signature","submit_replication":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/action/replication_record"}},"created_at":"2026-05-20T00:01:58.945370+00:00","updated_at":"2026-05-20T00:01:58.945370+00:00"}