{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NZP5LOQB4BXREQMKUJ7CWU3AJW","short_pith_number":"pith:NZP5LOQB","schema_version":"1.0","canonical_sha256":"6e5fd5ba01e06f12418aa27e2b53604d8caa7bda5c9fda2508cb7b46b062671a","source":{"kind":"arxiv","id":"1812.11255","version":1},"attestation_state":"computed","paper":{"title":"A Two-Phase Dynamic Throughput Optimization Model for Big Data Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Tevfik Kosar, Zulkar Nine","submitted_at":"2018-12-29T00:50:51Z","abstract_excerpt":"The amount of data moved over dedicated and non-dedicated network links increases much faster than the increase in the network capacity, but the current solutions fail to guarantee even the promised achievable transfer throughputs. In this paper, we propose a novel dynamic throughput optimization model based on mathematical modeling with offline knowledge discovery/analysis and adaptive online decision making. In offline analysis, we mine historical transfer logs to perform knowledge discovery about the transfer characteristics. Online phase uses the discovered knowledge from the offline analy"},"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":"1812.11255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-29T00:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"b9b1b188d8919e5e26f4fb00ddcce217a386c9a10f797fdf0ebb8114e6efbfdf","abstract_canon_sha256":"2fb026d74396bab9590be4df68dcf29fdbe16cb7b0dab6961fef3d4828f27a90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:12.415571Z","signature_b64":"bIx98Blz/eCTDkinovza/4qz+9LQoKA5foOVlSCaH81owng8iC5WJ7WZDxBxDet+Ie8bW9iZFMtQZjvFOyBtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e5fd5ba01e06f12418aa27e2b53604d8caa7bda5c9fda2508cb7b46b062671a","last_reissued_at":"2026-05-17T23:57:12.415149Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:12.415149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Two-Phase Dynamic Throughput Optimization Model for Big Data Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Tevfik Kosar, Zulkar Nine","submitted_at":"2018-12-29T00:50:51Z","abstract_excerpt":"The amount of data moved over dedicated and non-dedicated network links increases much faster than the increase in the network capacity, but the current solutions fail to guarantee even the promised achievable transfer throughputs. In this paper, we propose a novel dynamic throughput optimization model based on mathematical modeling with offline knowledge discovery/analysis and adaptive online decision making. In offline analysis, we mine historical transfer logs to perform knowledge discovery about the transfer characteristics. Online phase uses the discovered knowledge from the offline analy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11255","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":"1812.11255","created_at":"2026-05-17T23:57:12.415210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11255v1","created_at":"2026-05-17T23:57:12.415210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11255","created_at":"2026-05-17T23:57:12.415210+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZP5LOQB4BXR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZP5LOQB4BXREQMK","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZP5LOQB","created_at":"2026-05-18T12:32:40.477152+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/NZP5LOQB4BXREQMKUJ7CWU3AJW","json":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW.json","graph_json":"https://pith.science/api/pith-number/NZP5LOQB4BXREQMKUJ7CWU3AJW/graph.json","events_json":"https://pith.science/api/pith-number/NZP5LOQB4BXREQMKUJ7CWU3AJW/events.json","paper":"https://pith.science/paper/NZP5LOQB"},"agent_actions":{"view_html":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW","download_json":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW.json","view_paper":"https://pith.science/paper/NZP5LOQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11255&json=true","fetch_graph":"https://pith.science/api/pith-number/NZP5LOQB4BXREQMKUJ7CWU3AJW/graph.json","fetch_events":"https://pith.science/api/pith-number/NZP5LOQB4BXREQMKUJ7CWU3AJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW/action/storage_attestation","attest_author":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW/action/author_attestation","sign_citation":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW/action/citation_signature","submit_replication":"https://pith.science/pith/NZP5LOQB4BXREQMKUJ7CWU3AJW/action/replication_record"}},"created_at":"2026-05-17T23:57:12.415210+00:00","updated_at":"2026-05-17T23:57:12.415210+00:00"}