{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LQ5BORH5UEFUOTNF3RDMXJJEPA","short_pith_number":"pith:LQ5BORH5","schema_version":"1.0","canonical_sha256":"5c3a1744fda10b474da5dc46cba524781865feedd2f4b4772a838924037ad0f8","source":{"kind":"arxiv","id":"2403.20198","version":1},"attestation_state":"computed","paper":{"title":"Minimizing End-to-End Latency for Joint Source-Channel Coding Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Kaiyi Chi, Qianqian Yang, Yuanchao Shu, Zhaohui Yang, Zhiguo Shi","submitted_at":"2024-03-29T14:23:58Z","abstract_excerpt":"While existing studies have highlighted the advantages of deep learning (DL)-based joint source-channel coding (JSCC) schemes in enhancing transmission efficiency, they often overlook the crucial aspect of resource management during the deployment phase. In this paper, we propose an approach to minimize the transmission latency in an uplink JSCC-based system. We first analyze the correlation between end-to-end latency and task performance, based on which the end-to-end delay model for each device is established. Then, we formulate a non-convex optimization problem aiming at minimizing the maxi"},"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":"2403.20198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-03-29T14:23:58Z","cross_cats_sorted":["cs.SY","eess.SY","math.IT"],"title_canon_sha256":"d272dd7878bd4247563e8e75cee5c1d7c00524ffc41034c0ecbcccd22c6c4065","abstract_canon_sha256":"c7a811f5a5c92ac8611418404b4d7ebabf8cb844794c9bffd8fafcb3df466633"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:15.667442Z","signature_b64":"7iJg8IPaKrzyCNdmseIa0jcXwopjtaLxpF3JYN2XZ/NB3I2wevtYzKfYVNp7unQh/uGI/zy3PrNBaY55khpSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c3a1744fda10b474da5dc46cba524781865feedd2f4b4772a838924037ad0f8","last_reissued_at":"2026-07-05T08:02:15.667019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:15.667019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing End-to-End Latency for Joint Source-Channel Coding Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Kaiyi Chi, Qianqian Yang, Yuanchao Shu, Zhaohui Yang, Zhiguo Shi","submitted_at":"2024-03-29T14:23:58Z","abstract_excerpt":"While existing studies have highlighted the advantages of deep learning (DL)-based joint source-channel coding (JSCC) schemes in enhancing transmission efficiency, they often overlook the crucial aspect of resource management during the deployment phase. In this paper, we propose an approach to minimize the transmission latency in an uplink JSCC-based system. We first analyze the correlation between end-to-end latency and task performance, based on which the end-to-end delay model for each device is established. Then, we formulate a non-convex optimization problem aiming at minimizing the maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.20198","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/2403.20198/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":"2403.20198","created_at":"2026-07-05T08:02:15.667074+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.20198v1","created_at":"2026-07-05T08:02:15.667074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.20198","created_at":"2026-07-05T08:02:15.667074+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQ5BORH5UEFU","created_at":"2026-07-05T08:02:15.667074+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQ5BORH5UEFUOTNF","created_at":"2026-07-05T08:02:15.667074+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQ5BORH5","created_at":"2026-07-05T08:02:15.667074+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/LQ5BORH5UEFUOTNF3RDMXJJEPA","json":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA.json","graph_json":"https://pith.science/api/pith-number/LQ5BORH5UEFUOTNF3RDMXJJEPA/graph.json","events_json":"https://pith.science/api/pith-number/LQ5BORH5UEFUOTNF3RDMXJJEPA/events.json","paper":"https://pith.science/paper/LQ5BORH5"},"agent_actions":{"view_html":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA","download_json":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA.json","view_paper":"https://pith.science/paper/LQ5BORH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.20198&json=true","fetch_graph":"https://pith.science/api/pith-number/LQ5BORH5UEFUOTNF3RDMXJJEPA/graph.json","fetch_events":"https://pith.science/api/pith-number/LQ5BORH5UEFUOTNF3RDMXJJEPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA/action/storage_attestation","attest_author":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA/action/author_attestation","sign_citation":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA/action/citation_signature","submit_replication":"https://pith.science/pith/LQ5BORH5UEFUOTNF3RDMXJJEPA/action/replication_record"}},"created_at":"2026-07-05T08:02:15.667074+00:00","updated_at":"2026-07-05T08:02:15.667074+00:00"}