{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_e4eef43917cc5508a1d033b9bc73a21d77840f2391ec60ea3feaa659f92ae093","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_e4eef43917cc5508a1d033b9bc73a21d77840f2391ec60ea3feaa659f92ae093","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"dde4c2884989bb7394a6392003bf3de016fe9c527f435cbbedfe2182aa7ae0ca","published":"Fri, 08 May 2026 00:00:00 -0400","receipt_hash":"dde4c2884989bb7394a6392003bf3de016fe9c527f435cbbedfe2182aa7ae0ca","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"dde4c2884989bb7394a6392003bf3de016fe9c527f435cbbedfe2182aa7ae0ca","observed_at":"2026-05-08T04:43:40.537619Z","parent_run_hash":"9837a17a0d4866b3bef2929e933ca29d96f4bd9656766df36f8260d720835b95","published":"Fri, 08 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2602.14481v2 Announce Type: replace-cross \nAbstract: Semantic communication is a novel communication paradigm that focuses on conveying the user's intended meaning rather than the bit-wise transmission of source signals. One of the key challenges is to effectively represent and extract the semantic meaning of any given source signals. While deep learning (DL)-based solutions have shown promising results in extracting implicit semantic information from a wide range of sources, existing work often overlooks the high computational complexity inherent in both model training and inference for the DL-based encoder and decoder. To bridge this gap, this paper proposes a rate-distortion-complexity (RDC) framework which extends the classical rate-distortion theory by incorporating the constraints on semantic distance, including both the traditional bit-wise distortion metric and statistical difference-based divergence metric, and complexity measure, adopted from the theory of minimum descr","title":"On the Rate-Distortion-Complexity Tradeoff for Semantic Communication","url":"https://arxiv.org/abs/2602.14481","vendor":"arxiv_cs_ai"},"summary":"arXiv:2602.14481v2 Announce Type: replace-cross \nAbstract: Semantic communication is a novel communication paradigm that focuses on conveying the user's intended meaning rather than the bit-wise transmission of source signals. One of the key challenges is to effectively represent and extract the semantic meaning of any given source signals. While deep learning (DL)-based solutions have shown promising results in extracting implicit semantic information from a wide range of sources, existing work often overlooks the high computational complexity inherent in both model training and inference for the DL-based encoder and decoder. To bridge this gap, this paper proposes a rate-distortion-complexity (RDC) framework which extends the classical rate-distortion theory by incorporating the constraints on semantic distance, including both the traditional bit-wise distortion metric and statistical difference-based divergence metric, and complexity measure, adopted from the theory of minimum descr","title":"On the Rate-Distortion-Complexity Tradeoff for Semantic Communication","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-08T04:43:40Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2602.14481"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:a5ae510499c0aa2c070fe54c10ce8ecc391982ba3c0dde86c5ae29d0b0b79e3b7bf44baf2cd4c723e77f44f267c47372e41da8368b61abe6e76bf5d1973f0d0f","signer":"crovia.substrate","subject":{"observed_at":"2026-05-08T04:43:40Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2602.14481"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"0caf32a9c262695e0b303946f4e882cebb41e47da1ca79e7940c2f8c8fe1b31f","leaf_index":120473,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"dec44e075261c61605ba9c26601f970a14d368e6a197b7d3b3d2626413c655ca","side":"left"},{"sibling":"3e5532ac13bd2f755564c7b3a40ab24a292e840925c0688f73c0a0f792aff0e6","side":"right"},{"sibling":"2107d760b1621e536fc3386cbcf79b5b0d7564b14a8133ca8d54f95efc3b69e0","side":"right"},{"sibling":"6d4fc039c3dd8e13afc27ec202e94d47445e80c9f5afc736efb1cf0396af65a3","side":"left"},{"sibling":"414a5038fd91366aed8b3a51fc478675ba55ba2e6a5e9447d6fe48282c1707a8","side":"left"},{"sibling":"85af380ff1b6645a6fea1726bd1bf1fa9a4b21ed358eebf8ef5a9f65690997f7","side":"right"},{"sibling":"185a6afda52a8ccfde226c0d2d3842a6b29e2b1edb314e02a1453fd8c4ed350c","side":"right"},{"sibling":"660a1f6dea97950c3dbf201b466cf0d4bb8ce2e870a7b9c78a4f8b551f0b11ca","side":"left"},{"sibling":"7cb9b06d4f6372fac19d788263daadfaf6def57cc0a73d46bed8b284ec0fe014","side":"right"},{"sibling":"42ade783b0aede9d0209c5be94ac7979e635da84dd65ecb4d383719029bbe8f4","side":"left"},{"sibling":"143f33d3924b3840fd6dd8ba12566fc35bf86189e663ef0ad4884d676f295e3a","side":"left"},{"sibling":"b1ed99341c327c7c9ab2489f40af2547ab3b3b4b6a74fb684210164fb891a413","side":"right"},{"sibling":"6ee3be9bdfc9bee55d32f7dbb0075f02fe87d20887d563d3e300caf36b1b88c7","side":"left"},{"sibling":"8ccd9937a2c0d5c04044d07d1557791b7d07bb31eac41a39a675608d44b38f23","side":"right"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_e4eef43917cc5508a1d033b9bc73a21d77840f2391ec60ea3feaa659f92ae093"}}