{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2HEOFDAZCX6Z5UYUXJGE5K4HZY","short_pith_number":"pith:2HEOFDAZ","schema_version":"1.0","canonical_sha256":"d1c8e28c1915fd9ed314ba4c4eab87ce321b5173717729e837dd8331f88f1fe0","source":{"kind":"arxiv","id":"1303.3796","version":1},"attestation_state":"computed","paper":{"title":"The conservation of information, towards an axiomatized modular modeling approach to congestion control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.CA","math.OC","physics.flu-dyn"],"primary_cat":"cs.NI","authors_text":"C. Briat, E.A. Yavuz, G. Karlsson, H. Hjalmarsson, H. Sandberg, K.H. Johansson, U.T. J\\\"onsson","submitted_at":"2013-03-15T14:57:50Z","abstract_excerpt":"We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance indicators like sending/acknowledgement rates and delays are mathematically modelled by applying this law locally. Our contributions are twofold. First, we introduce a modular metamodel that is sufficiently generic to represent any network topology. The proposed model is composed of building blocks that implement mechanisms ignored by the existing ones, which c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1303.3796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-15T14:57:50Z","cross_cats_sorted":["cs.SY","math.CA","math.OC","physics.flu-dyn"],"title_canon_sha256":"02fd878371df5104a4cbc99bc10246a11129f69a528126c16f7027a1e7e63fff","abstract_canon_sha256":"a93059f8dc562b83039eaacecd6016c231a1cf7b614ef34a9220f2e07d10212d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.485190Z","signature_b64":"H+jLrXguqlyi6a+5Mi3gSzSgSEVu7ZkbsmVnDR1Yg4rh6j3FH2eIDY10O/vHEXkvy96N6NrW+MPhQX6VIOG9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c8e28c1915fd9ed314ba4c4eab87ce321b5173717729e837dd8331f88f1fe0","last_reissued_at":"2026-05-18T00:57:56.484809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.484809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The conservation of information, towards an axiomatized modular modeling approach to congestion control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.CA","math.OC","physics.flu-dyn"],"primary_cat":"cs.NI","authors_text":"C. Briat, E.A. Yavuz, G. Karlsson, H. Hjalmarsson, H. Sandberg, K.H. Johansson, U.T. J\\\"onsson","submitted_at":"2013-03-15T14:57:50Z","abstract_excerpt":"We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance indicators like sending/acknowledgement rates and delays are mathematically modelled by applying this law locally. Our contributions are twofold. First, we introduce a modular metamodel that is sufficiently generic to represent any network topology. The proposed model is composed of building blocks that implement mechanisms ignored by the existing ones, which c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3796","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.3796","created_at":"2026-05-18T00:57:56.484871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3796v1","created_at":"2026-05-18T00:57:56.484871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3796","created_at":"2026-05-18T00:57:56.484871+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HEOFDAZCX6Z","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HEOFDAZCX6Z5UYU","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HEOFDAZ","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY","json":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY.json","graph_json":"https://pith.science/api/pith-number/2HEOFDAZCX6Z5UYUXJGE5K4HZY/graph.json","events_json":"https://pith.science/api/pith-number/2HEOFDAZCX6Z5UYUXJGE5K4HZY/events.json","paper":"https://pith.science/paper/2HEOFDAZ"},"agent_actions":{"view_html":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY","download_json":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY.json","view_paper":"https://pith.science/paper/2HEOFDAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3796&json=true","fetch_graph":"https://pith.science/api/pith-number/2HEOFDAZCX6Z5UYUXJGE5K4HZY/graph.json","fetch_events":"https://pith.science/api/pith-number/2HEOFDAZCX6Z5UYUXJGE5K4HZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY/action/storage_attestation","attest_author":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY/action/author_attestation","sign_citation":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY/action/citation_signature","submit_replication":"https://pith.science/pith/2HEOFDAZCX6Z5UYUXJGE5K4HZY/action/replication_record"}},"created_at":"2026-05-18T00:57:56.484871+00:00","updated_at":"2026-05-18T00:57:56.484871+00:00"}