{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VLVDO4GII5HGI5KML6ULK2L6P4","short_pith_number":"pith:VLVDO4GI","schema_version":"1.0","canonical_sha256":"aaea3770c8474e64754c5fa8b5697e7f3017d5ca5d43cecde6e3596de5de6f5a","source":{"kind":"arxiv","id":"2401.13980","version":4},"attestation_state":"computed","paper":{"title":"A Superposition Code-Based Semantic Communication Approach with Quantifiable and Controllable Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","math.IT"],"primary_cat":"cs.IT","authors_text":"Ping Zhang, Qianqian Yang, Shuo Shao, Weixuan Chen, Zhaoyang Zhang","submitted_at":"2024-01-25T06:46:13Z","abstract_excerpt":"This paper addresses the challenge of achieving security in semantic communication (SemCom) over a wiretap channel, where a legitimate receiver coexists with an eavesdropper experiencing a poorer channel condition. Despite previous efforts to secure SemCom against eavesdroppers, guarantee of approximately zero information leakage remains an open issue. In this work, we propose a secure SemCom approach based on superposition code, aiming to provide quantifiable and controllable security for digital SemCom systems. The proposed method employs a double-layered constellation map, where semantic in"},"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":"2401.13980","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-25T06:46:13Z","cross_cats_sorted":["eess.IV","math.IT"],"title_canon_sha256":"60974a6f68105bf5cf8405d58505dd66772340ae2e025896c013eec16c4404dd","abstract_canon_sha256":"22dec32e0a44bc99f9396db0c83dd397718f1ab89643eea26e91e6b97f147a64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:26.143375Z","signature_b64":"u7QGRUg4rsLadleu3aK223UOIRzaS6bNbvC38mauD21puZouiG9IEjS9aC1APmfaPxxAAKycjliS2rxKTe2bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaea3770c8474e64754c5fa8b5697e7f3017d5ca5d43cecde6e3596de5de6f5a","last_reissued_at":"2026-07-05T12:04:26.142888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:26.142888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Superposition Code-Based Semantic Communication Approach with Quantifiable and Controllable Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","math.IT"],"primary_cat":"cs.IT","authors_text":"Ping Zhang, Qianqian Yang, Shuo Shao, Weixuan Chen, Zhaoyang Zhang","submitted_at":"2024-01-25T06:46:13Z","abstract_excerpt":"This paper addresses the challenge of achieving security in semantic communication (SemCom) over a wiretap channel, where a legitimate receiver coexists with an eavesdropper experiencing a poorer channel condition. Despite previous efforts to secure SemCom against eavesdroppers, guarantee of approximately zero information leakage remains an open issue. In this work, we propose a secure SemCom approach based on superposition code, aiming to provide quantifiable and controllable security for digital SemCom systems. The proposed method employs a double-layered constellation map, where semantic in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13980","kind":"arxiv","version":4},"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/2401.13980/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":"2401.13980","created_at":"2026-07-05T12:04:26.142950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.13980v4","created_at":"2026-07-05T12:04:26.142950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13980","created_at":"2026-07-05T12:04:26.142950+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLVDO4GII5HG","created_at":"2026-07-05T12:04:26.142950+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLVDO4GII5HGI5KM","created_at":"2026-07-05T12:04:26.142950+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLVDO4GI","created_at":"2026-07-05T12:04:26.142950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.16472","citing_title":"Secure Intellicise Wireless Network: Agentic AI for Coverless Semantic Steganography Communication","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4","json":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4.json","graph_json":"https://pith.science/api/pith-number/VLVDO4GII5HGI5KML6ULK2L6P4/graph.json","events_json":"https://pith.science/api/pith-number/VLVDO4GII5HGI5KML6ULK2L6P4/events.json","paper":"https://pith.science/paper/VLVDO4GI"},"agent_actions":{"view_html":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4","download_json":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4.json","view_paper":"https://pith.science/paper/VLVDO4GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.13980&json=true","fetch_graph":"https://pith.science/api/pith-number/VLVDO4GII5HGI5KML6ULK2L6P4/graph.json","fetch_events":"https://pith.science/api/pith-number/VLVDO4GII5HGI5KML6ULK2L6P4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4/action/storage_attestation","attest_author":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4/action/author_attestation","sign_citation":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4/action/citation_signature","submit_replication":"https://pith.science/pith/VLVDO4GII5HGI5KML6ULK2L6P4/action/replication_record"}},"created_at":"2026-07-05T12:04:26.142950+00:00","updated_at":"2026-07-05T12:04:26.142950+00:00"}