{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F7GNMTJLREUYVYJAOHNX64FHUB","short_pith_number":"pith:F7GNMTJL","schema_version":"1.0","canonical_sha256":"2fccd64d2b89298ae12071db7f70a7a061a57f8d0dc5f031a2ff1a6e5b6e46d8","source":{"kind":"arxiv","id":"1807.04239","version":2},"attestation_state":"computed","paper":{"title":"Morse Code Datasets for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Keith M. Chugg, Peter A. Beerel, Sourya Dey","submitted_at":"2018-07-11T16:41:49Z","abstract_excerpt":"We present an algorithm to generate synthetic datasets of tunable difficulty on classification of Morse code symbols for supervised machine learning problems, in particular, neural networks. The datasets are spatially one-dimensional and have a small number of input features, leading to high density of input information content. This makes them particularly challenging when implementing network complexity reduction methods. We explore how network performance is affected by deliberately adding various forms of noise and expanding the feature set and dataset size. Finally, we establish several m"},"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":"1807.04239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T16:41:49Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"7c0a1b4bb3e0c3a5b00f40e161149a87a6acd46fa2802f0c4381e55ce84cee78","abstract_canon_sha256":"e62f154c837ee62c5a941d2808641a294d50c49cfd71d578d2d5864b68d484f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.247791Z","signature_b64":"qfhIA4/07+6cBJ2yhskN8IRQB8ijXT03kN7pqQZ+941cpu8JV+blttRJBtHZBXCw+HhAlKqPReUp48SMYb7wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fccd64d2b89298ae12071db7f70a7a061a57f8d0dc5f031a2ff1a6e5b6e46d8","last_reissued_at":"2026-05-17T23:47:44.247134Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.247134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Morse Code Datasets for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Keith M. Chugg, Peter A. Beerel, Sourya Dey","submitted_at":"2018-07-11T16:41:49Z","abstract_excerpt":"We present an algorithm to generate synthetic datasets of tunable difficulty on classification of Morse code symbols for supervised machine learning problems, in particular, neural networks. The datasets are spatially one-dimensional and have a small number of input features, leading to high density of input information content. This makes them particularly challenging when implementing network complexity reduction methods. We explore how network performance is affected by deliberately adding various forms of noise and expanding the feature set and dataset size. Finally, we establish several m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04239","kind":"arxiv","version":2},"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":"1807.04239","created_at":"2026-05-17T23:47:44.247226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04239v2","created_at":"2026-05-17T23:47:44.247226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04239","created_at":"2026-05-17T23:47:44.247226+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7GNMTJLREUY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7GNMTJLREUYVYJA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7GNMTJL","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB","json":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB.json","graph_json":"https://pith.science/api/pith-number/F7GNMTJLREUYVYJAOHNX64FHUB/graph.json","events_json":"https://pith.science/api/pith-number/F7GNMTJLREUYVYJAOHNX64FHUB/events.json","paper":"https://pith.science/paper/F7GNMTJL"},"agent_actions":{"view_html":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB","download_json":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB.json","view_paper":"https://pith.science/paper/F7GNMTJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04239&json=true","fetch_graph":"https://pith.science/api/pith-number/F7GNMTJLREUYVYJAOHNX64FHUB/graph.json","fetch_events":"https://pith.science/api/pith-number/F7GNMTJLREUYVYJAOHNX64FHUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/action/storage_attestation","attest_author":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/action/author_attestation","sign_citation":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/action/citation_signature","submit_replication":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/action/replication_record"}},"created_at":"2026-05-17T23:47:44.247226+00:00","updated_at":"2026-05-17T23:47:44.247226+00:00"}