{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TB2G6QGTI2P2QIHR42Z2MLYAG2","short_pith_number":"pith:TB2G6QGT","schema_version":"1.0","canonical_sha256":"98746f40d3469fa820f1e6b3a62f00368911ec60f9483405edddd2548042d156","source":{"kind":"arxiv","id":"1811.12605","version":4},"attestation_state":"computed","paper":{"title":"Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Haibo Zeng, Minghua Chen, Qingyu Liu","submitted_at":"2018-11-30T04:14:43Z","abstract_excerpt":"We consider the scenario where a sender periodically sends a batch of data to a receiver over a multi-hop network, possibly using multiple paths. Our objective is to minimize peak/average Age-of-Information (AoI) subject to throughput requirements. The consideration of batch generation and multi-path communication differentiates our AoI study from existing ones. We first show that our AoI minimization problems are NP-hard, but only in the weak sense, as we develop an optimal algorithm with a pseudo-polynomial time complexity. We then prove that minimizing AoI and minimizing maximum delay are \""},"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":"1811.12605","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T04:14:43Z","cross_cats_sorted":[],"title_canon_sha256":"baaadcbe26bb3f55dd56289de60836e0026653af3a55453fde4d51f51cb13653","abstract_canon_sha256":"fd4be5332468678d0f978a0cd014439790d89bbdddde325c5c4bcd96b4987a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.890480Z","signature_b64":"uXVwOE+3biBsIADbiWHn8VzP12qINiEgv9jNac7bBFSZnA7m/n+RLB196i6Q1ZGMM1ZJPE1Dyp+Z/XoY3enHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98746f40d3469fa820f1e6b3a62f00368911ec60f9483405edddd2548042d156","last_reissued_at":"2026-05-17T23:45:57.889577Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.889577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Haibo Zeng, Minghua Chen, Qingyu Liu","submitted_at":"2018-11-30T04:14:43Z","abstract_excerpt":"We consider the scenario where a sender periodically sends a batch of data to a receiver over a multi-hop network, possibly using multiple paths. Our objective is to minimize peak/average Age-of-Information (AoI) subject to throughput requirements. The consideration of batch generation and multi-path communication differentiates our AoI study from existing ones. We first show that our AoI minimization problems are NP-hard, but only in the weak sense, as we develop an optimal algorithm with a pseudo-polynomial time complexity. We then prove that minimizing AoI and minimizing maximum delay are \""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12605","kind":"arxiv","version":4},"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":"1811.12605","created_at":"2026-05-17T23:45:57.889671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12605v4","created_at":"2026-05-17T23:45:57.889671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12605","created_at":"2026-05-17T23:45:57.889671+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB2G6QGTI2P2","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB2G6QGTI2P2QIHR","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB2G6QGT","created_at":"2026-05-18T12:32:53.628368+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/TB2G6QGTI2P2QIHR42Z2MLYAG2","json":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2.json","graph_json":"https://pith.science/api/pith-number/TB2G6QGTI2P2QIHR42Z2MLYAG2/graph.json","events_json":"https://pith.science/api/pith-number/TB2G6QGTI2P2QIHR42Z2MLYAG2/events.json","paper":"https://pith.science/paper/TB2G6QGT"},"agent_actions":{"view_html":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2","download_json":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2.json","view_paper":"https://pith.science/paper/TB2G6QGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12605&json=true","fetch_graph":"https://pith.science/api/pith-number/TB2G6QGTI2P2QIHR42Z2MLYAG2/graph.json","fetch_events":"https://pith.science/api/pith-number/TB2G6QGTI2P2QIHR42Z2MLYAG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/action/storage_attestation","attest_author":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/action/author_attestation","sign_citation":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/action/citation_signature","submit_replication":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/action/replication_record"}},"created_at":"2026-05-17T23:45:57.889671+00:00","updated_at":"2026-05-17T23:45:57.889671+00:00"}