{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VQXMYKJFZXRQXMADDANW3QA3IV","short_pith_number":"pith:VQXMYKJF","schema_version":"1.0","canonical_sha256":"ac2ecc2925cde30bb003181b6dc01b45634c983b93b634070585b80a5a0abf61","source":{"kind":"arxiv","id":"1602.04105","version":3},"attestation_state":"computed","paper":{"title":"Convolutional Radio Modulation Recognition Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Johnathan Corgan, T. Charles Clancy, Timothy J O'Shea","submitted_at":"2016-02-12T16:28:59Z","abstract_excerpt":"We study the adaptation of convolutional neural networks to the complex temporal radio signal domain. We compare the efficacy of radio modulation classification using naively learned features against using expert features which are widely used in the field today and we show significant performance improvements. We show that blind temporal learning on large and densely encoded time series using deep convolutional neural networks is viable and a strong candidate approach for this task especially at low signal to noise ratio."},"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":"1602.04105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-12T16:28:59Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"13ec9d4ccd74faa182bcf6a2326de72fb5d1fd3ead37d761ca20a9e95eb58ea5","abstract_canon_sha256":"f7cd3f4ff7d09cb5ab9bc9313adc6cdbc7e0a6813251ecc723afaedbe2de768b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.480428Z","signature_b64":"88yThw+xIghQVr1O7XQy78ygy3M2oZ9IfNE6MTiLuC1pEWLsAfcSKtzeQr4j4rU9wqJZ6DO7xDZuI4rUtns4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2ecc2925cde30bb003181b6dc01b45634c983b93b634070585b80a5a0abf61","last_reissued_at":"2026-05-18T01:12:34.479986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.479986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutional Radio Modulation Recognition Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Johnathan Corgan, T. Charles Clancy, Timothy J O'Shea","submitted_at":"2016-02-12T16:28:59Z","abstract_excerpt":"We study the adaptation of convolutional neural networks to the complex temporal radio signal domain. We compare the efficacy of radio modulation classification using naively learned features against using expert features which are widely used in the field today and we show significant performance improvements. We show that blind temporal learning on large and densely encoded time series using deep convolutional neural networks is viable and a strong candidate approach for this task especially at low signal to noise ratio."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04105","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":""},"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":"1602.04105","created_at":"2026-05-18T01:12:34.480058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04105v3","created_at":"2026-05-18T01:12:34.480058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04105","created_at":"2026-05-18T01:12:34.480058+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQXMYKJFZXRQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQXMYKJFZXRQXMAD","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQXMYKJF","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.10048","citing_title":"SurReal: Fr\\'echet Mean and Distance Transform for Complex-Valued Deep Learning","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2512.09893","citing_title":"A Speculative GLRT-Backed ApproachRobust Deep Learning-Based Array Processing","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV","json":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV.json","graph_json":"https://pith.science/api/pith-number/VQXMYKJFZXRQXMADDANW3QA3IV/graph.json","events_json":"https://pith.science/api/pith-number/VQXMYKJFZXRQXMADDANW3QA3IV/events.json","paper":"https://pith.science/paper/VQXMYKJF"},"agent_actions":{"view_html":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV","download_json":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV.json","view_paper":"https://pith.science/paper/VQXMYKJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04105&json=true","fetch_graph":"https://pith.science/api/pith-number/VQXMYKJFZXRQXMADDANW3QA3IV/graph.json","fetch_events":"https://pith.science/api/pith-number/VQXMYKJFZXRQXMADDANW3QA3IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV/action/storage_attestation","attest_author":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV/action/author_attestation","sign_citation":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV/action/citation_signature","submit_replication":"https://pith.science/pith/VQXMYKJFZXRQXMADDANW3QA3IV/action/replication_record"}},"created_at":"2026-05-18T01:12:34.480058+00:00","updated_at":"2026-05-18T01:12:34.480058+00:00"}