{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TV7XL4KA2VX5QDFCAETZTE2K4N","short_pith_number":"pith:TV7XL4KA","schema_version":"1.0","canonical_sha256":"9d7f75f140d56fd80ca2012799934ae363c54568ae8a9b83ef93a03f2ed72dae","source":{"kind":"arxiv","id":"1506.02799","version":3},"attestation_state":"computed","paper":{"title":"Improved Utility-based Congestion Control for Delay-Constrained Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Laura Toni, Pascal Frossard, Sergio Mena, Stefano D'Aronco, Xiaoqing Zhu","submitted_at":"2015-06-09T07:02:31Z","abstract_excerpt":"Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to properly manage congestion events while maintaining a low end-to-end delay is required. Delay-based congestion algorithms are a viable solution as they target to limit the experienced end-to-end delay. Unfortunately, they do not perform well when sharing the bandwidth with congestion control algorithms not regulated by delay constraints (e.g., los"},"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":"1506.02799","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-09T07:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"c717cbef9b38e4753b8da051bdaed6e8bf03ba3a187e61ce2feb68e28c5579ee","abstract_canon_sha256":"4739eec3bab304e3486a5c648cc4b69765db1826fd6ac6c147779aa0562208bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:28.513796Z","signature_b64":"kXXQAgNoKHtfZAN8fbwAvsmxGw+xzeCFggrcuht30DI14k7BzAJcNfec3ZwKIB63h349ATIIaP4mJS5xNvPBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7f75f140d56fd80ca2012799934ae363c54568ae8a9b83ef93a03f2ed72dae","last_reissued_at":"2026-05-18T00:52:28.513160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:28.513160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Utility-based Congestion Control for Delay-Constrained Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Laura Toni, Pascal Frossard, Sergio Mena, Stefano D'Aronco, Xiaoqing Zhu","submitted_at":"2015-06-09T07:02:31Z","abstract_excerpt":"Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to properly manage congestion events while maintaining a low end-to-end delay is required. Delay-based congestion algorithms are a viable solution as they target to limit the experienced end-to-end delay. Unfortunately, they do not perform well when sharing the bandwidth with congestion control algorithms not regulated by delay constraints (e.g., los"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02799","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02799","created_at":"2026-05-18T00:52:28.513265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02799v3","created_at":"2026-05-18T00:52:28.513265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02799","created_at":"2026-05-18T00:52:28.513265+00:00"},{"alias_kind":"pith_short_12","alias_value":"TV7XL4KA2VX5","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TV7XL4KA2VX5QDFC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TV7XL4KA","created_at":"2026-05-18T12:29:42.218222+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/TV7XL4KA2VX5QDFCAETZTE2K4N","json":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N.json","graph_json":"https://pith.science/api/pith-number/TV7XL4KA2VX5QDFCAETZTE2K4N/graph.json","events_json":"https://pith.science/api/pith-number/TV7XL4KA2VX5QDFCAETZTE2K4N/events.json","paper":"https://pith.science/paper/TV7XL4KA"},"agent_actions":{"view_html":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N","download_json":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N.json","view_paper":"https://pith.science/paper/TV7XL4KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02799&json=true","fetch_graph":"https://pith.science/api/pith-number/TV7XL4KA2VX5QDFCAETZTE2K4N/graph.json","fetch_events":"https://pith.science/api/pith-number/TV7XL4KA2VX5QDFCAETZTE2K4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N/action/storage_attestation","attest_author":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N/action/author_attestation","sign_citation":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N/action/citation_signature","submit_replication":"https://pith.science/pith/TV7XL4KA2VX5QDFCAETZTE2K4N/action/replication_record"}},"created_at":"2026-05-18T00:52:28.513265+00:00","updated_at":"2026-05-18T00:52:28.513265+00:00"}