{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BIATRXYT2DX3NVOYCYCSXPWLGI","short_pith_number":"pith:BIATRXYT","canonical_record":{"source":{"id":"1102.3270","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-02-16T09:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"0deef93e90b7ff250275b93e63d22b35d590743ac4b05780a91379b50a7d9a33","abstract_canon_sha256":"79953158c21c1829c5d6e6cafa633ecb85605572a52334c27f65da1142f0a87f"},"schema_version":"1.0"},"canonical_sha256":"0a0138df13d0efb6d5d816052bbecb3226ad0cf2c99bfb9da767e74355c65703","source":{"kind":"arxiv","id":"1102.3270","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3270","created_at":"2026-05-18T03:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3270v3","created_at":"2026-05-18T03:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3270","created_at":"2026-05-18T03:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"BIATRXYT2DX3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BIATRXYT2DX3NVOY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BIATRXYT","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BIATRXYT2DX3NVOYCYCSXPWLGI","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3270","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-02-16T09:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"0deef93e90b7ff250275b93e63d22b35d590743ac4b05780a91379b50a7d9a33","abstract_canon_sha256":"79953158c21c1829c5d6e6cafa633ecb85605572a52334c27f65da1142f0a87f"},"schema_version":"1.0"},"canonical_sha256":"0a0138df13d0efb6d5d816052bbecb3226ad0cf2c99bfb9da767e74355c65703","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:14.581294Z","signature_b64":"ISZRl8pfELG3rKt8trwJkKKBhYFrg3xi+WT0fPi3lnJiXVIGS03lByLc1jGGpkpaiGnK1JA2jubFIxPu/nyLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a0138df13d0efb6d5d816052bbecb3226ad0cf2c99bfb9da767e74355c65703","last_reissued_at":"2026-05-18T03:40:14.580719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:14.580719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3270","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-18T03:40:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHIfa/wvbDMMh54Qix+z3hRjB4jbSaSmcDwagHZDtuEmXfdvZwHBgkm0aEfnCAlRmNLqn73ezd5HmTZ9VXzzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:21:59.897755Z"},"content_sha256":"17f7d03c5f6f29e0ebcf758b1e12505bf5cc95584549af43eddf5528cc05552b","schema_version":"1.0","event_id":"sha256:17f7d03c5f6f29e0ebcf758b1e12505bf5cc95584549af43eddf5528cc05552b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BIATRXYT2DX3NVOYCYCSXPWLGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analytical Model of TCP Relentless Congestion Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Emmanuel Lochin, R\\'emi Diana","submitted_at":"2011-02-16T09:12:26Z","abstract_excerpt":"We introduce a model of the Relentless Congestion Control proposed by Matt Mathis. Relentless Congestion Control (RCC) is a modification of the AIMD (Additive Increase Multiplicative Decrease) congestion control which consists in decreasing the TCP congestion window by the number of lost segments instead of halving it. Despite some on-going discussions at the ICCRG IRTF-group, this congestion control has, to the best of our knowledge, never been modeled. In this paper, we provide an analytical model of this novel congestion control and propose an implementation of RCC for the commonly-used net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3270","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-18T03:40:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRYti2jTEwYWEHNg7Dm9NhRv2KkwA/E3vCnpEbrX8h39NJ/xVqUmwP80GXnzm5MrDCXEDEoSFLZM3JSDQlSoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:21:59.898098Z"},"content_sha256":"b133a0c53664045a974803768c932deca2ec27ee268e0c2d77782b393152ec8c","schema_version":"1.0","event_id":"sha256:b133a0c53664045a974803768c932deca2ec27ee268e0c2d77782b393152ec8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIATRXYT2DX3NVOYCYCSXPWLGI/bundle.json","state_url":"https://pith.science/pith/BIATRXYT2DX3NVOYCYCSXPWLGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIATRXYT2DX3NVOYCYCSXPWLGI/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-02T18:21:59Z","links":{"resolver":"https://pith.science/pith/BIATRXYT2DX3NVOYCYCSXPWLGI","bundle":"https://pith.science/pith/BIATRXYT2DX3NVOYCYCSXPWLGI/bundle.json","state":"https://pith.science/pith/BIATRXYT2DX3NVOYCYCSXPWLGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIATRXYT2DX3NVOYCYCSXPWLGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BIATRXYT2DX3NVOYCYCSXPWLGI","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":"79953158c21c1829c5d6e6cafa633ecb85605572a52334c27f65da1142f0a87f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-02-16T09:12:26Z","title_canon_sha256":"0deef93e90b7ff250275b93e63d22b35d590743ac4b05780a91379b50a7d9a33"},"schema_version":"1.0","source":{"id":"1102.3270","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3270","created_at":"2026-05-18T03:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3270v3","created_at":"2026-05-18T03:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3270","created_at":"2026-05-18T03:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"BIATRXYT2DX3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BIATRXYT2DX3NVOY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BIATRXYT","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:b133a0c53664045a974803768c932deca2ec27ee268e0c2d77782b393152ec8c","target":"graph","created_at":"2026-05-18T03:40:14Z","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":"We introduce a model of the Relentless Congestion Control proposed by Matt Mathis. Relentless Congestion Control (RCC) is a modification of the AIMD (Additive Increase Multiplicative Decrease) congestion control which consists in decreasing the TCP congestion window by the number of lost segments instead of halving it. Despite some on-going discussions at the ICCRG IRTF-group, this congestion control has, to the best of our knowledge, never been modeled. In this paper, we provide an analytical model of this novel congestion control and propose an implementation of RCC for the commonly-used net","authors_text":"Emmanuel Lochin, R\\'emi Diana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-02-16T09:12:26Z","title":"Analytical Model of TCP Relentless Congestion Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3270","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:17f7d03c5f6f29e0ebcf758b1e12505bf5cc95584549af43eddf5528cc05552b","target":"record","created_at":"2026-05-18T03:40:14Z","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":"79953158c21c1829c5d6e6cafa633ecb85605572a52334c27f65da1142f0a87f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-02-16T09:12:26Z","title_canon_sha256":"0deef93e90b7ff250275b93e63d22b35d590743ac4b05780a91379b50a7d9a33"},"schema_version":"1.0","source":{"id":"1102.3270","kind":"arxiv","version":3}},"canonical_sha256":"0a0138df13d0efb6d5d816052bbecb3226ad0cf2c99bfb9da767e74355c65703","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a0138df13d0efb6d5d816052bbecb3226ad0cf2c99bfb9da767e74355c65703","first_computed_at":"2026-05-18T03:40:14.580719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:14.580719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ISZRl8pfELG3rKt8trwJkKKBhYFrg3xi+WT0fPi3lnJiXVIGS03lByLc1jGGpkpaiGnK1JA2jubFIxPu/nyLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:14.581294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3270","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17f7d03c5f6f29e0ebcf758b1e12505bf5cc95584549af43eddf5528cc05552b","sha256:b133a0c53664045a974803768c932deca2ec27ee268e0c2d77782b393152ec8c"],"state_sha256":"bc7679244fcd4961517b58ef95e87ac09527144e1da25ce4cc6999c452f18739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFRFywx1Ij5ckclxM6nvFBWDCYRkTXfkxOhHpyQaQSqdolpU2yMBOD8bX7NG5wMV8SCtHF9gV6AwMtsnDyzLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:21:59.900343Z","bundle_sha256":"58c8de6d2c6a6a786de606bdbf80b5071085de3977eae82020f9217cb9c80c70"}}