{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TZLOH6C2OUMZMLHMLC62YIDA63","short_pith_number":"pith:TZLOH6C2","schema_version":"1.0","canonical_sha256":"9e56e3f85a7519962cec58bdac2060f6d378677a25a3870672ac6e0384b18dba","source":{"kind":"arxiv","id":"2210.02557","version":1},"attestation_state":"computed","paper":{"title":"Minimizing File Transfer Time in Opportunistic Spectrum Access Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Do Young Eun, Jie Hu, Vishwaraj Doshi","submitted_at":"2022-10-05T20:57:41Z","abstract_excerpt":"We study the file transfer problem in opportunistic spectrum access (OSA) model, which has been widely studied in throughput-oriented applications for max-throughput strategies and in delay-related works that commonly assume identical channel rates and fixed file sizes. Our work explicitly considers minimizing the file transfer time for a given file in a set of heterogeneous-rate Bernoulli channels, showing that max-throughput policy doesn't minimize file transfer time in general. We formulate a mathematical framework for static extend to dynamic policies by mapping our file transfer problem t"},"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":"2210.02557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-05T20:57:41Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"b5d012a7ff47536d08ce187b131e66274f4c78d388567cbc2203cefab8dfdf61","abstract_canon_sha256":"5979698ecf8909f5cdafd9f0fea871fe04409af3d2d7395d61bc33008b09a986"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:53.940755Z","signature_b64":"oRnmtGs+RVR0HBXk/FkXDhpI0ncDkjmn+G3cN9eDEeLpQK7rvBZP+VGm+7mkBjuWh1qyOs68+Qd6S04rKG9SDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e56e3f85a7519962cec58bdac2060f6d378677a25a3870672ac6e0384b18dba","last_reissued_at":"2026-07-05T05:03:53.940245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:53.940245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing File Transfer Time in Opportunistic Spectrum Access Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Do Young Eun, Jie Hu, Vishwaraj Doshi","submitted_at":"2022-10-05T20:57:41Z","abstract_excerpt":"We study the file transfer problem in opportunistic spectrum access (OSA) model, which has been widely studied in throughput-oriented applications for max-throughput strategies and in delay-related works that commonly assume identical channel rates and fixed file sizes. Our work explicitly considers minimizing the file transfer time for a given file in a set of heterogeneous-rate Bernoulli channels, showing that max-throughput policy doesn't minimize file transfer time in general. We formulate a mathematical framework for static extend to dynamic policies by mapping our file transfer problem t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02557","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.02557/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.02557","created_at":"2026-07-05T05:03:53.940322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.02557v1","created_at":"2026-07-05T05:03:53.940322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02557","created_at":"2026-07-05T05:03:53.940322+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZLOH6C2OUMZ","created_at":"2026-07-05T05:03:53.940322+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZLOH6C2OUMZMLHM","created_at":"2026-07-05T05:03:53.940322+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZLOH6C2","created_at":"2026-07-05T05:03:53.940322+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/TZLOH6C2OUMZMLHMLC62YIDA63","json":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63.json","graph_json":"https://pith.science/api/pith-number/TZLOH6C2OUMZMLHMLC62YIDA63/graph.json","events_json":"https://pith.science/api/pith-number/TZLOH6C2OUMZMLHMLC62YIDA63/events.json","paper":"https://pith.science/paper/TZLOH6C2"},"agent_actions":{"view_html":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63","download_json":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63.json","view_paper":"https://pith.science/paper/TZLOH6C2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.02557&json=true","fetch_graph":"https://pith.science/api/pith-number/TZLOH6C2OUMZMLHMLC62YIDA63/graph.json","fetch_events":"https://pith.science/api/pith-number/TZLOH6C2OUMZMLHMLC62YIDA63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63/action/storage_attestation","attest_author":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63/action/author_attestation","sign_citation":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63/action/citation_signature","submit_replication":"https://pith.science/pith/TZLOH6C2OUMZMLHMLC62YIDA63/action/replication_record"}},"created_at":"2026-07-05T05:03:53.940322+00:00","updated_at":"2026-07-05T05:03:53.940322+00:00"}