{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RHGKJFJW77UKJ44UJEJIRMJEFG","short_pith_number":"pith:RHGKJFJW","schema_version":"1.0","canonical_sha256":"89cca49536ffe8a4f394491288b124299b981d4ef64b899601478060b6527b53","source":{"kind":"arxiv","id":"1912.01473","version":6},"attestation_state":"computed","paper":{"title":"Age of Information in Random Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Hamed Hassani, Konstantinos Gatsis, Shirin Saeedi Bidokhti, Xingran Chen","submitted_at":"2019-12-03T15:40:00Z","abstract_excerpt":"In applications of remote sensing, estimation, and control, timely communication is not always ensured by high-rate communication. This work proposes distributed age-efficient transmission policies for random access channels with $M$ transmitters. In the first part of this work, we analyze the age performance of stationary randomized policies by relating the problem of finding age to the absorption time of a related Markov chain. In the second part of this work, we propose the notion of \\emph{age-gain} of a packet to quantify how much the packet will reduce the instantaneous age of information"},"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":"1912.01473","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-12-03T15:40:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e6e631f6bd3b7ff8ce7a9845a07c16d4cca328c315e4eb9d6f6471f02dd17839","abstract_canon_sha256":"254b226b2f5ccf72479442dae122721e1d31a158602f3bf0cd057b987869fc29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:50.904991Z","signature_b64":"4rBPcv474PktuTGEdz86o8183H8ketXSA45PcXkCUqJNAf9T320J61w2nPb5aecHZE1rXYj5qr5qyfJxEo87AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89cca49536ffe8a4f394491288b124299b981d4ef64b899601478060b6527b53","last_reissued_at":"2026-07-05T04:28:50.904481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:50.904481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Age of Information in Random Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Hamed Hassani, Konstantinos Gatsis, Shirin Saeedi Bidokhti, Xingran Chen","submitted_at":"2019-12-03T15:40:00Z","abstract_excerpt":"In applications of remote sensing, estimation, and control, timely communication is not always ensured by high-rate communication. This work proposes distributed age-efficient transmission policies for random access channels with $M$ transmitters. In the first part of this work, we analyze the age performance of stationary randomized policies by relating the problem of finding age to the absorption time of a related Markov chain. In the second part of this work, we propose the notion of \\emph{age-gain} of a packet to quantify how much the packet will reduce the instantaneous age of information"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.01473","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.01473/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.01473","created_at":"2026-07-05T04:28:50.904543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.01473v6","created_at":"2026-07-05T04:28:50.904543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.01473","created_at":"2026-07-05T04:28:50.904543+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHGKJFJW77UK","created_at":"2026-07-05T04:28:50.904543+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHGKJFJW77UKJ44U","created_at":"2026-07-05T04:28:50.904543+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHGKJFJW","created_at":"2026-07-05T04:28:50.904543+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/RHGKJFJW77UKJ44UJEJIRMJEFG","json":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG.json","graph_json":"https://pith.science/api/pith-number/RHGKJFJW77UKJ44UJEJIRMJEFG/graph.json","events_json":"https://pith.science/api/pith-number/RHGKJFJW77UKJ44UJEJIRMJEFG/events.json","paper":"https://pith.science/paper/RHGKJFJW"},"agent_actions":{"view_html":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG","download_json":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG.json","view_paper":"https://pith.science/paper/RHGKJFJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.01473&json=true","fetch_graph":"https://pith.science/api/pith-number/RHGKJFJW77UKJ44UJEJIRMJEFG/graph.json","fetch_events":"https://pith.science/api/pith-number/RHGKJFJW77UKJ44UJEJIRMJEFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG/action/storage_attestation","attest_author":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG/action/author_attestation","sign_citation":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG/action/citation_signature","submit_replication":"https://pith.science/pith/RHGKJFJW77UKJ44UJEJIRMJEFG/action/replication_record"}},"created_at":"2026-07-05T04:28:50.904543+00:00","updated_at":"2026-07-05T04:28:50.904543+00:00"}