{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3QADZXHISNHXBGCZ65FTGTQYVD","short_pith_number":"pith:3QADZXHI","schema_version":"1.0","canonical_sha256":"dc003cdce8934f709859f74b334e18a8e46df92a75cbe258ce948005e557ddd7","source":{"kind":"arxiv","id":"1709.01672","version":2},"attestation_state":"computed","paper":{"title":"Throughput Optimal Decentralized Scheduling of Multi-Hop Networks with End-to-End Deadline Constraints: II Wireless Networks with Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","cs.SY"],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, P.R. Kumar, Rahul Singh","submitted_at":"2017-09-06T04:56:43Z","abstract_excerpt":"Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end timely throughput of the network. Timely throughput of a flow $f$ is defined as the average rate at which packets of flow $f$ reach their destination node $d_f$ within their deadline.\n  Our policy has several surprising characteristics. Firstly, we show that the optimal routing-scheduling decision for an individual packet that is present at a wireless node $i"},"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":"1709.01672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-06T04:56:43Z","cross_cats_sorted":["cs.LG","cs.NE","cs.SY"],"title_canon_sha256":"b0fac36c4645fe67b985e57a08420981e5dc07ee49fa4f62586da2eceab00580","abstract_canon_sha256":"6f214fab7c35725b9179678fd70a299260798add8313b7343af0dde2402c68d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:30.405831Z","signature_b64":"+LAQbFlZmv9/FTyxmBRA6WBuWfMa7AHpwA3p7lfZmgq4yHAsa6TQ3bKZPkEsdrhSLdUfvJm6do/MhDRf3bF2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc003cdce8934f709859f74b334e18a8e46df92a75cbe258ce948005e557ddd7","last_reissued_at":"2026-05-18T00:35:30.405271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:30.405271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput Optimal Decentralized Scheduling of Multi-Hop Networks with End-to-End Deadline Constraints: II Wireless Networks with Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","cs.SY"],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, P.R. Kumar, Rahul Singh","submitted_at":"2017-09-06T04:56:43Z","abstract_excerpt":"Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end timely throughput of the network. Timely throughput of a flow $f$ is defined as the average rate at which packets of flow $f$ reach their destination node $d_f$ within their deadline.\n  Our policy has several surprising characteristics. Firstly, we show that the optimal routing-scheduling decision for an individual packet that is present at a wireless node $i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01672","kind":"arxiv","version":2},"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":"1709.01672","created_at":"2026-05-18T00:35:30.405379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01672v2","created_at":"2026-05-18T00:35:30.405379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01672","created_at":"2026-05-18T00:35:30.405379+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QADZXHISNHX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QADZXHISNHXBGCZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QADZXHI","created_at":"2026-05-18T12:30:58.224056+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/3QADZXHISNHXBGCZ65FTGTQYVD","json":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD.json","graph_json":"https://pith.science/api/pith-number/3QADZXHISNHXBGCZ65FTGTQYVD/graph.json","events_json":"https://pith.science/api/pith-number/3QADZXHISNHXBGCZ65FTGTQYVD/events.json","paper":"https://pith.science/paper/3QADZXHI"},"agent_actions":{"view_html":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD","download_json":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD.json","view_paper":"https://pith.science/paper/3QADZXHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01672&json=true","fetch_graph":"https://pith.science/api/pith-number/3QADZXHISNHXBGCZ65FTGTQYVD/graph.json","fetch_events":"https://pith.science/api/pith-number/3QADZXHISNHXBGCZ65FTGTQYVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/action/storage_attestation","attest_author":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/action/author_attestation","sign_citation":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/action/citation_signature","submit_replication":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/action/replication_record"}},"created_at":"2026-05-18T00:35:30.405379+00:00","updated_at":"2026-05-18T00:35:30.405379+00:00"}