{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7LDGR5FVZMFAPWVSVEFT24IXHQ","short_pith_number":"pith:7LDGR5FV","schema_version":"1.0","canonical_sha256":"fac668f4b5cb0a07dab2a90b3d71173c3551a0de24cb80c4e411bbb18c54a450","source":{"kind":"arxiv","id":"1612.00997","version":1},"attestation_state":"computed","paper":{"title":"Improving congestion control for Concurrent Multipath Transfer through bandwidth estimation based resource pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"R. Bhattacharjee, Samar Shailendra, Sanjay K. Bose","submitted_at":"2016-12-03T18:19:47Z","abstract_excerpt":"Stream Control Transmission Protocol (SCTP) was introduced in 2001 as a multipath variant to traditional transport protocols, i.e. Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Concurrent Multipath Transfer (CMT) has been proposed as an extension for SCTP to support concurrent usage of available multiple paths. In this paper, we propose a new congestion control algorithm for CMT-SCTP based on the principle of resource pooling. We use the connection bandwidth estimates to obtain the collection of the network resources being used by different flows on multiple paths. Base"},"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":"1612.00997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-12-03T18:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"d1d0d73480a61ff21255fa7e0f052dd58a1550515de1ddfd06cf256786249fa1","abstract_canon_sha256":"633df6da5c10e6acf2f365c702be14db51d19cd4accd043ad0d76a0f64ad6ceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:53.622391Z","signature_b64":"2UalpHIVMJv6T2ccIAFpUudrxI3bvdFDbUjHrxEGwXr40H7QHj71lYmQ0emV2pYFolUYMmcEFAOYDwpECGCrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac668f4b5cb0a07dab2a90b3d71173c3551a0de24cb80c4e411bbb18c54a450","last_reissued_at":"2026-05-18T00:55:53.621954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:53.621954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving congestion control for Concurrent Multipath Transfer through bandwidth estimation based resource pooling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"R. Bhattacharjee, Samar Shailendra, Sanjay K. Bose","submitted_at":"2016-12-03T18:19:47Z","abstract_excerpt":"Stream Control Transmission Protocol (SCTP) was introduced in 2001 as a multipath variant to traditional transport protocols, i.e. Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Concurrent Multipath Transfer (CMT) has been proposed as an extension for SCTP to support concurrent usage of available multiple paths. In this paper, we propose a new congestion control algorithm for CMT-SCTP based on the principle of resource pooling. We use the connection bandwidth estimates to obtain the collection of the network resources being used by different flows on multiple paths. Base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00997","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":"1612.00997","created_at":"2026-05-18T00:55:53.622025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00997v1","created_at":"2026-05-18T00:55:53.622025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00997","created_at":"2026-05-18T00:55:53.622025+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LDGR5FVZMFA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LDGR5FVZMFAPWVS","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LDGR5FV","created_at":"2026-05-18T12:30:04.600751+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/7LDGR5FVZMFAPWVSVEFT24IXHQ","json":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ.json","graph_json":"https://pith.science/api/pith-number/7LDGR5FVZMFAPWVSVEFT24IXHQ/graph.json","events_json":"https://pith.science/api/pith-number/7LDGR5FVZMFAPWVSVEFT24IXHQ/events.json","paper":"https://pith.science/paper/7LDGR5FV"},"agent_actions":{"view_html":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ","download_json":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ.json","view_paper":"https://pith.science/paper/7LDGR5FV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00997&json=true","fetch_graph":"https://pith.science/api/pith-number/7LDGR5FVZMFAPWVSVEFT24IXHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7LDGR5FVZMFAPWVSVEFT24IXHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ/action/storage_attestation","attest_author":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ/action/author_attestation","sign_citation":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ/action/citation_signature","submit_replication":"https://pith.science/pith/7LDGR5FVZMFAPWVSVEFT24IXHQ/action/replication_record"}},"created_at":"2026-05-18T00:55:53.622025+00:00","updated_at":"2026-05-18T00:55:53.622025+00:00"}