{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CYCWUAVJLBOAQ3WACDGSTKEHBN","short_pith_number":"pith:CYCWUAVJ","schema_version":"1.0","canonical_sha256":"16056a02a9585c086ec010cd29a8870b46740cf51747f9720b3d98a380519529","source":{"kind":"arxiv","id":"2509.04801","version":1},"attestation_state":"computed","paper":{"title":"KGRAG-SC: Knowledge Graph RAG-Assisted Semantic Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Dayu Fan, Rui Meng, Song Gao, Xiaodong Xu","submitted_at":"2025-09-05T04:33:12Z","abstract_excerpt":"The state-of-the-art semantic communication (SC) schemes typically rely on end-to-end deep learning frameworks that lack interpretability and struggle with robust semantic selection and reconstruction under noisy conditions. To address this issue, this paper presents KGRAG-SC, a knowledge graph-assisted SC framework that leverages retrieval-augmented generation principles. KGRAG-SC employs a multi-dimensional knowledge graph, enabling efficient semantic extraction through community-guided entity linking and GraphRAG-assisted processing. The transmitter constructs minimal connected subgraphs th"},"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":"2509.04801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-09-05T04:33:12Z","cross_cats_sorted":[],"title_canon_sha256":"52cc8f85df1dc1d4d6e0d8fc6340edeebe68c7b52643f9d655a4b6116ae4cb26","abstract_canon_sha256":"d58a173abbed2cbcb7513f29a6b9aadc8173c14ea0a0e18472934575c1529ecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:29.963541Z","signature_b64":"VWeJKkpSw4WlRl6uQrfZ7awntMlHhFia0fYUrZSf1DCpKAK5FQkqwHUUgoMlqHwZYdnF+5JQVK4/KRyzMT18CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16056a02a9585c086ec010cd29a8870b46740cf51747f9720b3d98a380519529","last_reissued_at":"2026-07-05T12:05:29.963074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:29.963074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KGRAG-SC: Knowledge Graph RAG-Assisted Semantic Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Dayu Fan, Rui Meng, Song Gao, Xiaodong Xu","submitted_at":"2025-09-05T04:33:12Z","abstract_excerpt":"The state-of-the-art semantic communication (SC) schemes typically rely on end-to-end deep learning frameworks that lack interpretability and struggle with robust semantic selection and reconstruction under noisy conditions. To address this issue, this paper presents KGRAG-SC, a knowledge graph-assisted SC framework that leverages retrieval-augmented generation principles. KGRAG-SC employs a multi-dimensional knowledge graph, enabling efficient semantic extraction through community-guided entity linking and GraphRAG-assisted processing. The transmitter constructs minimal connected subgraphs th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04801","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/2509.04801/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":"2509.04801","created_at":"2026-07-05T12:05:29.963129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04801v1","created_at":"2026-07-05T12:05:29.963129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04801","created_at":"2026-07-05T12:05:29.963129+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYCWUAVJLBOA","created_at":"2026-07-05T12:05:29.963129+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYCWUAVJLBOAQ3WA","created_at":"2026-07-05T12:05:29.963129+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYCWUAVJ","created_at":"2026-07-05T12:05:29.963129+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":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN","json":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN.json","graph_json":"https://pith.science/api/pith-number/CYCWUAVJLBOAQ3WACDGSTKEHBN/graph.json","events_json":"https://pith.science/api/pith-number/CYCWUAVJLBOAQ3WACDGSTKEHBN/events.json","paper":"https://pith.science/paper/CYCWUAVJ"},"agent_actions":{"view_html":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN","download_json":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN.json","view_paper":"https://pith.science/paper/CYCWUAVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04801&json=true","fetch_graph":"https://pith.science/api/pith-number/CYCWUAVJLBOAQ3WACDGSTKEHBN/graph.json","fetch_events":"https://pith.science/api/pith-number/CYCWUAVJLBOAQ3WACDGSTKEHBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN/action/storage_attestation","attest_author":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN/action/author_attestation","sign_citation":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN/action/citation_signature","submit_replication":"https://pith.science/pith/CYCWUAVJLBOAQ3WACDGSTKEHBN/action/replication_record"}},"created_at":"2026-07-05T12:05:29.963129+00:00","updated_at":"2026-07-05T12:05:29.963129+00:00"}