{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OAA6OHNLWKYPZJPSFX7MJUI5CF","short_pith_number":"pith:OAA6OHNL","schema_version":"1.0","canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","source":{"kind":"arxiv","id":"1803.06469","version":1},"attestation_state":"computed","paper":{"title":"Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Eytan Modiano, Rajat Talak, Sertac Karaman","submitted_at":"2018-03-17T05:56:29Z","abstract_excerpt":"Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links. We then show that the optim"},"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":"1803.06469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-17T05:56:29Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"809fa268e8ca78560675f8fd9902c6bae12ba7f8060a45a4712f37465f5e7fe0","abstract_canon_sha256":"abc5e4709c5094756886b4e28301d89eb71b1b6b1e45b940ec74776fb1dc4270"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:45.820428Z","signature_b64":"iHdqRRLmWgJhRxGv2iC8451JEbnoSsk48sv+mowtzkNfPaLvcZQ5vh2Y7wuvBFce7q1byxrB6sJy87sa0QZTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7001e71dabb2b0fca5f22dfec4d11d117595f90e5fb27208179884417a3aaab0","last_reissued_at":"2026-05-18T00:20:45.819853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:45.819853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Eytan Modiano, Rajat Talak, Sertac Karaman","submitted_at":"2018-03-17T05:56:29Z","abstract_excerpt":"Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links. We then show that the optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06469","kind":"arxiv","version":1},"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":"1803.06469","created_at":"2026-05-18T00:20:45.819919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06469v1","created_at":"2026-05-18T00:20:45.819919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06469","created_at":"2026-05-18T00:20:45.819919+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAA6OHNLWKYP","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAA6OHNLWKYPZJPS","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAA6OHNL","created_at":"2026-05-18T12:32:43.782077+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/OAA6OHNLWKYPZJPSFX7MJUI5CF","json":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF.json","graph_json":"https://pith.science/api/pith-number/OAA6OHNLWKYPZJPSFX7MJUI5CF/graph.json","events_json":"https://pith.science/api/pith-number/OAA6OHNLWKYPZJPSFX7MJUI5CF/events.json","paper":"https://pith.science/paper/OAA6OHNL"},"agent_actions":{"view_html":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF","download_json":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF.json","view_paper":"https://pith.science/paper/OAA6OHNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06469&json=true","fetch_graph":"https://pith.science/api/pith-number/OAA6OHNLWKYPZJPSFX7MJUI5CF/graph.json","fetch_events":"https://pith.science/api/pith-number/OAA6OHNLWKYPZJPSFX7MJUI5CF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/action/storage_attestation","attest_author":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/action/author_attestation","sign_citation":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/action/citation_signature","submit_replication":"https://pith.science/pith/OAA6OHNLWKYPZJPSFX7MJUI5CF/action/replication_record"}},"created_at":"2026-05-18T00:20:45.819919+00:00","updated_at":"2026-05-18T00:20:45.819919+00:00"}