{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GWLT6VMV4WQVQR3AVGYYUUGFT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0566d91f2430225ffd60c38986b71c1690f043598394c789f767faed3035b005","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-09T11:21:17Z","title_canon_sha256":"4d277cfa9f28bfe3a85fad158483b9a26db2bd8747ce95b0a001b9a6a832875d"},"schema_version":"1.0","source":{"id":"2303.05181","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.05181","created_at":"2026-07-05T10:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"2303.05181v3","created_at":"2026-07-05T10:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05181","created_at":"2026-07-05T10:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"GWLT6VMV4WQV","created_at":"2026-07-05T10:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"GWLT6VMV4WQVQR3A","created_at":"2026-07-05T10:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"GWLT6VMV","created_at":"2026-07-05T10:16:30Z"}],"graph_snapshots":[{"event_id":"sha256:bfee8fa0943b73e99928a34c5746886fe0225a5c0fa053feec6423283fe7dbba","target":"graph","created_at":"2026-07-05T10:16:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.05181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As one of the potential key technologies of 6G, semantic communication is still in its infancy and there are many open problems, such as semantic entropy definition and semantic channel coding theory. To address these challenges, we investigate semantic information measures and semantic channel coding theorem. Specifically, we propose a semantic entropy definition as the uncertainty in the semantic interpretation of random variable symbols in the context of knowledge bases, which can be transformed into existing semantic entropy definitions under given conditions. Moreover, different from trad","authors_text":"Chuanhui Zhang, Guangming Shi, Hang Li, Huayan Qi, Naofal Al-Dhahir, Shuai Ma, Yue Bi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-09T11:21:17Z","title":"A Theory for Semantic Channel Coding With Many-to-one Source"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05181","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0861c368927b3cf3f12424fe2c82cc18663525655b49183633d0f6fdaf00827f","target":"record","created_at":"2026-07-05T10:16:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0566d91f2430225ffd60c38986b71c1690f043598394c789f767faed3035b005","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-09T11:21:17Z","title_canon_sha256":"4d277cfa9f28bfe3a85fad158483b9a26db2bd8747ce95b0a001b9a6a832875d"},"schema_version":"1.0","source":{"id":"2303.05181","kind":"arxiv","version":3}},"canonical_sha256":"35973f5595e5a1584760a9b18a50c59f7c768747f958b14690c2c4375a943396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35973f5595e5a1584760a9b18a50c59f7c768747f958b14690c2c4375a943396","first_computed_at":"2026-07-05T10:16:30.980909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:16:30.980909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2iKF9k2CGn8RrZ0JPujdavMKf6urZ6A62LCeYLZTuzLzAN04Gpml3Gs9NDgdAj/teqswRsqCzbTLAyyXXpYDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:16:30.981422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.05181","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0861c368927b3cf3f12424fe2c82cc18663525655b49183633d0f6fdaf00827f","sha256:bfee8fa0943b73e99928a34c5746886fe0225a5c0fa053feec6423283fe7dbba"],"state_sha256":"da111ed673118e4636c88ef38b344a82831d3609978d1cf3dc55b389b6499a2e"}