{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RJYT3DDFJAR6KXMPRX7RXNVDLX","short_pith_number":"pith:RJYT3DDF","canonical_record":{"source":{"id":"1611.08641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-26T00:11:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8d4131c14a93b82ba10bd6b9b78327658d1a6a2ade3ac95c6bf44c704884f1cc","abstract_canon_sha256":"052966dc7678337aad8c92e011d6f9bfb0ae05e311bc74d7135a53cb3d57092c"},"schema_version":"1.0"},"canonical_sha256":"8a713d8c654823e55d8f8dff1bb6a35de140644b72ae043e5e822ea6903e76d5","source":{"kind":"arxiv","id":"1611.08641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08641","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08641v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08641","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"RJYT3DDFJAR6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RJYT3DDFJAR6KXMP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RJYT3DDF","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RJYT3DDFJAR6KXMPRX7RXNVDLX","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-26T00:11:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8d4131c14a93b82ba10bd6b9b78327658d1a6a2ade3ac95c6bf44c704884f1cc","abstract_canon_sha256":"052966dc7678337aad8c92e011d6f9bfb0ae05e311bc74d7135a53cb3d57092c"},"schema_version":"1.0"},"canonical_sha256":"8a713d8c654823e55d8f8dff1bb6a35de140644b72ae043e5e822ea6903e76d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.269552Z","signature_b64":"w/hV+P5xnBODCdPbPzVOKpEYQx/gr/rirL7MaKRWkeU1fBI//ArltSqngefwXk0E5r/bMd2VJV+pJa+7acz6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a713d8c654823e55d8f8dff1bb6a35de140644b72ae043e5e822ea6903e76d5","last_reissued_at":"2026-05-18T00:56:37.268897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.268897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08641","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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMUr4ePlrudEr2i1t0NHJ+EVjj7zjUEHsWqLnzvA1QeFoAkL3073dSmqFd2QumSKIwX7oZCRKmSd/L0ZTckxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:06.065515Z"},"content_sha256":"971a37888a5f8283039a73fbaf65aadd9dd20c08967cf60f066b26018162a7cd","schema_version":"1.0","event_id":"sha256:971a37888a5f8283039a73fbaf65aadd9dd20c08967cf60f066b26018162a7cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RJYT3DDFJAR6KXMPRX7RXNVDLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Control for Generalized Network-Flow Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Abhishek Sinha, Eytan Modiano","submitted_at":"2016-11-26T00:11:52Z","abstract_excerpt":"We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless network. We propose an online dynamic policy, called Universal Max-Weight (UMW), which solves the above problem efficiently. To the best of our knowledge, UMW is the first throughput-optimal algorithm of such versatility in the context of generalized network flow problems. Conceptually, the UMW policy is derived by relaxing the precedence constraints associated with multi-hop routing, and then solving a min-cost rout"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08641","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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMNB2jXGmwe7EWjmQI/78G69qsEDFQtBDE+ruVWEYA65vvZSLvCrznHp/btVrcQ59WNDP9HqTyCcbFDqkFRkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:06.066100Z"},"content_sha256":"aa7cf20c37a325fc1ce884e32e23aeba7355bb31593f3e2d0eb1439b230276b6","schema_version":"1.0","event_id":"sha256:aa7cf20c37a325fc1ce884e32e23aeba7355bb31593f3e2d0eb1439b230276b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX/bundle.json","state_url":"https://pith.science/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX/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-27T23:20:06Z","links":{"resolver":"https://pith.science/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX","bundle":"https://pith.science/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX/bundle.json","state":"https://pith.science/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJYT3DDFJAR6KXMPRX7RXNVDLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RJYT3DDFJAR6KXMPRX7RXNVDLX","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":"052966dc7678337aad8c92e011d6f9bfb0ae05e311bc74d7135a53cb3d57092c","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-26T00:11:52Z","title_canon_sha256":"8d4131c14a93b82ba10bd6b9b78327658d1a6a2ade3ac95c6bf44c704884f1cc"},"schema_version":"1.0","source":{"id":"1611.08641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08641","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08641v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08641","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"RJYT3DDFJAR6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RJYT3DDFJAR6KXMP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RJYT3DDF","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:aa7cf20c37a325fc1ce884e32e23aeba7355bb31593f3e2d0eb1439b230276b6","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless network. We propose an online dynamic policy, called Universal Max-Weight (UMW), which solves the above problem efficiently. To the best of our knowledge, UMW is the first throughput-optimal algorithm of such versatility in the context of generalized network flow problems. Conceptually, the UMW policy is derived by relaxing the precedence constraints associated with multi-hop routing, and then solving a min-cost rout","authors_text":"Abhishek Sinha, Eytan Modiano","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-26T00:11:52Z","title":"Optimal Control for Generalized Network-Flow Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08641","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:971a37888a5f8283039a73fbaf65aadd9dd20c08967cf60f066b26018162a7cd","target":"record","created_at":"2026-05-18T00:56:37Z","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":"052966dc7678337aad8c92e011d6f9bfb0ae05e311bc74d7135a53cb3d57092c","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-26T00:11:52Z","title_canon_sha256":"8d4131c14a93b82ba10bd6b9b78327658d1a6a2ade3ac95c6bf44c704884f1cc"},"schema_version":"1.0","source":{"id":"1611.08641","kind":"arxiv","version":1}},"canonical_sha256":"8a713d8c654823e55d8f8dff1bb6a35de140644b72ae043e5e822ea6903e76d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a713d8c654823e55d8f8dff1bb6a35de140644b72ae043e5e822ea6903e76d5","first_computed_at":"2026-05-18T00:56:37.268897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.268897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w/hV+P5xnBODCdPbPzVOKpEYQx/gr/rirL7MaKRWkeU1fBI//ArltSqngefwXk0E5r/bMd2VJV+pJa+7acz6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.269552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:971a37888a5f8283039a73fbaf65aadd9dd20c08967cf60f066b26018162a7cd","sha256:aa7cf20c37a325fc1ce884e32e23aeba7355bb31593f3e2d0eb1439b230276b6"],"state_sha256":"c01852653120e9f5ac543c7d54c9be738bdb27c689cd482c47ac140575b7e1e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVPuvgZCkje11bGIQcnNpcZiZ+5/pZMOvz7osycecYm2yx6nt7OWIBZbSog1dJy3IGes/du15kAGHCWtQHdnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:20:06.069065Z","bundle_sha256":"e0c05b956dbcf63e1a8dfc49a81ff99821b93241efd47bd27714c4b13bb4c52d"}}