{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5Y7PJ2U3QFD2WKLKYLRLE5LJW7","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":"f26ac62490f4e1a3565ed29098738ba77bf0c9aa3f017346282312d69973d486","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T12:34:43Z","title_canon_sha256":"ed369c0c413be8df489f5fe7cc9cf9754105fb0ad09ff446ae43d726f481aa92"},"schema_version":"1.0","source":{"id":"1301.1002","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1002","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1002v2","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1002","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"5Y7PJ2U3QFD2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5Y7PJ2U3QFD2WKLK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5Y7PJ2U3","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:587c2ff36fcad47665f15daed1edb8c808443f09a2fde01918841eeaf8469364","target":"graph","created_at":"2026-05-18T01:33:17Z","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 resource allocation and control of multihop networks in which multiple source-destination pairs communicate confidential messages, to be kept confidential from the intermediate nodes. We pose the problem as that of network utility maximization, into which confidentiality is incorporated as an additional quality of service constraint. We develop a simple, and yet provably optimal dynamic control algorithm that combines flow control, routing and end-to-end secrecy-encoding. In order to achieve confidentiality, our scheme exploits multipath diversity and temporal divers","authors_text":"C. Emre Koksal, Ozgur Ercetin, Yunus Sarikaya","cross_cats":["cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T12:34:43Z","title":"Dynamic Network Control for Confidential Multi-hop Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1002","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:5e6727e90a2a465201244d3c052f68d8dfd53e91d9fdaec609ad12b85d2c40fb","target":"record","created_at":"2026-05-18T01:33:17Z","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":"f26ac62490f4e1a3565ed29098738ba77bf0c9aa3f017346282312d69973d486","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-06T12:34:43Z","title_canon_sha256":"ed369c0c413be8df489f5fe7cc9cf9754105fb0ad09ff446ae43d726f481aa92"},"schema_version":"1.0","source":{"id":"1301.1002","kind":"arxiv","version":2}},"canonical_sha256":"ee3ef4ea9b8147ab296ac2e2b27569b7de00de6a054b4f8aa4dab3e61085fd99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee3ef4ea9b8147ab296ac2e2b27569b7de00de6a054b4f8aa4dab3e61085fd99","first_computed_at":"2026-05-18T01:33:17.001349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:17.001349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tKgZWcvrK2UaFUl499kG9ksr1nlaNSlips1PTGPwXuAIVdpfjH9mTvGQx+YfmKuOTYim+8Zse73l+jyfSkO6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:17.001977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1002","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e6727e90a2a465201244d3c052f68d8dfd53e91d9fdaec609ad12b85d2c40fb","sha256:587c2ff36fcad47665f15daed1edb8c808443f09a2fde01918841eeaf8469364"],"state_sha256":"82dd063f142a491c6c7f1b9fe6aabdeb690007b8bb0c08f74dc61c98f36f9b06"}