{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F7GNMTJLREUYVYJAOHNX64FHUB","short_pith_number":"pith:F7GNMTJL","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"},"canonical_sha256":"2fccd64d2b89298ae12071db7f70a7a061a57f8d0dc5f031a2ff1a6e5b6e46d8","source":{"kind":"arxiv","id":"1807.04239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04239","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04239v2","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04239","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"F7GNMTJLREUY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F7GNMTJLREUYVYJA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F7GNMTJL","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F7GNMTJLREUYVYJAOHNX64FHUB","target":"record","payload":{"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"},"canonical_sha256":"2fccd64d2b89298ae12071db7f70a7a061a57f8d0dc5f031a2ff1a6e5b6e46d8","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"},"source_kind":"arxiv","source_id":"1807.04239","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lczDje/USQ2nYX5mUryvaIu4/hnh8+QVTldD/FB6uHF6lDDpH5KvLnFM9phEKQzGEY58omISW0oLk2KsgH/KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:37:39.163871Z"},"content_sha256":"139a9453b659e0d21ec7a6e43f5239ab07017fcf90558d89a88f14a10e119b2b","schema_version":"1.0","event_id":"sha256:139a9453b659e0d21ec7a6e43f5239ab07017fcf90558d89a88f14a10e119b2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F7GNMTJLREUYVYJAOHNX64FHUB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4qhiVCZ+SiV9x3Ny9iZqn6/Vf6ZgelKwjoQ60lXcVv9hrtYNH2am6wW15qL/SwTKpXglFwY9YV3ChEQMHT3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:37:39.164586Z"},"content_sha256":"ebd24ed89f2f7e96a4cb799f322ccc16bbc7cc84e69be6b89072dcd204aee6e8","schema_version":"1.0","event_id":"sha256:ebd24ed89f2f7e96a4cb799f322ccc16bbc7cc84e69be6b89072dcd204aee6e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/bundle.json","state_url":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7GNMTJLREUYVYJAOHNX64FHUB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T18:37:39Z","links":{"resolver":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB","bundle":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/bundle.json","state":"https://pith.science/pith/F7GNMTJLREUYVYJAOHNX64FHUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7GNMTJLREUYVYJAOHNX64FHUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F7GNMTJLREUYVYJAOHNX64FHUB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e62f154c837ee62c5a941d2808641a294d50c49cfd71d578d2d5864b68d484f2","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T16:41:49Z","title_canon_sha256":"7c0a1b4bb3e0c3a5b00f40e161149a87a6acd46fa2802f0c4381e55ce84cee78"},"schema_version":"1.0","source":{"id":"1807.04239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04239","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04239v2","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04239","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"F7GNMTJLREUY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F7GNMTJLREUYVYJA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F7GNMTJL","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:ebd24ed89f2f7e96a4cb799f322ccc16bbc7cc84e69be6b89072dcd204aee6e8","target":"graph","created_at":"2026-05-17T23:47:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Keith M. Chugg, Peter A. Beerel, Sourya Dey","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T16:41:49Z","title":"Morse Code Datasets for Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04239","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:139a9453b659e0d21ec7a6e43f5239ab07017fcf90558d89a88f14a10e119b2b","target":"record","created_at":"2026-05-17T23:47:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e62f154c837ee62c5a941d2808641a294d50c49cfd71d578d2d5864b68d484f2","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T16:41:49Z","title_canon_sha256":"7c0a1b4bb3e0c3a5b00f40e161149a87a6acd46fa2802f0c4381e55ce84cee78"},"schema_version":"1.0","source":{"id":"1807.04239","kind":"arxiv","version":2}},"canonical_sha256":"2fccd64d2b89298ae12071db7f70a7a061a57f8d0dc5f031a2ff1a6e5b6e46d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fccd64d2b89298ae12071db7f70a7a061a57f8d0dc5f031a2ff1a6e5b6e46d8","first_computed_at":"2026-05-17T23:47:44.247134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.247134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qfhIA4/07+6cBJ2yhskN8IRQB8ijXT03kN7pqQZ+941cpu8JV+blttRJBtHZBXCw+HhAlKqPReUp48SMYb7wAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.247791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:139a9453b659e0d21ec7a6e43f5239ab07017fcf90558d89a88f14a10e119b2b","sha256:ebd24ed89f2f7e96a4cb799f322ccc16bbc7cc84e69be6b89072dcd204aee6e8"],"state_sha256":"6a82e42c7e515ca83e3a5096b1e0dd870005b3fedab9a33101f6da54fa765650"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RG7Lk+5lJ4tD6iFd+tOXG/LHgO0itCZufUCwq7bJ4AvOu+XL4Jc7LetVJvS9p/6ZpWvXeqerKDMpqvTWQEOvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:37:39.167951Z","bundle_sha256":"e80783f054c4da83ca6d819c5872f7c341503cb625ae6879279ec2acf99db299"}}