{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GMGUYSSEFTNOMO4HWWKD7HP4A3","short_pith_number":"pith:GMGUYSSE","canonical_record":{"source":{"id":"1810.04470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-10T11:48:19Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f75ea6ccd42cff3dfc2bfa38d3f3f59e60fc88e51bde500e5b17cc7243bec43b","abstract_canon_sha256":"b5feee5364ac71285c3249481e8902de9df0520b47aa2568eec059af872a91d6"},"schema_version":"1.0"},"canonical_sha256":"330d4c4a442cdae63b87b5943f9dfc06cea913e3229160b3dddce6cce3208e89","source":{"kind":"arxiv","id":"1810.04470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04470","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04470v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04470","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"GMGUYSSEFTNO","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GMGUYSSEFTNOMO4H","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GMGUYSSE","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GMGUYSSEFTNOMO4HWWKD7HP4A3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-10T11:48:19Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f75ea6ccd42cff3dfc2bfa38d3f3f59e60fc88e51bde500e5b17cc7243bec43b","abstract_canon_sha256":"b5feee5364ac71285c3249481e8902de9df0520b47aa2568eec059af872a91d6"},"schema_version":"1.0"},"canonical_sha256":"330d4c4a442cdae63b87b5943f9dfc06cea913e3229160b3dddce6cce3208e89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.047695Z","signature_b64":"qV7HuXAvvNmmWqg9EeAkUe5JcF2NcIRfiTB684VTw4mO38MaTFZvkVFqa32YHSm8suag9mUTZK9i8g4PdvnqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330d4c4a442cdae63b87b5943f9dfc06cea913e3229160b3dddce6cce3208e89","last_reissued_at":"2026-05-18T00:03:40.047044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.047044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04470","source_version":1,"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-18T00:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BPXkzhQZFXWNMugPYBeUI3IbcX1K1LORfvRruJ8zuLz8gWcFTIg3po+OLkb5Ww/3uKB5uttG6GJ9rSKcLRdBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:11:23.129574Z"},"content_sha256":"63e1da863c6b1446d14eacbd5c1a329a788495fdb72d6d745ffa5cbdf7e69126","schema_version":"1.0","event_id":"sha256:63e1da863c6b1446d14eacbd5c1a329a788495fdb72d6d745ffa5cbdf7e69126"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GMGUYSSEFTNOMO4HWWKD7HP4A3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis Of Congestion Control In Data Channels With Frequent Frame Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.NI","authors_text":"Anna Kuznetsova, Yuri Monakhov","submitted_at":"2018-10-10T11:48:19Z","abstract_excerpt":"Development of optimal control procedures for congested networks is a key factor in maintaining efficient network utilization. The absence of congestion control mechanism or its failure can lead to the lack of availability for certain network segments, and in severe cases -- for the entire network. The paper presents an analytical model describing the operation of the TCP Reno congestion control algorithm in terms of differential calculus and queuing systems. The purpose of this research is to explore the possibilities and ways of increasing the virtual channel capacity utilization efficiency "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04470","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"},"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-18T00:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d1eiXAIrP4rJiFp6vpvmSkusOo9fS/E4upTADhbYIRHISsFme3BvFzXKq0s54XKjOuYCp7b17esl0eFgCWZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:11:23.130042Z"},"content_sha256":"ff3ec58959a2309f1de61b246836620185cb91a2ea57176508bcced35fa8603e","schema_version":"1.0","event_id":"sha256:ff3ec58959a2309f1de61b246836620185cb91a2ea57176508bcced35fa8603e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3/bundle.json","state_url":"https://pith.science/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3/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-24T20:11:23Z","links":{"resolver":"https://pith.science/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3","bundle":"https://pith.science/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3/bundle.json","state":"https://pith.science/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMGUYSSEFTNOMO4HWWKD7HP4A3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GMGUYSSEFTNOMO4HWWKD7HP4A3","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":"b5feee5364ac71285c3249481e8902de9df0520b47aa2568eec059af872a91d6","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-10T11:48:19Z","title_canon_sha256":"f75ea6ccd42cff3dfc2bfa38d3f3f59e60fc88e51bde500e5b17cc7243bec43b"},"schema_version":"1.0","source":{"id":"1810.04470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04470","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04470v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04470","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"GMGUYSSEFTNO","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GMGUYSSEFTNOMO4H","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GMGUYSSE","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:ff3ec58959a2309f1de61b246836620185cb91a2ea57176508bcced35fa8603e","target":"graph","created_at":"2026-05-18T00:03:40Z","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":"Development of optimal control procedures for congested networks is a key factor in maintaining efficient network utilization. The absence of congestion control mechanism or its failure can lead to the lack of availability for certain network segments, and in severe cases -- for the entire network. The paper presents an analytical model describing the operation of the TCP Reno congestion control algorithm in terms of differential calculus and queuing systems. The purpose of this research is to explore the possibilities and ways of increasing the virtual channel capacity utilization efficiency ","authors_text":"Anna Kuznetsova, Yuri Monakhov","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-10T11:48:19Z","title":"Analysis Of Congestion Control In Data Channels With Frequent Frame Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04470","kind":"arxiv","version":1},"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:63e1da863c6b1446d14eacbd5c1a329a788495fdb72d6d745ffa5cbdf7e69126","target":"record","created_at":"2026-05-18T00:03:40Z","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":"b5feee5364ac71285c3249481e8902de9df0520b47aa2568eec059af872a91d6","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-10T11:48:19Z","title_canon_sha256":"f75ea6ccd42cff3dfc2bfa38d3f3f59e60fc88e51bde500e5b17cc7243bec43b"},"schema_version":"1.0","source":{"id":"1810.04470","kind":"arxiv","version":1}},"canonical_sha256":"330d4c4a442cdae63b87b5943f9dfc06cea913e3229160b3dddce6cce3208e89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330d4c4a442cdae63b87b5943f9dfc06cea913e3229160b3dddce6cce3208e89","first_computed_at":"2026-05-18T00:03:40.047044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:40.047044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qV7HuXAvvNmmWqg9EeAkUe5JcF2NcIRfiTB684VTw4mO38MaTFZvkVFqa32YHSm8suag9mUTZK9i8g4PdvnqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:40.047695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63e1da863c6b1446d14eacbd5c1a329a788495fdb72d6d745ffa5cbdf7e69126","sha256:ff3ec58959a2309f1de61b246836620185cb91a2ea57176508bcced35fa8603e"],"state_sha256":"511442e82865e5ebfd41d394c6906667a6603d582bd6bbedbf6e7961c1c77091"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8v7mTIOmsl6lgELrqsqcS3Ds2pbNH5C63vXr27S3bWLs8m1luxjU2GetgbVxHVvnwvs2PPsG6J96s9WnxtLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:11:23.132575Z","bundle_sha256":"7f4362edf6fb092cc4de118d4a46b0a85fb96a5562a82fa506be273fd4e912e8"}}