{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TB2G6QGTI2P2QIHR42Z2MLYAG2","short_pith_number":"pith:TB2G6QGT","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"},"canonical_sha256":"98746f40d3469fa820f1e6b3a62f00368911ec60f9483405edddd2548042d156","source":{"kind":"arxiv","id":"1811.12605","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12605","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12605v4","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12605","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"TB2G6QGTI2P2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TB2G6QGTI2P2QIHR","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TB2G6QGT","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TB2G6QGTI2P2QIHR42Z2MLYAG2","target":"record","payload":{"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"},"canonical_sha256":"98746f40d3469fa820f1e6b3a62f00368911ec60f9483405edddd2548042d156","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"},"source_kind":"arxiv","source_id":"1811.12605","source_version":4,"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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBUMUVJaIr2ClbVweY+zlKwLkMnTC7RB6ki/rIY/wB9QadRylpzp3618kW/jsupIE8kYonshF5OoibOTzZxXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:24:11.824067Z"},"content_sha256":"8111f262661367f693f8becd750b6025d5a9dd3c7336d2b2631000cc7032a804","schema_version":"1.0","event_id":"sha256:8111f262661367f693f8becd750b6025d5a9dd3c7336d2b2631000cc7032a804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TB2G6QGTI2P2QIHR42Z2MLYAG2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MNJWiXo9Dhe3rm/ICIGlhZAtKXuzpPFXm3FsUPwcgxlrcVyKTWa3xjB+RmhYaD45cAMnAfiJKpMRJt1yBedBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:24:11.824613Z"},"content_sha256":"baa0ed425d3d9989d9cfd36aedfc1a4eb123b3d9c1f2a246cfe1d0c108855519","schema_version":"1.0","event_id":"sha256:baa0ed425d3d9989d9cfd36aedfc1a4eb123b3d9c1f2a246cfe1d0c108855519"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/bundle.json","state_url":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/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-06-06T15:24:11Z","links":{"resolver":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2","bundle":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/bundle.json","state":"https://pith.science/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TB2G6QGTI2P2QIHR42Z2MLYAG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TB2G6QGTI2P2QIHR42Z2MLYAG2","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":"fd4be5332468678d0f978a0cd014439790d89bbdddde325c5c4bcd96b4987a74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T04:14:43Z","title_canon_sha256":"baaadcbe26bb3f55dd56289de60836e0026653af3a55453fde4d51f51cb13653"},"schema_version":"1.0","source":{"id":"1811.12605","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12605","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12605v4","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12605","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"TB2G6QGTI2P2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TB2G6QGTI2P2QIHR","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TB2G6QGT","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:baa0ed425d3d9989d9cfd36aedfc1a4eb123b3d9c1f2a246cfe1d0c108855519","target":"graph","created_at":"2026-05-17T23:45:57Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 \"","authors_text":"Haibo Zeng, Minghua Chen, Qingyu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T04:14:43Z","title":"Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12605","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8111f262661367f693f8becd750b6025d5a9dd3c7336d2b2631000cc7032a804","target":"record","created_at":"2026-05-17T23:45:57Z","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":"fd4be5332468678d0f978a0cd014439790d89bbdddde325c5c4bcd96b4987a74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-30T04:14:43Z","title_canon_sha256":"baaadcbe26bb3f55dd56289de60836e0026653af3a55453fde4d51f51cb13653"},"schema_version":"1.0","source":{"id":"1811.12605","kind":"arxiv","version":4}},"canonical_sha256":"98746f40d3469fa820f1e6b3a62f00368911ec60f9483405edddd2548042d156","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98746f40d3469fa820f1e6b3a62f00368911ec60f9483405edddd2548042d156","first_computed_at":"2026-05-17T23:45:57.889577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:57.889577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXVwOE+3biBsIADbiWHn8VzP12qINiEgv9jNac7bBFSZnA7m/n+RLB196i6Q1ZGMM1ZJPE1Dyp+Z/XoY3enHBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:57.890480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12605","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8111f262661367f693f8becd750b6025d5a9dd3c7336d2b2631000cc7032a804","sha256:baa0ed425d3d9989d9cfd36aedfc1a4eb123b3d9c1f2a246cfe1d0c108855519"],"state_sha256":"585e17ad03540625b3353661c80dfd528e6c8b9e7a773d3ca192c23359b718de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvWO5IegTmWiMYihW86E5yEqOKmLPm8AGkDaSfe1X2N2NnvSLAtl9jGYGEsUWVE4yrH0FkJyXMgMmT2PfryrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:24:11.827721Z","bundle_sha256":"72ea877cd20e96f120d46d7a658431ca711955876faed887bb632cd636cd3d24"}}