{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5FFL4H6EAM3IWGVW4T2QYRZMTP","short_pith_number":"pith:5FFL4H6E","canonical_record":{"source":{"id":"1102.1107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-02-05T23:12:19Z","cross_cats_sorted":["math.CA","math.DS","math.OC","nlin.AO"],"title_canon_sha256":"f77ef3c74e67a8bb0664b29b426da24a10b9522e6eed38ed83958bd375f90819","abstract_canon_sha256":"19f9d5dd2fc388fa7170cf33a75646d3dac71f6aa44be07793e6def70e28d545"},"schema_version":"1.0"},"canonical_sha256":"e94abe1fc403368b1ab6e4f50c472c9bfdbd7c1c80b0c02ab5a021a4c7453db1","source":{"kind":"arxiv","id":"1102.1107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1107","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1107v2","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1107","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"5FFL4H6EAM3I","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5FFL4H6EAM3IWGVW","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5FFL4H6E","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5FFL4H6EAM3IWGVW4T2QYRZMTP","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-02-05T23:12:19Z","cross_cats_sorted":["math.CA","math.DS","math.OC","nlin.AO"],"title_canon_sha256":"f77ef3c74e67a8bb0664b29b426da24a10b9522e6eed38ed83958bd375f90819","abstract_canon_sha256":"19f9d5dd2fc388fa7170cf33a75646d3dac71f6aa44be07793e6def70e28d545"},"schema_version":"1.0"},"canonical_sha256":"e94abe1fc403368b1ab6e4f50c472c9bfdbd7c1c80b0c02ab5a021a4c7453db1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:48.004851Z","signature_b64":"QcG22eSKbTr0kX3K95RIjLUmeVYT2lw2+G42M4TIU/ScoU+DtrMegkKL7youyRbZa+W/fl7QC0KsmfAVAFkpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e94abe1fc403368b1ab6e4f50c472c9bfdbd7c1c80b0c02ab5a021a4c7453db1","last_reissued_at":"2026-05-18T03:54:48.004248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:48.004248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1107","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-18T03:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sA81jG4CFPT5xX6snbvu6bM6w4+ZeBUzvLVapHcJNJwDr4C/q+6kvE58R/z90oQsX/tnJuGoNETTBUfVSX36DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:24:13.309658Z"},"content_sha256":"e48397fefd4c604c0ff12aabada505ca864446e18793cce22b8c8ab881c592cc","schema_version":"1.0","event_id":"sha256:e48397fefd4c604c0ff12aabada505ca864446e18793cce22b8c8ab881c592cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5FFL4H6EAM3IWGVW4T2QYRZMTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Distributed Routing in Dynamical Flow Networks - Part I: Locally Responsive Policies and Weak Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.DS","math.OC","nlin.AO"],"primary_cat":"cs.SY","authors_text":"Daron Acemoglu, Emilio Frazzoli, Giacomo Como, Ketan Savla, Munther A. Dahleh","submitted_at":"2011-02-05T23:12:19Z","abstract_excerpt":"Robustness of distributed routing policies is studied for dynamical flow networks, with respect to adversarial disturbances that reduce the link flow capacities. A dynamical flow network is modeled as a system of ordinary differential equations derived from mass conservation laws on a directed acyclic graph with a single origin-destination pair and a constant inflow at the origin. Routing policies regulate the way the inflow at a non-destination node gets split among its outgoing links as a function of the current particle density, while the outflow of a link is modeled to depend on the curren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1107","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-18T03:54:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgrTWkQ/pChIFnDrTiCY3b899h+XzXt7A+Cv2rnBnRjC0EuPeFoFVVPn1p6Gu/K6T+7/G4Kc6E2dA4NwwJMLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:24:13.310006Z"},"content_sha256":"fc5ec5c016e70c5237b2b59154be1a34794b29e5f6e4865f0dc93cac4cc8e063","schema_version":"1.0","event_id":"sha256:fc5ec5c016e70c5237b2b59154be1a34794b29e5f6e4865f0dc93cac4cc8e063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP/bundle.json","state_url":"https://pith.science/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP/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-28T07:24:13Z","links":{"resolver":"https://pith.science/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP","bundle":"https://pith.science/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP/bundle.json","state":"https://pith.science/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FFL4H6EAM3IWGVW4T2QYRZMTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5FFL4H6EAM3IWGVW4T2QYRZMTP","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":"19f9d5dd2fc388fa7170cf33a75646d3dac71f6aa44be07793e6def70e28d545","cross_cats_sorted":["math.CA","math.DS","math.OC","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-02-05T23:12:19Z","title_canon_sha256":"f77ef3c74e67a8bb0664b29b426da24a10b9522e6eed38ed83958bd375f90819"},"schema_version":"1.0","source":{"id":"1102.1107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1107","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1107v2","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1107","created_at":"2026-05-18T03:54:48Z"},{"alias_kind":"pith_short_12","alias_value":"5FFL4H6EAM3I","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5FFL4H6EAM3IWGVW","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5FFL4H6E","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:fc5ec5c016e70c5237b2b59154be1a34794b29e5f6e4865f0dc93cac4cc8e063","target":"graph","created_at":"2026-05-18T03:54:48Z","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":"Robustness of distributed routing policies is studied for dynamical flow networks, with respect to adversarial disturbances that reduce the link flow capacities. A dynamical flow network is modeled as a system of ordinary differential equations derived from mass conservation laws on a directed acyclic graph with a single origin-destination pair and a constant inflow at the origin. Routing policies regulate the way the inflow at a non-destination node gets split among its outgoing links as a function of the current particle density, while the outflow of a link is modeled to depend on the curren","authors_text":"Daron Acemoglu, Emilio Frazzoli, Giacomo Como, Ketan Savla, Munther A. Dahleh","cross_cats":["math.CA","math.DS","math.OC","nlin.AO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-02-05T23:12:19Z","title":"Robust Distributed Routing in Dynamical Flow Networks - Part I: Locally Responsive Policies and Weak Resilience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1107","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:e48397fefd4c604c0ff12aabada505ca864446e18793cce22b8c8ab881c592cc","target":"record","created_at":"2026-05-18T03:54:48Z","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":"19f9d5dd2fc388fa7170cf33a75646d3dac71f6aa44be07793e6def70e28d545","cross_cats_sorted":["math.CA","math.DS","math.OC","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-02-05T23:12:19Z","title_canon_sha256":"f77ef3c74e67a8bb0664b29b426da24a10b9522e6eed38ed83958bd375f90819"},"schema_version":"1.0","source":{"id":"1102.1107","kind":"arxiv","version":2}},"canonical_sha256":"e94abe1fc403368b1ab6e4f50c472c9bfdbd7c1c80b0c02ab5a021a4c7453db1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e94abe1fc403368b1ab6e4f50c472c9bfdbd7c1c80b0c02ab5a021a4c7453db1","first_computed_at":"2026-05-18T03:54:48.004248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:48.004248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QcG22eSKbTr0kX3K95RIjLUmeVYT2lw2+G42M4TIU/ScoU+DtrMegkKL7youyRbZa+W/fl7QC0KsmfAVAFkpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:48.004851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e48397fefd4c604c0ff12aabada505ca864446e18793cce22b8c8ab881c592cc","sha256:fc5ec5c016e70c5237b2b59154be1a34794b29e5f6e4865f0dc93cac4cc8e063"],"state_sha256":"087db9abbe0ea8880fdc980eeb0fa3461a9e8b8b1696b9e568491ad9ffc57541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrw2q7eIwvk5Xbe+iUwhplT/yfPs4polHpmWVTG5pMo2ro0WBZRkJL/Bl5oc2vwghZcKGluzWbAmbzT5ACYVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:24:13.311922Z","bundle_sha256":"61bce6623e9bc7b704cb0b91e7cc199acd432bf7234125eb4cb21854d2041dca"}}