{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WMF73L4LWPQOLAFR63WRNDBOXJ","short_pith_number":"pith:WMF73L4L","canonical_record":{"source":{"id":"1009.4954","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-24T22:07:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00a6f60a1f24c52e75fe0c0a3621b951f822edfbed72f55e03152d63cc0dc092","abstract_canon_sha256":"cc22ea23d9a42e1e58eb583519ac77c7259d6e21b2c54560bdb3f60735f40300"},"schema_version":"1.0"},"canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","source":{"kind":"arxiv","id":"1009.4954","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4954","created_at":"2026-05-18T04:30:59Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4954v2","created_at":"2026-05-18T04:30:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4954","created_at":"2026-05-18T04:30:59Z"},{"alias_kind":"pith_short_12","alias_value":"WMF73L4LWPQO","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WMF73L4LWPQOLAFR","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WMF73L4L","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WMF73L4LWPQOLAFR63WRNDBOXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4954","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-24T22:07:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00a6f60a1f24c52e75fe0c0a3621b951f822edfbed72f55e03152d63cc0dc092","abstract_canon_sha256":"cc22ea23d9a42e1e58eb583519ac77c7259d6e21b2c54560bdb3f60735f40300"},"schema_version":"1.0"},"canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:59.520088Z","signature_b64":"wlFGxte5FGxv8pwtBIIDvlCtDeChXYh35E/EG25dXyqjKKYvRcKJu11tslm+DRT0kbbBFxFG+MFQEj4nsYafCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","last_reissued_at":"2026-05-18T04:30:59.519307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:59.519307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4954","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-18T04:30:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spf5ZXcC/MZg3lE6ybVLFSKI9wWVpBOEUvOiRS4wC/By4YJlP4N2peaWgus6HfAG9hh8Mixfn7uPl/fT52KyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:40.993178Z"},"content_sha256":"81647aa601bb478a98e00d2eb6c4a7ad60c0448f4591b7cac338f227a520625f","schema_version":"1.0","event_id":"sha256:81647aa601bb478a98e00d2eb6c4a7ad60c0448f4591b7cac338f227a520625f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WMF73L4LWPQOLAFR63WRNDBOXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongyue Xue, Eylem Ekici","submitted_at":"2010-09-24T22:07:49Z","abstract_excerpt":"In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput \"epsilon-close\" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to solve a joint congestion control, routing, and scheduling problem in a multi-hop wireless network while satisfying per-flow average end-to-end delay guarantees and minimum data rate requirements. This problem has been solved for both backlogged as well as arbitrary arrival rate systems. Moreover, we discuss the design of a class of low-complexity suboptimal algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4954","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-18T04:30:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONG3iZmXJDTGCMjCfdT4pE7x5j7kjUghnOjDA29I3gQmNYPKGRcmwH+WInWV8688N15fseBw8kzdfd440fCHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:40.993923Z"},"content_sha256":"cc2af4e17b2ca89fc7d6666e5a734234c3c02d67bbcbb7154327f2b30a32cbd8","schema_version":"1.0","event_id":"sha256:cc2af4e17b2ca89fc7d6666e5a734234c3c02d67bbcbb7154327f2b30a32cbd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/bundle.json","state_url":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/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-11T10:00:40Z","links":{"resolver":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ","bundle":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/bundle.json","state":"https://pith.science/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMF73L4LWPQOLAFR63WRNDBOXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WMF73L4LWPQOLAFR63WRNDBOXJ","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":"cc22ea23d9a42e1e58eb583519ac77c7259d6e21b2c54560bdb3f60735f40300","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-24T22:07:49Z","title_canon_sha256":"00a6f60a1f24c52e75fe0c0a3621b951f822edfbed72f55e03152d63cc0dc092"},"schema_version":"1.0","source":{"id":"1009.4954","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4954","created_at":"2026-05-18T04:30:59Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4954v2","created_at":"2026-05-18T04:30:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4954","created_at":"2026-05-18T04:30:59Z"},{"alias_kind":"pith_short_12","alias_value":"WMF73L4LWPQO","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WMF73L4LWPQOLAFR","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WMF73L4L","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:cc2af4e17b2ca89fc7d6666e5a734234c3c02d67bbcbb7154327f2b30a32cbd8","target":"graph","created_at":"2026-05-18T04:30:59Z","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":"In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput \"epsilon-close\" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to solve a joint congestion control, routing, and scheduling problem in a multi-hop wireless network while satisfying per-flow average end-to-end delay guarantees and minimum data rate requirements. This problem has been solved for both backlogged as well as arbitrary arrival rate systems. Moreover, we discuss the design of a class of low-complexity suboptimal algo","authors_text":"Dongyue Xue, Eylem Ekici","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-24T22:07:49Z","title":"Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4954","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:81647aa601bb478a98e00d2eb6c4a7ad60c0448f4591b7cac338f227a520625f","target":"record","created_at":"2026-05-18T04:30:59Z","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":"cc22ea23d9a42e1e58eb583519ac77c7259d6e21b2c54560bdb3f60735f40300","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-24T22:07:49Z","title_canon_sha256":"00a6f60a1f24c52e75fe0c0a3621b951f822edfbed72f55e03152d63cc0dc092"},"schema_version":"1.0","source":{"id":"1009.4954","kind":"arxiv","version":2}},"canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b30bfdaf8bb3e0e580b1f6ed168c2eba65c08995a15e74444ff8e040aa4450ba","first_computed_at":"2026-05-18T04:30:59.519307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:59.519307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wlFGxte5FGxv8pwtBIIDvlCtDeChXYh35E/EG25dXyqjKKYvRcKJu11tslm+DRT0kbbBFxFG+MFQEj4nsYafCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:59.520088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4954","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81647aa601bb478a98e00d2eb6c4a7ad60c0448f4591b7cac338f227a520625f","sha256:cc2af4e17b2ca89fc7d6666e5a734234c3c02d67bbcbb7154327f2b30a32cbd8"],"state_sha256":"ccdafe3495ccfeb493830411d5b13553b61ffadd0de8bca28d81d4cfea375d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6WWqtbLK4Oh3Mt3xE7QpWSB2WNGubP2s+fJ+OMNRDC3R5B6ShhM8dh8sHI2jXYQK9/Yd+0qujcZ0q7oBAfhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:00:40.997552Z","bundle_sha256":"fabf956671808d2c03ad6596560397d401f8c329dedb4a35260be42e6ab74c3e"}}