{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LIDFNLUYEZNN53RMJUTSWZYFFE","short_pith_number":"pith:LIDFNLUY","canonical_record":{"source":{"id":"2605.13002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T04:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"8521a0dffefc624d2f0928194362a0f806f5e84e2a45f6d2c06533134cb7a436","abstract_canon_sha256":"8fb361a1459bb9274070378d4f2c6afc23a7171ac0a12f7737f248a2f289bb7b"},"schema_version":"1.0"},"canonical_sha256":"5a0656ae98265adeee2c4d272b67052914002cf75261215031eab8384e9b10dc","source":{"kind":"arxiv","id":"2605.13002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13002","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13002v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13002","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"LIDFNLUYEZNN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIDFNLUYEZNN53RM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIDFNLUY","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LIDFNLUYEZNN53RMJUTSWZYFFE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T04:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"8521a0dffefc624d2f0928194362a0f806f5e84e2a45f6d2c06533134cb7a436","abstract_canon_sha256":"8fb361a1459bb9274070378d4f2c6afc23a7171ac0a12f7737f248a2f289bb7b"},"schema_version":"1.0"},"canonical_sha256":"5a0656ae98265adeee2c4d272b67052914002cf75261215031eab8384e9b10dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.389817Z","signature_b64":"31mwv2Bd+5bwHAR4Phir+qM8ANW5UOpKuUq5iZENoilGskntI0Sbsr4bgQtmruVtqF5rfR9sMKrMMOTi2KOaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0656ae98265adeee2c4d272b67052914002cf75261215031eab8384e9b10dc","last_reissued_at":"2026-05-18T03:09:00.389128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.389128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13002","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-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLmkwkzLOFyDHWCSVB0QM5g9Yl2+Q6s7T3v5ED9HGT30epR9WyfdwHE7LRZkE/eDYVfvs++J6VF8n46Akad1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:10:03.250854Z"},"content_sha256":"28cd1d45c34732259d6e29c2ee57ac809b49d4d172dffc1605d5eb4be002fe97","schema_version":"1.0","event_id":"sha256:28cd1d45c34732259d6e29c2ee57ac809b49d4d172dffc1605d5eb4be002fe97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LIDFNLUYEZNN53RMJUTSWZYFFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Persistence-Aware Framework for Age Violation Control in Wireless Status Update Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A consecutive age violation rate vector unifies persistence objectives in wireless status updates and is optimized by quantile regression deep Q-learning.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chen Chen, Haoyuan Pan, Kun Chen, Shiyong Zhou, Tse-Tin Chan","submitted_at":"2026-05-13T04:57:12Z","abstract_excerpt":"Timely and reliable status updates are essential for emerging QoS-sensitive wireless applications. Common age of information (AoI)-based metrics, such as average AoI and age violation rate (AVR), characterize time-averaged freshness or violation frequency but do not explicitly capture the temporal persistence of consecutive age violations, which can be critical in safety-sensitive wireless applications. We develop a persistence-aware reliability framework based on the consecutive age violation rate (C-AVR) vector, whose components quantify AoI threshold violations over consecutive time windows"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Simulation results show that QR-D3QN consistently outperforms expectation-based baselines across a wide range of weighting schemes and system settings, with particularly significant gains under tail-sensitive persistence objectives.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the simulated stochastic packet arrivals, channel unreliability, and cost constraints sufficiently represent the temporal correlation structure of real wireless deployments so that the learned policies transfer.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proposes C-AVR framework for persistence-aware AoI reliability and optimizes it via QR-D3QN, outperforming expectation-based RL baselines in simulations especially under tail-sensitive weighting.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A consecutive age violation rate vector unifies persistence objectives in wireless status updates and is optimized by quantile regression deep Q-learning.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"41e2aca3112825c349578610160c2bcab52e54082c53caeafc0331e8e994942b"},"source":{"id":"2605.13002","kind":"arxiv","version":1},"verdict":{"id":"daf5bf8a-c796-4c85-b574-4be9f4b8bba0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:39:50.205507Z","strongest_claim":"Simulation results show that QR-D3QN consistently outperforms expectation-based baselines across a wide range of weighting schemes and system settings, with particularly significant gains under tail-sensitive persistence objectives.","one_line_summary":"Proposes C-AVR framework for persistence-aware AoI reliability and optimizes it via QR-D3QN, outperforming expectation-based RL baselines in simulations especially under tail-sensitive weighting.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the simulated stochastic packet arrivals, channel unreliability, and cost constraints sufficiently represent the temporal correlation structure of real wireless deployments so that the learned policies transfer.","pith_extraction_headline":"A consecutive age violation rate vector unifies persistence objectives in wireless status updates and is optimized by quantile regression deep Q-learning."},"references":{"count":37,"sample":[{"doi":"","year":2012,"title":"Real-time status: How often should one update?","work_id":"ea9261ec-5979-4ffc-a2da-dfcb5d3babc3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"On the role of age of information in the internet of things,","work_id":"b5cc5276-6d9a-4876-96e7-b1ecb3d170d9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Y . Sun, I. Kadota, R. Talak, E. Modiano, and R. Srikant,Age of Information: A New Metric for Information Freshness. Morgan & Claypool, 2019","work_id":"2237d243-612a-4c34-b6f4-dea11a471820","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Minimizing the aoi in resource-constrained multi-source relaying systems: Dynamic and learning-based scheduling,","work_id":"546c735c-1905-4db4-9795-5100d072edaf","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Aequitas: A 5G scheduler for minimizing outdated information in IoT networks,","work_id":"7f744b2e-f713-4ebb-ab87-4d6405d1d178","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"29513a5393c8271c1dd6331ce9c591c9d0a75e882b5fdf2c53d3c09e9a13e6eb","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":"daf5bf8a-c796-4c85-b574-4be9f4b8bba0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkvIUFqcDy5Tlki84kF/y49DnUW2R0O3BZpe0oerkG+xLnfvLq1G7VTkDg6N4yz6BtQMYCfECIFP54w8IJS1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:10:03.251835Z"},"content_sha256":"52c94e22e0fe4a74b0971351f8acc374707702c942fafc119ca88d240fc92073","schema_version":"1.0","event_id":"sha256:52c94e22e0fe4a74b0971351f8acc374707702c942fafc119ca88d240fc92073"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIDFNLUYEZNN53RMJUTSWZYFFE/bundle.json","state_url":"https://pith.science/pith/LIDFNLUYEZNN53RMJUTSWZYFFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIDFNLUYEZNN53RMJUTSWZYFFE/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-05-21T14:10:03Z","links":{"resolver":"https://pith.science/pith/LIDFNLUYEZNN53RMJUTSWZYFFE","bundle":"https://pith.science/pith/LIDFNLUYEZNN53RMJUTSWZYFFE/bundle.json","state":"https://pith.science/pith/LIDFNLUYEZNN53RMJUTSWZYFFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIDFNLUYEZNN53RMJUTSWZYFFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LIDFNLUYEZNN53RMJUTSWZYFFE","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":"8fb361a1459bb9274070378d4f2c6afc23a7171ac0a12f7737f248a2f289bb7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T04:57:12Z","title_canon_sha256":"8521a0dffefc624d2f0928194362a0f806f5e84e2a45f6d2c06533134cb7a436"},"schema_version":"1.0","source":{"id":"2605.13002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13002","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13002v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13002","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"LIDFNLUYEZNN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIDFNLUYEZNN53RM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIDFNLUY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:52c94e22e0fe4a74b0971351f8acc374707702c942fafc119ca88d240fc92073","target":"graph","created_at":"2026-05-18T03:09:00Z","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":"Simulation results show that QR-D3QN consistently outperforms expectation-based baselines across a wide range of weighting schemes and system settings, with particularly significant gains under tail-sensitive persistence objectives."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the simulated stochastic packet arrivals, channel unreliability, and cost constraints sufficiently represent the temporal correlation structure of real wireless deployments so that the learned policies transfer."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proposes C-AVR framework for persistence-aware AoI reliability and optimizes it via QR-D3QN, outperforming expectation-based RL baselines in simulations especially under tail-sensitive weighting."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A consecutive age violation rate vector unifies persistence objectives in wireless status updates and is optimized by quantile regression deep Q-learning."}],"snapshot_sha256":"41e2aca3112825c349578610160c2bcab52e54082c53caeafc0331e8e994942b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Timely and reliable status updates are essential for emerging QoS-sensitive wireless applications. Common age of information (AoI)-based metrics, such as average AoI and age violation rate (AVR), characterize time-averaged freshness or violation frequency but do not explicitly capture the temporal persistence of consecutive age violations, which can be critical in safety-sensitive wireless applications. We develop a persistence-aware reliability framework based on the consecutive age violation rate (C-AVR) vector, whose components quantify AoI threshold violations over consecutive time windows","authors_text":"Chen Chen, Haoyuan Pan, Kun Chen, Shiyong Zhou, Tse-Tin Chan","cross_cats":[],"headline":"A consecutive age violation rate vector unifies persistence objectives in wireless status updates and is optimized by quantile regression deep Q-learning.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T04:57:12Z","title":"A Persistence-Aware Framework for Age Violation Control in Wireless Status Update Systems"},"references":{"count":37,"internal_anchors":0,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Real-time status: How often should one update?","work_id":"ea9261ec-5979-4ffc-a2da-dfcb5d3babc3","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"On the role of age of information in the internet of things,","work_id":"b5cc5276-6d9a-4876-96e7-b1ecb3d170d9","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Y . Sun, I. Kadota, R. Talak, E. Modiano, and R. Srikant,Age of Information: A New Metric for Information Freshness. Morgan & Claypool, 2019","work_id":"2237d243-612a-4c34-b6f4-dea11a471820","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Minimizing the aoi in resource-constrained multi-source relaying systems: Dynamic and learning-based scheduling,","work_id":"546c735c-1905-4db4-9795-5100d072edaf","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Aequitas: A 5G scheduler for minimizing outdated information in IoT networks,","work_id":"7f744b2e-f713-4ebb-ab87-4d6405d1d178","year":2024}],"snapshot_sha256":"29513a5393c8271c1dd6331ce9c591c9d0a75e882b5fdf2c53d3c09e9a13e6eb"},"source":{"id":"2605.13002","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:39:50.205507Z","id":"daf5bf8a-c796-4c85-b574-4be9f4b8bba0","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proposes C-AVR framework for persistence-aware AoI reliability and optimizes it via QR-D3QN, outperforming expectation-based RL baselines in simulations especially under tail-sensitive weighting.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A consecutive age violation rate vector unifies persistence objectives in wireless status updates and is optimized by quantile regression deep Q-learning.","strongest_claim":"Simulation results show that QR-D3QN consistently outperforms expectation-based baselines across a wide range of weighting schemes and system settings, with particularly significant gains under tail-sensitive persistence objectives.","weakest_assumption":"That the simulated stochastic packet arrivals, channel unreliability, and cost constraints sufficiently represent the temporal correlation structure of real wireless deployments so that the learned policies transfer."}},"verdict_id":"daf5bf8a-c796-4c85-b574-4be9f4b8bba0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28cd1d45c34732259d6e29c2ee57ac809b49d4d172dffc1605d5eb4be002fe97","target":"record","created_at":"2026-05-18T03:09:00Z","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":"8fb361a1459bb9274070378d4f2c6afc23a7171ac0a12f7737f248a2f289bb7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-05-13T04:57:12Z","title_canon_sha256":"8521a0dffefc624d2f0928194362a0f806f5e84e2a45f6d2c06533134cb7a436"},"schema_version":"1.0","source":{"id":"2605.13002","kind":"arxiv","version":1}},"canonical_sha256":"5a0656ae98265adeee2c4d272b67052914002cf75261215031eab8384e9b10dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a0656ae98265adeee2c4d272b67052914002cf75261215031eab8384e9b10dc","first_computed_at":"2026-05-18T03:09:00.389128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.389128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"31mwv2Bd+5bwHAR4Phir+qM8ANW5UOpKuUq5iZENoilGskntI0Sbsr4bgQtmruVtqF5rfR9sMKrMMOTi2KOaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.389817Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28cd1d45c34732259d6e29c2ee57ac809b49d4d172dffc1605d5eb4be002fe97","sha256:52c94e22e0fe4a74b0971351f8acc374707702c942fafc119ca88d240fc92073"],"state_sha256":"0b13a599148f5c6417cd8d984b9531077cc2faf144a571ffa88959d7fa7f16f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9DZMXMDtrjUjHcJOShzei9iRrQ4uO8wHcrmrb/zQ++/1uulnfTFMSS8iXNIH5tnaT2gBwJTAz5WBYVrwT5dBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T14:10:03.255662Z","bundle_sha256":"3b4980b5bf06dcbb91e13ef976a38d840d9e0be6678e028e12e9d56cd0a34bab"}}