{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CEYLWGPYTHTZ6Y7RW3HIKS2DQH","short_pith_number":"pith:CEYLWGPY","canonical_record":{"source":{"id":"1712.08672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-22T22:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"8fae048a7ff928a26703516d28c57f9a51d888ce19ad040161f971a06fc6f274","abstract_canon_sha256":"fda4bf73f74e218dd2fd385b4db804908bdbaad4076674d62d2e90b910668fac"},"schema_version":"1.0"},"canonical_sha256":"1130bb19f899e79f63f1b6ce854b4381c54106a38dadcb91411a7e854e300bed","source":{"kind":"arxiv","id":"1712.08672","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08672","created_at":"2026-05-18T00:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08672v2","created_at":"2026-05-18T00:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08672","created_at":"2026-05-18T00:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"CEYLWGPYTHTZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEYLWGPYTHTZ6Y7R","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEYLWGPY","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CEYLWGPYTHTZ6Y7RW3HIKS2DQH","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-22T22:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"8fae048a7ff928a26703516d28c57f9a51d888ce19ad040161f971a06fc6f274","abstract_canon_sha256":"fda4bf73f74e218dd2fd385b4db804908bdbaad4076674d62d2e90b910668fac"},"schema_version":"1.0"},"canonical_sha256":"1130bb19f899e79f63f1b6ce854b4381c54106a38dadcb91411a7e854e300bed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:08.813437Z","signature_b64":"0hZ0vjMUrFyCUel3MuffoZnTQxyZI9JKSPve/Bpoetf/s5SzghxQf3OjH6TLAgTb7Ty60PFz8p2Pc2AHCTmlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1130bb19f899e79f63f1b6ce854b4381c54106a38dadcb91411a7e854e300bed","last_reissued_at":"2026-05-18T00:27:08.812587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:08.812587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08672","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-18T00:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJpWAXoKPcRDpuo7FzHb/fkbETlqzN8X/DtyBuMi7d38+vpJz/zx0JXKsSA8cWs70vvm74DvhkFkq2mkmmVLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:54:49.678843Z"},"content_sha256":"2713477fb97da7e9c514b2635e2a8f3377955525b30e702445e3ce3cd3783814","schema_version":"1.0","event_id":"sha256:2713477fb97da7e9c514b2635e2a8f3377955525b30e702445e3ce3cd3783814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CEYLWGPYTHTZ6Y7RW3HIKS2DQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Utility Maximization in Adversarial Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Eytan Modiano, Qingkai Liang","submitted_at":"2017-12-22T22:20:09Z","abstract_excerpt":"Stochastic models have been dominant in network optimization theory for over two decades, due to their analytical tractability. However, these models fail to capture non-stationary or even adversarial network dynamics which are of increasing importance for modeling the behavior of networks under malicious attacks or characterizing short-term transient behavior. In this paper, we consider the network utility maximization problem in adversarial network settings. In particular, we focus on the tradeoffs between total queue length and utility regret which measures the difference in network utility"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08672","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-18T00:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAjCzeyCOvFw2YCWkf31oddzP825QsJSaz/zR8xEAjCaYBadNW28rQ+wNtRWiENFN6GdVjirtLdWF/aKf8wYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:54:49.679488Z"},"content_sha256":"65e8cd310772e28fe70b2bc098337540ceb345c7414d027674cb63f553b37de9","schema_version":"1.0","event_id":"sha256:65e8cd310772e28fe70b2bc098337540ceb345c7414d027674cb63f553b37de9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH/bundle.json","state_url":"https://pith.science/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH/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-27T20:54:49Z","links":{"resolver":"https://pith.science/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH","bundle":"https://pith.science/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH/bundle.json","state":"https://pith.science/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEYLWGPYTHTZ6Y7RW3HIKS2DQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CEYLWGPYTHTZ6Y7RW3HIKS2DQH","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":"fda4bf73f74e218dd2fd385b4db804908bdbaad4076674d62d2e90b910668fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-22T22:20:09Z","title_canon_sha256":"8fae048a7ff928a26703516d28c57f9a51d888ce19ad040161f971a06fc6f274"},"schema_version":"1.0","source":{"id":"1712.08672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08672","created_at":"2026-05-18T00:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08672v2","created_at":"2026-05-18T00:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08672","created_at":"2026-05-18T00:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"CEYLWGPYTHTZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEYLWGPYTHTZ6Y7R","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEYLWGPY","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:65e8cd310772e28fe70b2bc098337540ceb345c7414d027674cb63f553b37de9","target":"graph","created_at":"2026-05-18T00:27:08Z","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":"Stochastic models have been dominant in network optimization theory for over two decades, due to their analytical tractability. However, these models fail to capture non-stationary or even adversarial network dynamics which are of increasing importance for modeling the behavior of networks under malicious attacks or characterizing short-term transient behavior. In this paper, we consider the network utility maximization problem in adversarial network settings. In particular, we focus on the tradeoffs between total queue length and utility regret which measures the difference in network utility","authors_text":"Eytan Modiano, Qingkai Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-22T22:20:09Z","title":"Network Utility Maximization in Adversarial Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08672","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:2713477fb97da7e9c514b2635e2a8f3377955525b30e702445e3ce3cd3783814","target":"record","created_at":"2026-05-18T00:27:08Z","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":"fda4bf73f74e218dd2fd385b4db804908bdbaad4076674d62d2e90b910668fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-12-22T22:20:09Z","title_canon_sha256":"8fae048a7ff928a26703516d28c57f9a51d888ce19ad040161f971a06fc6f274"},"schema_version":"1.0","source":{"id":"1712.08672","kind":"arxiv","version":2}},"canonical_sha256":"1130bb19f899e79f63f1b6ce854b4381c54106a38dadcb91411a7e854e300bed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1130bb19f899e79f63f1b6ce854b4381c54106a38dadcb91411a7e854e300bed","first_computed_at":"2026-05-18T00:27:08.812587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:08.812587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0hZ0vjMUrFyCUel3MuffoZnTQxyZI9JKSPve/Bpoetf/s5SzghxQf3OjH6TLAgTb7Ty60PFz8p2Pc2AHCTmlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:08.813437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2713477fb97da7e9c514b2635e2a8f3377955525b30e702445e3ce3cd3783814","sha256:65e8cd310772e28fe70b2bc098337540ceb345c7414d027674cb63f553b37de9"],"state_sha256":"d0d5e13425902765a4f17ab97152aa9e0d05e04e316582979ba7645cbfc77157"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrJQ27le4Z7KZ45dgrcZxBLn+b4gC/9m0PqGhxCbqU/PY2VP8is0ai4WhiO8oEFR5/mfULVo3RC5Oc3ICRIWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:54:49.682708Z","bundle_sha256":"df3795929abe39c8b8b2d0573cb5c0b27a1bdc981e163b65354b6da83645e7d7"}}