{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3FWM6JLNTISCM5QO5SEGH5XYT6","short_pith_number":"pith:3FWM6JLN","schema_version":"1.0","canonical_sha256":"d96ccf256d9a2426760eec8863f6f89f82632f3065fb285180d61c61d3e00c48","source":{"kind":"arxiv","id":"2403.18296","version":3},"attestation_state":"computed","paper":{"title":"GeNet: A Graph Neural Network-based Anti-noise Task-Oriented Semantic Communication Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","eess.SP"],"primary_cat":"cs.LG","authors_text":"Chunhang Zheng, Kechao Cai","submitted_at":"2024-03-27T06:46:59Z","abstract_excerpt":"Traditional approaches to semantic communication tasks rely on the knowledge of the signal-to-noise ratio (SNR) to mitigate channel noise. Moreover, these methods necessitate training under specific SNR conditions, entailing considerable time and computational resources. In this paper, we propose GeNet, a Graph Neural Network (GNN)-based paradigm for semantic communication aimed at combating noise, thereby facilitating Task-Oriented Communication (TOC). We propose a novel approach where we first transform the input data image into graph structures. Then we leverage a GNN-based encoder to extra"},"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":"2403.18296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-27T06:46:59Z","cross_cats_sorted":["cs.AI","eess.SP"],"title_canon_sha256":"4d9ae786573a49c6dcbcd6bb35c45911bd3c1ef2fd4726e6757ce65f4e9945a2","abstract_canon_sha256":"198d272b5e8a22a19a97fa1b7068adcccc7cdb843cebedbb53adff1ec6e51c8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:57.688723Z","signature_b64":"k6vRO37+pU95eUXozeaVfj2g+dwtBxUsHw6Hn6ruZdpEnq68gHUvKxtfT7LY+WDKRzmm6roQDHH+4E741DklAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d96ccf256d9a2426760eec8863f6f89f82632f3065fb285180d61c61d3e00c48","last_reissued_at":"2026-07-05T09:09:57.688218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:57.688218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GeNet: A Graph Neural Network-based Anti-noise Task-Oriented Semantic Communication Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","eess.SP"],"primary_cat":"cs.LG","authors_text":"Chunhang Zheng, Kechao Cai","submitted_at":"2024-03-27T06:46:59Z","abstract_excerpt":"Traditional approaches to semantic communication tasks rely on the knowledge of the signal-to-noise ratio (SNR) to mitigate channel noise. Moreover, these methods necessitate training under specific SNR conditions, entailing considerable time and computational resources. In this paper, we propose GeNet, a Graph Neural Network (GNN)-based paradigm for semantic communication aimed at combating noise, thereby facilitating Task-Oriented Communication (TOC). We propose a novel approach where we first transform the input data image into graph structures. Then we leverage a GNN-based encoder to extra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18296","kind":"arxiv","version":3},"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/2403.18296/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":"2403.18296","created_at":"2026-07-05T09:09:57.688273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18296v3","created_at":"2026-07-05T09:09:57.688273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18296","created_at":"2026-07-05T09:09:57.688273+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FWM6JLNTISC","created_at":"2026-07-05T09:09:57.688273+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FWM6JLNTISCM5QO","created_at":"2026-07-05T09:09:57.688273+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FWM6JLN","created_at":"2026-07-05T09:09:57.688273+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07422","citing_title":"Computation-resource-efficient Task-oriented Communications","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6","json":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6.json","graph_json":"https://pith.science/api/pith-number/3FWM6JLNTISCM5QO5SEGH5XYT6/graph.json","events_json":"https://pith.science/api/pith-number/3FWM6JLNTISCM5QO5SEGH5XYT6/events.json","paper":"https://pith.science/paper/3FWM6JLN"},"agent_actions":{"view_html":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6","download_json":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6.json","view_paper":"https://pith.science/paper/3FWM6JLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18296&json=true","fetch_graph":"https://pith.science/api/pith-number/3FWM6JLNTISCM5QO5SEGH5XYT6/graph.json","fetch_events":"https://pith.science/api/pith-number/3FWM6JLNTISCM5QO5SEGH5XYT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6/action/storage_attestation","attest_author":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6/action/author_attestation","sign_citation":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6/action/citation_signature","submit_replication":"https://pith.science/pith/3FWM6JLNTISCM5QO5SEGH5XYT6/action/replication_record"}},"created_at":"2026-07-05T09:09:57.688273+00:00","updated_at":"2026-07-05T09:09:57.688273+00:00"}