{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UTOHCPBGX3T47GOHR4FJWSPCJO","short_pith_number":"pith:UTOHCPBG","schema_version":"1.0","canonical_sha256":"a4dc713c26bee7cf99c78f0a9b49e24bbc431bfc5e551d46e869d731fc485454","source":{"kind":"arxiv","id":"1701.05711","version":3},"attestation_state":"computed","paper":{"title":"Age-Optimal Information Updates in Multihop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed M. Bedewy, Ness B. Shroff, Yin Sun","submitted_at":"2017-01-20T07:31:28Z","abstract_excerpt":"The problem of reducing the age-of-information has been extensively studied in the single-hop networks. In this paper, we minimize the age-of-information in general multihop networks. If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy. In addition, for arbitrary general distributions of packet transmission times, the non-preemptive LGFS policy is shown to minimize the a"},"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":"1701.05711","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T07:31:28Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"8c22f065fa999bd64191f8d5cf90e7d10851fcdf4cd38005dca986c9eb78e5d1","abstract_canon_sha256":"8e7e992f93ee9c4885540099d33becfd93ab9a148df12c64ac375afbed76eb4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:42.148182Z","signature_b64":"czcNwpFQwrTF1G/XU4WfPJa1ZJdpR7UrxYQ+HOmZP7qLEBTCUdTdpWw3IYfSMxp7KXeEFh1dtVLK9cILu+hLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4dc713c26bee7cf99c78f0a9b49e24bbc431bfc5e551d46e869d731fc485454","last_reissued_at":"2026-05-18T00:47:42.147413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:42.147413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Age-Optimal Information Updates in Multihop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed M. Bedewy, Ness B. Shroff, Yin Sun","submitted_at":"2017-01-20T07:31:28Z","abstract_excerpt":"The problem of reducing the age-of-information has been extensively studied in the single-hop networks. In this paper, we minimize the age-of-information in general multihop networks. If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy. In addition, for arbitrary general distributions of packet transmission times, the non-preemptive LGFS policy is shown to minimize the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05711","kind":"arxiv","version":3},"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":"1701.05711","created_at":"2026-05-18T00:47:42.147540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05711v3","created_at":"2026-05-18T00:47:42.147540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05711","created_at":"2026-05-18T00:47:42.147540+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTOHCPBGX3T4","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTOHCPBGX3T47GOH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTOHCPBG","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00928","citing_title":"Trading Off Computation with Transmission in Status Update Systems","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO","json":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO.json","graph_json":"https://pith.science/api/pith-number/UTOHCPBGX3T47GOHR4FJWSPCJO/graph.json","events_json":"https://pith.science/api/pith-number/UTOHCPBGX3T47GOHR4FJWSPCJO/events.json","paper":"https://pith.science/paper/UTOHCPBG"},"agent_actions":{"view_html":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO","download_json":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO.json","view_paper":"https://pith.science/paper/UTOHCPBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05711&json=true","fetch_graph":"https://pith.science/api/pith-number/UTOHCPBGX3T47GOHR4FJWSPCJO/graph.json","fetch_events":"https://pith.science/api/pith-number/UTOHCPBGX3T47GOHR4FJWSPCJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO/action/storage_attestation","attest_author":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO/action/author_attestation","sign_citation":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO/action/citation_signature","submit_replication":"https://pith.science/pith/UTOHCPBGX3T47GOHR4FJWSPCJO/action/replication_record"}},"created_at":"2026-05-18T00:47:42.147540+00:00","updated_at":"2026-05-18T00:47:42.147540+00:00"}