{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3QADZXHISNHXBGCZ65FTGTQYVD","short_pith_number":"pith:3QADZXHI","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"},"canonical_sha256":"dc003cdce8934f709859f74b334e18a8e46df92a75cbe258ce948005e557ddd7","source":{"kind":"arxiv","id":"1709.01672","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01672","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01672v2","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01672","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"3QADZXHISNHX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3QADZXHISNHXBGCZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3QADZXHI","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3QADZXHISNHXBGCZ65FTGTQYVD","target":"record","payload":{"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"},"canonical_sha256":"dc003cdce8934f709859f74b334e18a8e46df92a75cbe258ce948005e557ddd7","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"},"source_kind":"arxiv","source_id":"1709.01672","source_version":2,"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-18T00:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm1c1JPBvpfNa1luD8xR+ZEhRrnxVv3wGp9XYRKzdkQgS6OcEeFz2pxmu+omtIs1WukxFBnWbbMad8/nGCC/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:20.007460Z"},"content_sha256":"47479b561617a2f2ae1dfce79d5ee15710eb13ac0c5bf47cc0c70f1c6f977381","schema_version":"1.0","event_id":"sha256:47479b561617a2f2ae1dfce79d5ee15710eb13ac0c5bf47cc0c70f1c6f977381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3QADZXHISNHXBGCZ65FTGTQYVD","target":"graph","payload":{"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"},"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-18T00:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMy/okO2SMa84dSUP2U4NW9lUxo3Y7+DgsB4t5CAY4/ejvvTA1AL5apCypdpIukAQiGrEe+wyPjweDJHnO4bCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:20.007807Z"},"content_sha256":"e59b8f01497599ede68a7c80670bf0acb7f6be930fe99cc3e8a64fa56dce0ecf","schema_version":"1.0","event_id":"sha256:e59b8f01497599ede68a7c80670bf0acb7f6be930fe99cc3e8a64fa56dce0ecf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/bundle.json","state_url":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QADZXHISNHXBGCZ65FTGTQYVD/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-05-19T19:00:20Z","links":{"resolver":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD","bundle":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/bundle.json","state":"https://pith.science/pith/3QADZXHISNHXBGCZ65FTGTQYVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QADZXHISNHXBGCZ65FTGTQYVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3QADZXHISNHXBGCZ65FTGTQYVD","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":"6f214fab7c35725b9179678fd70a299260798add8313b7343af0dde2402c68d3","cross_cats_sorted":["cs.LG","cs.NE","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-06T04:56:43Z","title_canon_sha256":"b0fac36c4645fe67b985e57a08420981e5dc07ee49fa4f62586da2eceab00580"},"schema_version":"1.0","source":{"id":"1709.01672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01672","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01672v2","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01672","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"3QADZXHISNHX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3QADZXHISNHXBGCZ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3QADZXHI","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:e59b8f01497599ede68a7c80670bf0acb7f6be930fe99cc3e8a64fa56dce0ecf","target":"graph","created_at":"2026-05-18T00:35:30Z","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":"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","authors_text":"Eytan Modiano, P.R. Kumar, Rahul Singh","cross_cats":["cs.LG","cs.NE","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-06T04:56:43Z","title":"Throughput Optimal Decentralized Scheduling of Multi-Hop Networks with End-to-End Deadline Constraints: II Wireless Networks with Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01672","kind":"arxiv","version":2},"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:47479b561617a2f2ae1dfce79d5ee15710eb13ac0c5bf47cc0c70f1c6f977381","target":"record","created_at":"2026-05-18T00:35:30Z","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":"6f214fab7c35725b9179678fd70a299260798add8313b7343af0dde2402c68d3","cross_cats_sorted":["cs.LG","cs.NE","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-06T04:56:43Z","title_canon_sha256":"b0fac36c4645fe67b985e57a08420981e5dc07ee49fa4f62586da2eceab00580"},"schema_version":"1.0","source":{"id":"1709.01672","kind":"arxiv","version":2}},"canonical_sha256":"dc003cdce8934f709859f74b334e18a8e46df92a75cbe258ce948005e557ddd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc003cdce8934f709859f74b334e18a8e46df92a75cbe258ce948005e557ddd7","first_computed_at":"2026-05-18T00:35:30.405271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:30.405271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+LAQbFlZmv9/FTyxmBRA6WBuWfMa7AHpwA3p7lfZmgq4yHAsa6TQ3bKZPkEsdrhSLdUfvJm6do/MhDRf3bF2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:30.405831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47479b561617a2f2ae1dfce79d5ee15710eb13ac0c5bf47cc0c70f1c6f977381","sha256:e59b8f01497599ede68a7c80670bf0acb7f6be930fe99cc3e8a64fa56dce0ecf"],"state_sha256":"9f69247896a9c40de0fee11d73ebdd676512c5709f6ec2f830885859592e292f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHAM3po/rvuaF3exousabr1KHfiv5idq1aRlLSmh3L9nTZ56hg36enRmwybt8dITnsUhf5/wLYri/5Z5ag5CBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:00:20.009781Z","bundle_sha256":"05b164da907c9c224100fe16a681befc878e39b9f5775ad086703df56aa7166c"}}