{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TWDSSOXMSURUVBC2W2NPE5Q5V7","short_pith_number":"pith:TWDSSOXM","schema_version":"1.0","canonical_sha256":"9d87293aec95234a845ab69af2761dafcd85fd8c89a7bab3a0250aad3ff203b7","source":{"kind":"arxiv","id":"2201.10795","version":1},"attestation_state":"computed","paper":{"title":"Bandwidth and Power Allocation for Task-Oriented SemanticCommunication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Caili Guo, Chuanhong Liu, Jiujiu Chen, Yang Yang","submitted_at":"2022-01-26T08:03:40Z","abstract_excerpt":"Deep learning enabled semantic communication has been studied to improve communication efficiency while guaranteeing intelligent task performance. Different from conventional communications systems, the resource allocation in semantic communications no longer just pursues the bit transmission rate, but focuses on how to better compress and transmit semantic to complete subsequent intelligent tasks. This paper aims to appropriately allocate the bandwidth and power for artificial intelligence (AI) task-oriented semantic communication and proposes a joint compressiom ratio and resource allocation"},"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":"2201.10795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-01-26T08:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"7bf44385bb57b6cda9ee7c7685bbc9e86cc439dee9069a1382e5655f4a9913cd","abstract_canon_sha256":"99084cef8b3e82ae4c8e86bb15ac2ba39d7683af1f89fe98b089403ce65198a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:49.761337Z","signature_b64":"kuGVZgI2/CUlPg8A5XuvKPoGEh/pJ5zJYRuVhBNPKSdhcM90xaNRAH0ntq6xQd4C68FlYA1EDP6fsBTlmE8WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d87293aec95234a845ab69af2761dafcd85fd8c89a7bab3a0250aad3ff203b7","last_reissued_at":"2026-07-05T03:51:49.760858Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:49.760858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bandwidth and Power Allocation for Task-Oriented SemanticCommunication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Caili Guo, Chuanhong Liu, Jiujiu Chen, Yang Yang","submitted_at":"2022-01-26T08:03:40Z","abstract_excerpt":"Deep learning enabled semantic communication has been studied to improve communication efficiency while guaranteeing intelligent task performance. Different from conventional communications systems, the resource allocation in semantic communications no longer just pursues the bit transmission rate, but focuses on how to better compress and transmit semantic to complete subsequent intelligent tasks. This paper aims to appropriately allocate the bandwidth and power for artificial intelligence (AI) task-oriented semantic communication and proposes a joint compressiom ratio and resource allocation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.10795","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/2201.10795/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":"2201.10795","created_at":"2026-07-05T03:51:49.760930+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.10795v1","created_at":"2026-07-05T03:51:49.760930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.10795","created_at":"2026-07-05T03:51:49.760930+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWDSSOXMSURU","created_at":"2026-07-05T03:51:49.760930+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWDSSOXMSURUVBC2","created_at":"2026-07-05T03:51:49.760930+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWDSSOXM","created_at":"2026-07-05T03:51:49.760930+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":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7","json":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7.json","graph_json":"https://pith.science/api/pith-number/TWDSSOXMSURUVBC2W2NPE5Q5V7/graph.json","events_json":"https://pith.science/api/pith-number/TWDSSOXMSURUVBC2W2NPE5Q5V7/events.json","paper":"https://pith.science/paper/TWDSSOXM"},"agent_actions":{"view_html":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7","download_json":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7.json","view_paper":"https://pith.science/paper/TWDSSOXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.10795&json=true","fetch_graph":"https://pith.science/api/pith-number/TWDSSOXMSURUVBC2W2NPE5Q5V7/graph.json","fetch_events":"https://pith.science/api/pith-number/TWDSSOXMSURUVBC2W2NPE5Q5V7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7/action/storage_attestation","attest_author":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7/action/author_attestation","sign_citation":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7/action/citation_signature","submit_replication":"https://pith.science/pith/TWDSSOXMSURUVBC2W2NPE5Q5V7/action/replication_record"}},"created_at":"2026-07-05T03:51:49.760930+00:00","updated_at":"2026-07-05T03:51:49.760930+00:00"}