{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:33LH2JJOSJULM2JKBB4TL73ONL","short_pith_number":"pith:33LH2JJO","canonical_record":{"source":{"id":"1603.09278","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T17:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"b8714268fa16059ba68cfff0578b601a94f275e795f21af03160bd3dede1c802","abstract_canon_sha256":"006c9c7ec19946bfde8d107d3a42024ec7dd179b00f6c4d8d6a183233ed4160b"},"schema_version":"1.0"},"canonical_sha256":"ded67d252e9268b6692a087935ff6e6aedcd012ce24d9173662f2b0d689320b3","source":{"kind":"arxiv","id":"1603.09278","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09278","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09278v4","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09278","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"33LH2JJOSJUL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"33LH2JJOSJULM2JK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"33LH2JJO","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:33LH2JJOSJULM2JKBB4TL73ONL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09278","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T17:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"b8714268fa16059ba68cfff0578b601a94f275e795f21af03160bd3dede1c802","abstract_canon_sha256":"006c9c7ec19946bfde8d107d3a42024ec7dd179b00f6c4d8d6a183233ed4160b"},"schema_version":"1.0"},"canonical_sha256":"ded67d252e9268b6692a087935ff6e6aedcd012ce24d9173662f2b0d689320b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.496633Z","signature_b64":"/7CYX0P+cxNMjhTgzsPMQR9WGQXW0NCx1ZCayMF1iFCcCKA/lTrGeYIu43lOEI6swFZ5/iWnB6rDmRWdp+nACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded67d252e9268b6692a087935ff6e6aedcd012ce24d9173662f2b0d689320b3","last_reissued_at":"2026-05-18T00:58:09.495977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.495977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09278","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-18T00:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hsf/EgjaCmdVat8yrj4z78XEpS0bzSn+kTgnSKwPT0QBYCs8+CFZcV+4YEjJdxrHpivZFOmci7jqZpYT8CMzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:29:51.762833Z"},"content_sha256":"07373ce7f79451e4a01f0042e7742e97829e155b7d9efa185598e8e11f6ac33f","schema_version":"1.0","event_id":"sha256:07373ce7f79451e4a01f0042e7742e97829e155b7d9efa185598e8e11f6ac33f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:33LH2JJOSJULM2JKBB4TL73ONL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trust-Aware Network Utility Optimization in Multihop Wireless Networks with Delay Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Evripidis Paraskevas, John S. Baras, Tao Jiang","submitted_at":"2016-03-30T17:10:26Z","abstract_excerpt":"Many resource allocation problems can be formulated as a constrained maximization of a utility function. Network Utility Maximization (NUM) applies optimization techniques to achieve decomposition by duality or the primal-dual method. Several important problems, for example joint source rate control, routing, and scheduling design, can be optimized by using this framework. In this work, we introduce an important network security concept, \"trust\", into the NUM formulation and we integrate nodes' trust values in the optimization framework. These trust values are based on the interaction history "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09278","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-18T00:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNrkDPAXvrHzKsea1coC0gbWtbE5Qlrk+hgGCWa5XJ//spJYECIywbWdC5BF7D6P5cvZxmkr6FQqzGd6WQA5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:29:51.763214Z"},"content_sha256":"7f459807bab98645ea83f399796c329a8708d8b968604b142d086462f8820ff4","schema_version":"1.0","event_id":"sha256:7f459807bab98645ea83f399796c329a8708d8b968604b142d086462f8820ff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33LH2JJOSJULM2JKBB4TL73ONL/bundle.json","state_url":"https://pith.science/pith/33LH2JJOSJULM2JKBB4TL73ONL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33LH2JJOSJULM2JKBB4TL73ONL/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-01T09:29:51Z","links":{"resolver":"https://pith.science/pith/33LH2JJOSJULM2JKBB4TL73ONL","bundle":"https://pith.science/pith/33LH2JJOSJULM2JKBB4TL73ONL/bundle.json","state":"https://pith.science/pith/33LH2JJOSJULM2JKBB4TL73ONL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33LH2JJOSJULM2JKBB4TL73ONL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:33LH2JJOSJULM2JKBB4TL73ONL","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":"006c9c7ec19946bfde8d107d3a42024ec7dd179b00f6c4d8d6a183233ed4160b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T17:10:26Z","title_canon_sha256":"b8714268fa16059ba68cfff0578b601a94f275e795f21af03160bd3dede1c802"},"schema_version":"1.0","source":{"id":"1603.09278","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09278","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09278v4","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09278","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"33LH2JJOSJUL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"33LH2JJOSJULM2JK","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"33LH2JJO","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:7f459807bab98645ea83f399796c329a8708d8b968604b142d086462f8820ff4","target":"graph","created_at":"2026-05-18T00:58:09Z","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":"Many resource allocation problems can be formulated as a constrained maximization of a utility function. Network Utility Maximization (NUM) applies optimization techniques to achieve decomposition by duality or the primal-dual method. Several important problems, for example joint source rate control, routing, and scheduling design, can be optimized by using this framework. In this work, we introduce an important network security concept, \"trust\", into the NUM formulation and we integrate nodes' trust values in the optimization framework. These trust values are based on the interaction history ","authors_text":"Evripidis Paraskevas, John S. Baras, Tao Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T17:10:26Z","title":"Trust-Aware Network Utility Optimization in Multihop Wireless Networks with Delay Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09278","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:07373ce7f79451e4a01f0042e7742e97829e155b7d9efa185598e8e11f6ac33f","target":"record","created_at":"2026-05-18T00:58:09Z","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":"006c9c7ec19946bfde8d107d3a42024ec7dd179b00f6c4d8d6a183233ed4160b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-03-30T17:10:26Z","title_canon_sha256":"b8714268fa16059ba68cfff0578b601a94f275e795f21af03160bd3dede1c802"},"schema_version":"1.0","source":{"id":"1603.09278","kind":"arxiv","version":4}},"canonical_sha256":"ded67d252e9268b6692a087935ff6e6aedcd012ce24d9173662f2b0d689320b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ded67d252e9268b6692a087935ff6e6aedcd012ce24d9173662f2b0d689320b3","first_computed_at":"2026-05-18T00:58:09.495977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.495977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/7CYX0P+cxNMjhTgzsPMQR9WGQXW0NCx1ZCayMF1iFCcCKA/lTrGeYIu43lOEI6swFZ5/iWnB6rDmRWdp+nACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.496633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09278","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07373ce7f79451e4a01f0042e7742e97829e155b7d9efa185598e8e11f6ac33f","sha256:7f459807bab98645ea83f399796c329a8708d8b968604b142d086462f8820ff4"],"state_sha256":"72ef2effcd901bba83498e4a486f1a5b7d8ab0536c0b240a0deaf161c32468e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kyl4jE+IrnPX9SrBAuh0xNW/Kjp8k8jQZJh+xSkApnKCyU60bwZoqtblcY+8CEuJqY/Kmfbsf/CfMqGB5TuACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:29:51.765132Z","bundle_sha256":"6a840a3201c10154d74ad6af4e48d1001cc9a494a230a9c3b666e1431572610b"}}