{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LFWUSX2DCOHURSRHIOK72XQ6N2","short_pith_number":"pith:LFWUSX2D","schema_version":"1.0","canonical_sha256":"596d495f43138f48ca274395fd5e1e6e828c069c95f5ce5cf7d82d5e85208017","source":{"kind":"arxiv","id":"2204.08910","version":1},"attestation_state":"computed","paper":{"title":"Adaptable Semantic Compression and Resource Allocation for Task-Oriented Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Caili Guo, Chuanhong Liu, Nan Jiang, Yang Yang","submitted_at":"2022-04-19T14:15:09Z","abstract_excerpt":"Task-oriented communication is a new paradigm that aims at providing efficient connectivity for accomplishing intelligent tasks rather than the reception of every transmitted bit. In this paper, a deep learning-based task-oriented communication architecture is proposed where the user extracts, compresses and transmits semantics in an end-to-end (E2E) manner. Furthermore, an approach is proposed to compress the semantics according to their importance relevant to the task, namely, adaptable semantic compression (ASC). Assuming a delay-intolerant system, supporting multiple users indicates a prob"},"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":"2204.08910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-04-19T14:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"168f539f283898bc92d0b8f17f55af93b63c694ac36e891c3019988679d8a1e7","abstract_canon_sha256":"20429b52257a23276ded82d91cfabf46d33a2be7feb60ea915d7e0d8b0b50487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:08.742201Z","signature_b64":"WIzv65mgT7GHHLXabuvCA5fny5CMafLOwZsTvqkhKS0Y5csmVSNozeyyh+7LOQMQQwqqDDdBZj0PE6FcnQ3lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596d495f43138f48ca274395fd5e1e6e828c069c95f5ce5cf7d82d5e85208017","last_reissued_at":"2026-07-05T04:16:08.741757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:08.741757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptable Semantic Compression and Resource Allocation for Task-Oriented Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Caili Guo, Chuanhong Liu, Nan Jiang, Yang Yang","submitted_at":"2022-04-19T14:15:09Z","abstract_excerpt":"Task-oriented communication is a new paradigm that aims at providing efficient connectivity for accomplishing intelligent tasks rather than the reception of every transmitted bit. In this paper, a deep learning-based task-oriented communication architecture is proposed where the user extracts, compresses and transmits semantics in an end-to-end (E2E) manner. Furthermore, an approach is proposed to compress the semantics according to their importance relevant to the task, namely, adaptable semantic compression (ASC). Assuming a delay-intolerant system, supporting multiple users indicates a prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08910","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/2204.08910/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":"2204.08910","created_at":"2026-07-05T04:16:08.741816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.08910v1","created_at":"2026-07-05T04:16:08.741816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08910","created_at":"2026-07-05T04:16:08.741816+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFWUSX2DCOHU","created_at":"2026-07-05T04:16:08.741816+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFWUSX2DCOHURSRH","created_at":"2026-07-05T04:16:08.741816+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFWUSX2D","created_at":"2026-07-05T04:16:08.741816+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20939","citing_title":"Flexible Semantic-Aware Resource Allocation: Serving More Users Through Similarity Range Constraints","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2","json":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2.json","graph_json":"https://pith.science/api/pith-number/LFWUSX2DCOHURSRHIOK72XQ6N2/graph.json","events_json":"https://pith.science/api/pith-number/LFWUSX2DCOHURSRHIOK72XQ6N2/events.json","paper":"https://pith.science/paper/LFWUSX2D"},"agent_actions":{"view_html":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2","download_json":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2.json","view_paper":"https://pith.science/paper/LFWUSX2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.08910&json=true","fetch_graph":"https://pith.science/api/pith-number/LFWUSX2DCOHURSRHIOK72XQ6N2/graph.json","fetch_events":"https://pith.science/api/pith-number/LFWUSX2DCOHURSRHIOK72XQ6N2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2/action/storage_attestation","attest_author":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2/action/author_attestation","sign_citation":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2/action/citation_signature","submit_replication":"https://pith.science/pith/LFWUSX2DCOHURSRHIOK72XQ6N2/action/replication_record"}},"created_at":"2026-07-05T04:16:08.741816+00:00","updated_at":"2026-07-05T04:16:08.741816+00:00"}