{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RCO3YLYLWLVEB73JTE2RLDMPAB","short_pith_number":"pith:RCO3YLYL","canonical_record":{"source":{"id":"1704.05684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-19T10:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"ee1c7c0728377bbd28c0c385e5e6fffa6e297fc9842b8d5a81a17d6b3080e2a7","abstract_canon_sha256":"a8a2ea7a4133325a5ef26672259a87c93f87612fdb8f6a561801137d2f8f194e"},"schema_version":"1.0"},"canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","source":{"kind":"arxiv","id":"1704.05684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05684","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05684v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05684","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"RCO3YLYLWLVE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCO3YLYLWLVEB73J","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCO3YLYL","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RCO3YLYLWLVEB73JTE2RLDMPAB","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-19T10:50:41Z","cross_cats_sorted":[],"title_canon_sha256":"ee1c7c0728377bbd28c0c385e5e6fffa6e297fc9842b8d5a81a17d6b3080e2a7","abstract_canon_sha256":"a8a2ea7a4133325a5ef26672259a87c93f87612fdb8f6a561801137d2f8f194e"},"schema_version":"1.0"},"canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.790224Z","signature_b64":"J4IMUevVGtZcCJz7r/F/HGa2Goijp5Rf27RcA+vzpvuY+03RRECfwSh9vY/RWukFg+9QVz72m0pk3QWdChJuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","last_reissued_at":"2026-05-18T00:46:06.789623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.789623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05684","source_version":1,"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:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSJmiacI5YsrkMvRCqtQfC7GL6DZw4yfCpZNElieGMWq3DdQZtcieDgsU/K4deibwXMnah9lVzNfgG8jKd/DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:32:34.578923Z"},"content_sha256":"9049ad8f3420c29cbb47af9245b99e12665c9129df79923ec5dd95e74f980bf8","schema_version":"1.0","event_id":"sha256:9049ad8f3420c29cbb47af9245b99e12665c9129df79923ec5dd95e74f980bf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RCO3YLYLWLVEB73JTE2RLDMPAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Scheduling Algorithm to Provide Quality-of-Service in Multihop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ashok Krishnan K.S., Vinod Sharma","submitted_at":"2017-04-19T10:50:41Z","abstract_excerpt":"Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid limits of queues, an algorithm that meets delay requirements to various flows in a network is constructed. The algorithm involves an optimization which is implemented in a cyclic distributed manner across nodes by using the technique of iterative gradient ascent, with minimal information exchange between nodes. The algorithm uses time varying weights to give prio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05684","kind":"arxiv","version":1},"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:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5tc3k72ekJN9oh7Y7vjAOTqbpTstuDUh1VNTzlFMIgeJr/E7InnI/ws/7XCD9yNhyRBj5c21xeMirOu89tZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:32:34.579269Z"},"content_sha256":"090404399548ba91286b62a099f1de66e74a89b55c632a8ca990038e1afd786b","schema_version":"1.0","event_id":"sha256:090404399548ba91286b62a099f1de66e74a89b55c632a8ca990038e1afd786b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/bundle.json","state_url":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/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-31T23:32:34Z","links":{"resolver":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB","bundle":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/bundle.json","state":"https://pith.science/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCO3YLYLWLVEB73JTE2RLDMPAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RCO3YLYLWLVEB73JTE2RLDMPAB","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":"a8a2ea7a4133325a5ef26672259a87c93f87612fdb8f6a561801137d2f8f194e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-19T10:50:41Z","title_canon_sha256":"ee1c7c0728377bbd28c0c385e5e6fffa6e297fc9842b8d5a81a17d6b3080e2a7"},"schema_version":"1.0","source":{"id":"1704.05684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05684","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05684v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05684","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"RCO3YLYLWLVE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RCO3YLYLWLVEB73J","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RCO3YLYL","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:090404399548ba91286b62a099f1de66e74a89b55c632a8ca990038e1afd786b","target":"graph","created_at":"2026-05-18T00:46:06Z","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":"Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid limits of queues, an algorithm that meets delay requirements to various flows in a network is constructed. The algorithm involves an optimization which is implemented in a cyclic distributed manner across nodes by using the technique of iterative gradient ascent, with minimal information exchange between nodes. The algorithm uses time varying weights to give prio","authors_text":"Ashok Krishnan K.S., Vinod Sharma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-19T10:50:41Z","title":"A Distributed Scheduling Algorithm to Provide Quality-of-Service in Multihop Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05684","kind":"arxiv","version":1},"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:9049ad8f3420c29cbb47af9245b99e12665c9129df79923ec5dd95e74f980bf8","target":"record","created_at":"2026-05-18T00:46:06Z","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":"a8a2ea7a4133325a5ef26672259a87c93f87612fdb8f6a561801137d2f8f194e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-04-19T10:50:41Z","title_canon_sha256":"ee1c7c0728377bbd28c0c385e5e6fffa6e297fc9842b8d5a81a17d6b3080e2a7"},"schema_version":"1.0","source":{"id":"1704.05684","kind":"arxiv","version":1}},"canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"889dbc2f0bb2ea40ff699935158d8f004263f1fb9a584e40eb53414252cc0642","first_computed_at":"2026-05-18T00:46:06.789623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:06.789623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J4IMUevVGtZcCJz7r/F/HGa2Goijp5Rf27RcA+vzpvuY+03RRECfwSh9vY/RWukFg+9QVz72m0pk3QWdChJuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:06.790224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9049ad8f3420c29cbb47af9245b99e12665c9129df79923ec5dd95e74f980bf8","sha256:090404399548ba91286b62a099f1de66e74a89b55c632a8ca990038e1afd786b"],"state_sha256":"91f4cbe76baf9e86aa061c33d5945c7c008500d2c6b486f6db2eeb559c7ee51d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjdadpMz3lPqZF71C3RA04QEK91yyS+LVNl1csXhefQ7K9WyLVrbSMM8igOQO25MuPfNox+qs056wsqbVmgGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:32:34.581217Z","bundle_sha256":"b221113c5bd4edce299cb790587412f0cdfd64cad6c6ee68662768b8a63bb713"}}