{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NUSSHFGDE3TWHTO5SYHJLISQAM","short_pith_number":"pith:NUSSHFGD","canonical_record":{"source":{"id":"1101.4211","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-21T19:32:49Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"c4135c62c6abab52a060a4268f9bd76050955bdca7d5f872c06e449ef7d9ddd8","abstract_canon_sha256":"133a0f674437de0cf550db22619cab8dd1826b7229ababab1a01986899d866c3"},"schema_version":"1.0"},"canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","source":{"kind":"arxiv","id":"1101.4211","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4211","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4211v4","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4211","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"pith_short_12","alias_value":"NUSSHFGDE3TW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NUSSHFGDE3TWHTO5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NUSSHFGD","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NUSSHFGDE3TWHTO5SYHJLISQAM","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4211","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-21T19:32:49Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"c4135c62c6abab52a060a4268f9bd76050955bdca7d5f872c06e449ef7d9ddd8","abstract_canon_sha256":"133a0f674437de0cf550db22619cab8dd1826b7229ababab1a01986899d866c3"},"schema_version":"1.0"},"canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:43.835942Z","signature_b64":"kTtvgYCL831EuMhg1TxKi8OyKmT3h9OKXGsAGGxbQcIPjN0Q6+mfRqybUksP1n0Qydf/YuLkWv5OD1Vg0R4VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","last_reissued_at":"2026-05-18T03:53:43.835488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:43.835488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4211","source_version":4,"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-18T03:53:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQyb0kaZl4P4+aW3TLcnh+c9/SlsEzCwskdxPDpAP+fhG/MzjhHpNfMSH5MrmPToMuBoilePzs8fFzvhV8WGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:57:16.076014Z"},"content_sha256":"e6ffcc45974ed09480e7b591eb39531950124542024f9bc37eddd3517c1da3cd","schema_version":"1.0","event_id":"sha256:e6ffcc45974ed09480e7b591eb39531950124542024f9bc37eddd3517c1da3cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NUSSHFGDE3TWHTO5SYHJLISQAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.NI","authors_text":"Bo Ji, Changhee Joo, Ness B. Shroff","submitted_at":"2011-01-21T19:32:49Z","abstract_excerpt":"In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4211","kind":"arxiv","version":4},"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-18T03:53:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yPOo064RlCBwV8SoGDXYP9BLYy7t63X6ypLQ09xxtD7/HLkybDHaOL5XsawPs9tAcYuU6/Hwt9vdD59Iv2vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:57:16.076513Z"},"content_sha256":"42a1162e4b0fdd54086465577ee1af247e32a585e86c18df1e90a8575139347f","schema_version":"1.0","event_id":"sha256:42a1162e4b0fdd54086465577ee1af247e32a585e86c18df1e90a8575139347f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/bundle.json","state_url":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/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-11T03:57:16Z","links":{"resolver":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM","bundle":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/bundle.json","state":"https://pith.science/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUSSHFGDE3TWHTO5SYHJLISQAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NUSSHFGDE3TWHTO5SYHJLISQAM","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":"133a0f674437de0cf550db22619cab8dd1826b7229ababab1a01986899d866c3","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-21T19:32:49Z","title_canon_sha256":"c4135c62c6abab52a060a4268f9bd76050955bdca7d5f872c06e449ef7d9ddd8"},"schema_version":"1.0","source":{"id":"1101.4211","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4211","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4211v4","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4211","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"pith_short_12","alias_value":"NUSSHFGDE3TW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NUSSHFGDE3TWHTO5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NUSSHFGD","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:42a1162e4b0fdd54086465577ee1af247e32a585e86c18df1e90a8575139347f","target":"graph","created_at":"2026-05-18T03:53:43Z","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 consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous ","authors_text":"Bo Ji, Changhee Joo, Ness B. Shroff","cross_cats":["cs.IT","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-21T19:32:49Z","title":"Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4211","kind":"arxiv","version":4},"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:e6ffcc45974ed09480e7b591eb39531950124542024f9bc37eddd3517c1da3cd","target":"record","created_at":"2026-05-18T03:53:43Z","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":"133a0f674437de0cf550db22619cab8dd1826b7229ababab1a01986899d866c3","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-01-21T19:32:49Z","title_canon_sha256":"c4135c62c6abab52a060a4268f9bd76050955bdca7d5f872c06e449ef7d9ddd8"},"schema_version":"1.0","source":{"id":"1101.4211","kind":"arxiv","version":4}},"canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d252394c326e763cddd960e95a250032485872974cf7f0a4fe17ab9bcb3640d","first_computed_at":"2026-05-18T03:53:43.835488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:43.835488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kTtvgYCL831EuMhg1TxKi8OyKmT3h9OKXGsAGGxbQcIPjN0Q6+mfRqybUksP1n0Qydf/YuLkWv5OD1Vg0R4VBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:43.835942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4211","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6ffcc45974ed09480e7b591eb39531950124542024f9bc37eddd3517c1da3cd","sha256:42a1162e4b0fdd54086465577ee1af247e32a585e86c18df1e90a8575139347f"],"state_sha256":"c141d4aa79610df2f9015651b524493b061698acac00be49a9ec5ca01e534324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Et5JrNcAzzK/LRl59hZd5fUlvr79R4vPYgt7HHnu2yg0wvcL63K9QA+paJZ7oTJMWT97ovfSbzqAHnHANs+fBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:57:16.080198Z","bundle_sha256":"8e854cc95e51c49a6a5c600032a2f88f41c3e05d410c385794bab4883bc2cc4d"}}