{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6AB3XUAVAVWDGQMHNBCOCLKHPS","short_pith_number":"pith:6AB3XUAV","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"},"canonical_sha256":"f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66","source":{"kind":"arxiv","id":"2605.16225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16225","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16225v1","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16225","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"6AB3XUAVAVWD","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"6AB3XUAVAVWDGQMH","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"6AB3XUAV","created_at":"2026-05-20T00:01:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6AB3XUAVAVWDGQMHNBCOCLKHPS","target":"record","payload":{"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"},"canonical_sha256":"f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66","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"},"source_kind":"arxiv","source_id":"2605.16225","source_version":1,"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-20T00:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46IwyHpYkV8CJxm24hLf4XdQdLcKD2x3cc+5KF6YIh8S/x+m3++FxQpsC5Dt3tsSOzdWgHkDtWyMZfjVCDz2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:25:50.395272Z"},"content_sha256":"62079e9b4956c89c11d28b2dfa0aa5259fcfc71a01d9c83660a971949a6850de","schema_version":"1.0","event_id":"sha256:62079e9b4956c89c11d28b2dfa0aa5259fcfc71a01d9c83660a971949a6850de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6AB3XUAVAVWDGQMHNBCOCLKHPS","target":"graph","payload":{"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"},"verdict_id":"4000a99a-e933-4fae-9fa3-10d06bfa843e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAfqvwNUrPA19KLkWcpjk6sjEqtkGYLwCjWHoY8iNgt/A/kWTAjAo5Ry4YiVK8IrUuBgPH2/xYczVUErukpBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:25:50.396692Z"},"content_sha256":"17f6c2001429c20ad1427d98b81af7a4ba29eda259f5b025e2b45cf77933d710","schema_version":"1.0","event_id":"sha256:17f6c2001429c20ad1427d98b81af7a4ba29eda259f5b025e2b45cf77933d710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/bundle.json","state_url":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/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-10T22:25:50Z","links":{"resolver":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS","bundle":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/bundle.json","state":"https://pith.science/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AB3XUAVAVWDGQMHNBCOCLKHPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6AB3XUAVAVWDGQMHNBCOCLKHPS","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":"53a5d4eb933b78f0db094ac9aeab03f66ba2f41f54cc49a93742d04592c92fc1","cross_cats_sorted":["cs.NI","cs.SY","eess.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T17:35:52Z","title_canon_sha256":"4c66831c998ef65d0dabd836a2986ce70e0c855bdb9019d124c2370119f15f0f"},"schema_version":"1.0","source":{"id":"2605.16225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16225","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16225v1","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16225","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"6AB3XUAVAVWD","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"6AB3XUAVAVWDGQMH","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"6AB3XUAV","created_at":"2026-05-20T00:01:58Z"}],"graph_snapshots":[{"event_id":"sha256:17f6c2001429c20ad1427d98b81af7a4ba29eda259f5b025e2b45cf77933d710","target":"graph","created_at":"2026-05-20T00:01:58Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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')."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"59c9274c8578b19644004caf2978e7adc2a1fd8811fe4ee27508ed966a9b7c75"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.16225/integrity.json","findings":[],"snapshot_sha256":"3abce1ed106b88b9e71434a67440efa22ed8060a52801783968f2aee6cd6fc38","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Nail Akar, Sahan Liyanaarachchi, Sennur Ulukus","cross_cats":["cs.NI","cs.SY","eess.SY","math.IT"],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T17:35:52Z","title":"Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Kaul, Sanjit and Yates, Roy and Gruteser, Marco , title =. Proc. IEEE INFOCOM , year =","work_id":"ca339fac-f45b-4aa1-bcc6-b65a1189075b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"IEEE Transactions on Reliability , volume =","work_id":"d7ee8c75-3e81-4043-ac86-ca587d403e59","year":1975},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"and Dattero, Ronald , title =","work_id":"eb5d806d-09c3-41a4-9289-d2b72e4e4290","year":1984},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"and Berlekamp, Elwyn R","work_id":"2cd02360-f9e6-4f12-a560-3fe695f25d62","year":1967},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Wozencraft, John M. , title =. IRE National Convention Record , volume =","work_id":"75a4782d-a43b-4879-a86b-d240c607eedf","year":null}],"snapshot_sha256":"a06ab1942c9e8fdf573bd65849782a6cce5584a2dad4b3476217f97434c79911"},"source":{"id":"2605.16225","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:32:23.759493Z","id":"4000a99a-e933-4fae-9fa3-10d06bfa843e","model_set":{"reader":"grok-4.3"},"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","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.","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.","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')."}},"verdict_id":"4000a99a-e933-4fae-9fa3-10d06bfa843e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:62079e9b4956c89c11d28b2dfa0aa5259fcfc71a01d9c83660a971949a6850de","target":"record","created_at":"2026-05-20T00:01:58Z","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":"53a5d4eb933b78f0db094ac9aeab03f66ba2f41f54cc49a93742d04592c92fc1","cross_cats_sorted":["cs.NI","cs.SY","eess.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T17:35:52Z","title_canon_sha256":"4c66831c998ef65d0dabd836a2986ce70e0c855bdb9019d124c2370119f15f0f"},"schema_version":"1.0","source":{"id":"2605.16225","kind":"arxiv","version":1}},"canonical_sha256":"f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f003bbd015056c3341876844e12d477cb64ed0b28ea570c74c6af1b53251ed66","first_computed_at":"2026-05-20T00:01:58.945231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:58.945231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yzJq6FLs8HpppUkaeKTfPjwkXp3K45tctCZoKTrSXPx5CJPssXtEEM2NznAiN7Hx/XogHEzLFbic1BXczVp3Bw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:58.946045Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62079e9b4956c89c11d28b2dfa0aa5259fcfc71a01d9c83660a971949a6850de","sha256:17f6c2001429c20ad1427d98b81af7a4ba29eda259f5b025e2b45cf77933d710"],"state_sha256":"82bfc0ab8dc51b6f0b33439d8f7e37a192b4275b29db531fc53be717a1f20c53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwnVy5pAFbqkD5USfLjyo73ABr55Sk+nyFQ/+t7uwKVkKFdHycrmfYohm4pSTuGeBGfgh3xyEK8XWuSKFTRTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:25:50.403130Z","bundle_sha256":"a778b282fffe920b7a0ac424ba1ce171403dd3556ccaa2faabd4d13df0c48e74"}}