{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:O6LVDRRTHJ7F2OECI5UZLHZJIJ","short_pith_number":"pith:O6LVDRRT","canonical_record":{"source":{"id":"0908.1273","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-10T06:54:38Z","cross_cats_sorted":["cs.NI","cs.SY"],"title_canon_sha256":"13fcc146d9e69f51b4edd7778815a92cba2d5bf9d7d0d442a030e2f70149e9fe","abstract_canon_sha256":"43b5e790de0be37491cac309b6fc463e62fcdc6f3e1f3613b9ca85e2ee8d12e8"},"schema_version":"1.0"},"canonical_sha256":"779751c6333a7e5d38824769959f29426eaa6a5b5b0a6a3510cfbb924a2c6f03","source":{"kind":"arxiv","id":"0908.1273","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1273","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1273v3","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1273","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"pith_short_12","alias_value":"O6LVDRRTHJ7F","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O6LVDRRTHJ7F2OEC","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O6LVDRRT","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:O6LVDRRTHJ7F2OECI5UZLHZJIJ","target":"record","payload":{"canonical_record":{"source":{"id":"0908.1273","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-10T06:54:38Z","cross_cats_sorted":["cs.NI","cs.SY"],"title_canon_sha256":"13fcc146d9e69f51b4edd7778815a92cba2d5bf9d7d0d442a030e2f70149e9fe","abstract_canon_sha256":"43b5e790de0be37491cac309b6fc463e62fcdc6f3e1f3613b9ca85e2ee8d12e8"},"schema_version":"1.0"},"canonical_sha256":"779751c6333a7e5d38824769959f29426eaa6a5b5b0a6a3510cfbb924a2c6f03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:47.755812Z","signature_b64":"tRkrXIaBkY/u+UTi67R+ik6GytudOZ7FTpAZ4wL0IWCgGBjlCV7v/FUthuTxG7xKFsqraXYtv5/kUa0/VMP7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779751c6333a7e5d38824769959f29426eaa6a5b5b0a6a3510cfbb924a2c6f03","last_reissued_at":"2026-05-18T02:24:47.755119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:47.755119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.1273","source_version":3,"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-18T02:24:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Essa8LTeSdUD0sjR7ZANa+kBxPRA9bmg6ch9uO2n47t7FGrzLv+nX+2PU68xP4IWoecccrKhNVviE0iTAXz5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:06:43.963060Z"},"content_sha256":"9a82227455a24d0ffa778c96bf0ee03f694442020b512f473b7c597bd110b90d","schema_version":"1.0","event_id":"sha256:9a82227455a24d0ffa778c96bf0ee03f694442020b512f473b7c597bd110b90d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:O6LVDRRTHJ7F2OECI5UZLHZJIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Class of Throughput Optimal Routing Policies in Multi-hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY"],"primary_cat":"math.OC","authors_text":"Hairuo Zhuang, Mohammad Naghshvar, Tara Javidi","submitted_at":"2009-08-10T06:54:38Z","abstract_excerpt":"This paper considers the problem of throughput optimal routing/scheduling in a multi-hop constrained queueing network with random connectivity whose special case includes opportunistic multi-hop wireless networks and input-queued switch fabrics. The main challenge in the design of throughput optimal routing policies is closely related to identifying appropriate and universal Lyapunov functions with negative expected drift. The few well-known throughput optimal policies in the literature are constructed using simple quadratic or exponential Lyapunov functions of the queue backlogs and as such t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1273","kind":"arxiv","version":3},"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-18T02:24:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODBzOqR/qkMz1R0KmKRi5UCn0Z5gESQdCg2VbiMroJ6lSNVIsrspVJd3W9kMiUYdb+hsPxfqprroDsV7BBAxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:06:43.963926Z"},"content_sha256":"41ba7e80b28dcd124fc42ec33b22c2605e6e99d8fe95d95e50b165d091b427a1","schema_version":"1.0","event_id":"sha256:41ba7e80b28dcd124fc42ec33b22c2605e6e99d8fe95d95e50b165d091b427a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ/bundle.json","state_url":"https://pith.science/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ/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-08T03:06:43Z","links":{"resolver":"https://pith.science/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ","bundle":"https://pith.science/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ/bundle.json","state":"https://pith.science/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6LVDRRTHJ7F2OECI5UZLHZJIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:O6LVDRRTHJ7F2OECI5UZLHZJIJ","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":"43b5e790de0be37491cac309b6fc463e62fcdc6f3e1f3613b9ca85e2ee8d12e8","cross_cats_sorted":["cs.NI","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-10T06:54:38Z","title_canon_sha256":"13fcc146d9e69f51b4edd7778815a92cba2d5bf9d7d0d442a030e2f70149e9fe"},"schema_version":"1.0","source":{"id":"0908.1273","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1273","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1273v3","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1273","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"pith_short_12","alias_value":"O6LVDRRTHJ7F","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"O6LVDRRTHJ7F2OEC","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"O6LVDRRT","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:41ba7e80b28dcd124fc42ec33b22c2605e6e99d8fe95d95e50b165d091b427a1","target":"graph","created_at":"2026-05-18T02:24:47Z","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":"This paper considers the problem of throughput optimal routing/scheduling in a multi-hop constrained queueing network with random connectivity whose special case includes opportunistic multi-hop wireless networks and input-queued switch fabrics. The main challenge in the design of throughput optimal routing policies is closely related to identifying appropriate and universal Lyapunov functions with negative expected drift. The few well-known throughput optimal policies in the literature are constructed using simple quadratic or exponential Lyapunov functions of the queue backlogs and as such t","authors_text":"Hairuo Zhuang, Mohammad Naghshvar, Tara Javidi","cross_cats":["cs.NI","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-10T06:54:38Z","title":"A General Class of Throughput Optimal Routing Policies in Multi-hop Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1273","kind":"arxiv","version":3},"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:9a82227455a24d0ffa778c96bf0ee03f694442020b512f473b7c597bd110b90d","target":"record","created_at":"2026-05-18T02:24:47Z","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":"43b5e790de0be37491cac309b6fc463e62fcdc6f3e1f3613b9ca85e2ee8d12e8","cross_cats_sorted":["cs.NI","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-10T06:54:38Z","title_canon_sha256":"13fcc146d9e69f51b4edd7778815a92cba2d5bf9d7d0d442a030e2f70149e9fe"},"schema_version":"1.0","source":{"id":"0908.1273","kind":"arxiv","version":3}},"canonical_sha256":"779751c6333a7e5d38824769959f29426eaa6a5b5b0a6a3510cfbb924a2c6f03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"779751c6333a7e5d38824769959f29426eaa6a5b5b0a6a3510cfbb924a2c6f03","first_computed_at":"2026-05-18T02:24:47.755119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:47.755119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tRkrXIaBkY/u+UTi67R+ik6GytudOZ7FTpAZ4wL0IWCgGBjlCV7v/FUthuTxG7xKFsqraXYtv5/kUa0/VMP7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:47.755812Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.1273","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a82227455a24d0ffa778c96bf0ee03f694442020b512f473b7c597bd110b90d","sha256:41ba7e80b28dcd124fc42ec33b22c2605e6e99d8fe95d95e50b165d091b427a1"],"state_sha256":"80c3c9b23a7210cea949dac9f5fe4d549c78bcfa03c2da364d538f2ba4264d5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybLPYgkTEINGhHpHTLkoOq+UKLIG7UxMHeHdlIgJ1AqPy7JH5zKux+fj/sW+socEH2IE8atJc2m1CbEfrem3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:06:43.968111Z","bundle_sha256":"f9363c6887e5af081501c64e4a139ea59e789e81cd177c1f33edd81a1d0d19a2"}}