{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5R2U6JQD4QEP4C2Y3UN2CQZFVR","short_pith_number":"pith:5R2U6JQD","canonical_record":{"source":{"id":"1308.1993","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-08T22:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"f2e088b4b64934bf789579fb7afc36ddb959cfb2feac9371e3c0078cc08f5fb8","abstract_canon_sha256":"5c336de83a5048d2237b82aaa1dc144692c236b8ed5c2a9647c2773879577bf4"},"schema_version":"1.0"},"canonical_sha256":"ec754f2603e408fe0b58dd1ba14325ac6871bbdbbdd3260fd4a6dc3b78e44ebd","source":{"kind":"arxiv","id":"1308.1993","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1993","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1993v3","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1993","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"5R2U6JQD4QEP","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5R2U6JQD4QEP4C2Y","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5R2U6JQD","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5R2U6JQD4QEP4C2Y3UN2CQZFVR","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1993","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-08T22:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"f2e088b4b64934bf789579fb7afc36ddb959cfb2feac9371e3c0078cc08f5fb8","abstract_canon_sha256":"5c336de83a5048d2237b82aaa1dc144692c236b8ed5c2a9647c2773879577bf4"},"schema_version":"1.0"},"canonical_sha256":"ec754f2603e408fe0b58dd1ba14325ac6871bbdbbdd3260fd4a6dc3b78e44ebd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.353450Z","signature_b64":"Ki60fLn/O7mKs/UNBrjz03CrvW02h4mmv08P04XmrW+LuG3PL2sccPr3sZs+Z7dDFp6bL584fM/GNakW4JpGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec754f2603e408fe0b58dd1ba14325ac6871bbdbbdd3260fd4a6dc3b78e44ebd","last_reissued_at":"2026-05-18T02:52:32.352950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.352950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1993","source_version":3,"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-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kpF8JXI8q7pjAeDB5ZMrpNRZaZfPfMw8/ruw7lCgn6YG68W93e9K2hN75Hu3dbifBRP5A+isOHgE2EYloQzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:14:49.399192Z"},"content_sha256":"f083ad3ac62873baccebacb40d6211f556b0dcd7107bd7986eef5731858b9f43","schema_version":"1.0","event_id":"sha256:f083ad3ac62873baccebacb40d6211f556b0dcd7107bd7986eef5731858b9f43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5R2U6JQD4QEP4C2Y3UN2CQZFVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Optimality and Overload Behavior of Dynamical Flow Networks under Monotone Distributed Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Enrico Lovisari, Giacomo Como, Ketan Savla","submitted_at":"2013-08-08T22:27:31Z","abstract_excerpt":"The paper investigates the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies. The networks are modeled as systems of ODEs based on mass conversation laws on directed graphs with limited flow capacities on the links and constant external inflows at certain origin nodes. Under monotonicity assumptions on the routing policies, it is proven that a globally asymptotically stable equilibrium exists so that the network achieves maximal throughput, provided that no cut capacity constraint is violated by the external inflows. On the contra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1993","kind":"arxiv","version":3},"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-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbVhVYkoBhyBNaN3Rf3YUqKTxnjrpcETpl+OHr/Dm9tyCz+LMqzUJUSXtMIyCdBuUT6namBq4B95yaIUnpvfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:14:49.399907Z"},"content_sha256":"cea7cf706706fe2fefa34aad05eb8b898fa4c02c5eb7651e11a1b0def0262814","schema_version":"1.0","event_id":"sha256:cea7cf706706fe2fefa34aad05eb8b898fa4c02c5eb7651e11a1b0def0262814"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR/bundle.json","state_url":"https://pith.science/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR/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-08T05:14:49Z","links":{"resolver":"https://pith.science/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR","bundle":"https://pith.science/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR/bundle.json","state":"https://pith.science/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5R2U6JQD4QEP4C2Y3UN2CQZFVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5R2U6JQD4QEP4C2Y3UN2CQZFVR","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":"5c336de83a5048d2237b82aaa1dc144692c236b8ed5c2a9647c2773879577bf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-08T22:27:31Z","title_canon_sha256":"f2e088b4b64934bf789579fb7afc36ddb959cfb2feac9371e3c0078cc08f5fb8"},"schema_version":"1.0","source":{"id":"1308.1993","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1993","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1993v3","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1993","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"5R2U6JQD4QEP","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5R2U6JQD4QEP4C2Y","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5R2U6JQD","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:cea7cf706706fe2fefa34aad05eb8b898fa4c02c5eb7651e11a1b0def0262814","target":"graph","created_at":"2026-05-18T02:52:32Z","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":"The paper investigates the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies. The networks are modeled as systems of ODEs based on mass conversation laws on directed graphs with limited flow capacities on the links and constant external inflows at certain origin nodes. Under monotonicity assumptions on the routing policies, it is proven that a globally asymptotically stable equilibrium exists so that the network achieves maximal throughput, provided that no cut capacity constraint is violated by the external inflows. On the contra","authors_text":"Enrico Lovisari, Giacomo Como, Ketan Savla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-08T22:27:31Z","title":"Throughput Optimality and Overload Behavior of Dynamical Flow Networks under Monotone Distributed Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1993","kind":"arxiv","version":3},"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:f083ad3ac62873baccebacb40d6211f556b0dcd7107bd7986eef5731858b9f43","target":"record","created_at":"2026-05-18T02:52:32Z","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":"5c336de83a5048d2237b82aaa1dc144692c236b8ed5c2a9647c2773879577bf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-08T22:27:31Z","title_canon_sha256":"f2e088b4b64934bf789579fb7afc36ddb959cfb2feac9371e3c0078cc08f5fb8"},"schema_version":"1.0","source":{"id":"1308.1993","kind":"arxiv","version":3}},"canonical_sha256":"ec754f2603e408fe0b58dd1ba14325ac6871bbdbbdd3260fd4a6dc3b78e44ebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec754f2603e408fe0b58dd1ba14325ac6871bbdbbdd3260fd4a6dc3b78e44ebd","first_computed_at":"2026-05-18T02:52:32.352950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:32.352950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ki60fLn/O7mKs/UNBrjz03CrvW02h4mmv08P04XmrW+LuG3PL2sccPr3sZs+Z7dDFp6bL584fM/GNakW4JpGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:32.353450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1993","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f083ad3ac62873baccebacb40d6211f556b0dcd7107bd7986eef5731858b9f43","sha256:cea7cf706706fe2fefa34aad05eb8b898fa4c02c5eb7651e11a1b0def0262814"],"state_sha256":"4ce4ab0846ee7a8809f2424e42b9572dc193c96ff4db9336f088f2fbc59aa7e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wC+7CDbJQJqQ2v2jwg3ZxMo/i0LMhNlGq8htqhXqCeA/VNX2Rk4/QXzLT7a3pvOuSgdY6V3cztcp7tLp8c6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:14:49.403898Z","bundle_sha256":"4245340d90a56b6921d0d453ae9cb9bfc0ea15827d930c9b7344203eddd2cbc1"}}