{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QHR4PIBMNABDB7AVCZWBDISXPP","short_pith_number":"pith:QHR4PIBM","canonical_record":{"source":{"id":"1805.10527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-26T19:21:54Z","cross_cats_sorted":[],"title_canon_sha256":"94e3d1254e00b65478f6042c862b88548585517e6d9d080b679c579e3050b7a4","abstract_canon_sha256":"9f6bfc0c27ff7bf00458ea2ca3c332149b593460ae50cd730a1d7666e53e6fdc"},"schema_version":"1.0"},"canonical_sha256":"81e3c7a02c680230fc15166c11a2577bf53c2ba1d66527a3405cc5f9ca9b20da","source":{"kind":"arxiv","id":"1805.10527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10527","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10527v2","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10527","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"QHR4PIBMNABD","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QHR4PIBMNABDB7AV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QHR4PIBM","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QHR4PIBMNABDB7AVCZWBDISXPP","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-26T19:21:54Z","cross_cats_sorted":[],"title_canon_sha256":"94e3d1254e00b65478f6042c862b88548585517e6d9d080b679c579e3050b7a4","abstract_canon_sha256":"9f6bfc0c27ff7bf00458ea2ca3c332149b593460ae50cd730a1d7666e53e6fdc"},"schema_version":"1.0"},"canonical_sha256":"81e3c7a02c680230fc15166c11a2577bf53c2ba1d66527a3405cc5f9ca9b20da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:30.512504Z","signature_b64":"ObgzzT71mGj+OMb01sB7zXAoFzBBUXuhrA3Jx6h5kWkzimc/C5VQ3ygpbLPU2o5h+xPpplppNoOrqck7xe3aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e3c7a02c680230fc15166c11a2577bf53c2ba1d66527a3405cc5f9ca9b20da","last_reissued_at":"2026-05-17T23:42:30.511782Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:30.511782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10527","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-17T23:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+s7bnLjnGY01SjTGhf3mB/QM7JHRqYcIwDT5kbqtltT/WY2XdgEKNQNduSLhR3vNGziB7Arj1BYi2v6ljoPiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:21:41.102161Z"},"content_sha256":"9b81401470c5f4d5eb18b6a668dd0135faae253501c2076924654b79ee82724c","schema_version":"1.0","event_id":"sha256:9b81401470c5f4d5eb18b6a668dd0135faae253501c2076924654b79ee82724c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QHR4PIBMNABDB7AVCZWBDISXPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Antonia Tulino, Eytan Modiano, Jaime Llorca, Jianan Zhang","submitted_at":"2018-05-26T19:21:54Z","abstract_excerpt":"Distributed computing networks, tasked with both packet transmission and processing, require the joint optimization of communication and computation resources. We develop a dynamic control policy that determines both routes and processing locations for packets upon their arrival at a distributed computing network. The proposed policy, referred to as Universal Computing Network Control (UCNC), guarantees that packets i) are processed by a specified chain of service functions, ii) follow cycle-free routes between consecutive functions, and iii) are delivered to their corresponding set of destina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10527","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-17T23:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61J8g+OPp0cMqhFiFeJeNVgtCy5amgxCUISXzie2BcOHO702+fqs/s04IzAiZ4AyjL5b/vTSXsIXiy0NlzU8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:21:41.102814Z"},"content_sha256":"ca3783421be6d982b740d1b9750a9aaed70d09abbd476042370f64e7360fd2ce","schema_version":"1.0","event_id":"sha256:ca3783421be6d982b740d1b9750a9aaed70d09abbd476042370f64e7360fd2ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHR4PIBMNABDB7AVCZWBDISXPP/bundle.json","state_url":"https://pith.science/pith/QHR4PIBMNABDB7AVCZWBDISXPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHR4PIBMNABDB7AVCZWBDISXPP/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:21:41Z","links":{"resolver":"https://pith.science/pith/QHR4PIBMNABDB7AVCZWBDISXPP","bundle":"https://pith.science/pith/QHR4PIBMNABDB7AVCZWBDISXPP/bundle.json","state":"https://pith.science/pith/QHR4PIBMNABDB7AVCZWBDISXPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHR4PIBMNABDB7AVCZWBDISXPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QHR4PIBMNABDB7AVCZWBDISXPP","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":"9f6bfc0c27ff7bf00458ea2ca3c332149b593460ae50cd730a1d7666e53e6fdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-26T19:21:54Z","title_canon_sha256":"94e3d1254e00b65478f6042c862b88548585517e6d9d080b679c579e3050b7a4"},"schema_version":"1.0","source":{"id":"1805.10527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10527","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10527v2","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10527","created_at":"2026-05-17T23:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"QHR4PIBMNABD","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QHR4PIBMNABDB7AV","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QHR4PIBM","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:ca3783421be6d982b740d1b9750a9aaed70d09abbd476042370f64e7360fd2ce","target":"graph","created_at":"2026-05-17T23:42:30Z","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":"Distributed computing networks, tasked with both packet transmission and processing, require the joint optimization of communication and computation resources. We develop a dynamic control policy that determines both routes and processing locations for packets upon their arrival at a distributed computing network. The proposed policy, referred to as Universal Computing Network Control (UCNC), guarantees that packets i) are processed by a specified chain of service functions, ii) follow cycle-free routes between consecutive functions, and iii) are delivered to their corresponding set of destina","authors_text":"Abhishek Sinha, Antonia Tulino, Eytan Modiano, Jaime Llorca, Jianan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-26T19:21:54Z","title":"Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10527","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:9b81401470c5f4d5eb18b6a668dd0135faae253501c2076924654b79ee82724c","target":"record","created_at":"2026-05-17T23:42:30Z","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":"9f6bfc0c27ff7bf00458ea2ca3c332149b593460ae50cd730a1d7666e53e6fdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-26T19:21:54Z","title_canon_sha256":"94e3d1254e00b65478f6042c862b88548585517e6d9d080b679c579e3050b7a4"},"schema_version":"1.0","source":{"id":"1805.10527","kind":"arxiv","version":2}},"canonical_sha256":"81e3c7a02c680230fc15166c11a2577bf53c2ba1d66527a3405cc5f9ca9b20da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81e3c7a02c680230fc15166c11a2577bf53c2ba1d66527a3405cc5f9ca9b20da","first_computed_at":"2026-05-17T23:42:30.511782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:30.511782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ObgzzT71mGj+OMb01sB7zXAoFzBBUXuhrA3Jx6h5kWkzimc/C5VQ3ygpbLPU2o5h+xPpplppNoOrqck7xe3aBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:30.512504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b81401470c5f4d5eb18b6a668dd0135faae253501c2076924654b79ee82724c","sha256:ca3783421be6d982b740d1b9750a9aaed70d09abbd476042370f64e7360fd2ce"],"state_sha256":"192b3a726953cf0e416714796404098a8412ddfd718fa6e2efaf44059ba0c8d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MftQHxmIdf8osGPe9VUFbXDXLiGrA8jMfWm93jqWfcNVXW7HcrCIFnvBgmy//IzvqaMh4YnkBvquYSOI0DQ0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:21:41.105970Z","bundle_sha256":"ceb00c28eb647c32ae5b09f16b5cfefc72c18e6bbb59475b7f19d0ec45b3e2d3"}}