{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ALFOWMALSQUU4NR3D4BMJNOJ6E","short_pith_number":"pith:ALFOWMAL","canonical_record":{"source":{"id":"1507.01892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-06T11:42:16Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"f05393c991572810e21502058228a131642a10e233a374878420a48fdf04eca6","abstract_canon_sha256":"e641d846ffc464e1518422a5f10d476dd714d3ec973b6b996149c382360012cd"},"schema_version":"1.0"},"canonical_sha256":"02caeb300b94294e363b1f02c4b5c9f1359c423650120727c64f67fe144015ba","source":{"kind":"arxiv","id":"1507.01892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01892","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01892v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01892","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"ALFOWMALSQUU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ALFOWMALSQUU4NR3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ALFOWMAL","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ALFOWMALSQUU4NR3D4BMJNOJ6E","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-06T11:42:16Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"f05393c991572810e21502058228a131642a10e233a374878420a48fdf04eca6","abstract_canon_sha256":"e641d846ffc464e1518422a5f10d476dd714d3ec973b6b996149c382360012cd"},"schema_version":"1.0"},"canonical_sha256":"02caeb300b94294e363b1f02c4b5c9f1359c423650120727c64f67fe144015ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.137174Z","signature_b64":"ue2NCSgQmm7yccXMuG4PvK3WnZYEiuK3GMp2DEMYLl3s6vT2ifP4uVPP7mrCm4xR+qQ/J1/sEbUdsS5V8qxQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02caeb300b94294e363b1f02c4b5c9f1359c423650120727c64f67fe144015ba","last_reissued_at":"2026-05-18T01:37:12.136525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.136525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01892","source_version":1,"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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQP5gz2FVb7ys0Aq7Vn07xNsTgVjU8Ue0WljSkOa0XGa1PoozABUmAM/Mui+NpYJrQZKpwaMrPxNevp2JJQvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:53:18.866253Z"},"content_sha256":"a0ee5c59714e54c78412c01e9bcda4fc37db1e446fba12b7cbf98a27a5451a66","schema_version":"1.0","event_id":"sha256:a0ee5c59714e54c78412c01e9bcda4fc37db1e446fba12b7cbf98a27a5451a66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ALFOWMALSQUU4NR3D4BMJNOJ6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear approach for sparse coding by a two-layer neural network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cs.LG","authors_text":"Alessandro Montalto, Giovanni Tessitore, Roberto Prevete","submitted_at":"2015-07-06T11:42:16Z","abstract_excerpt":"Many approaches to transform classification problems from non-linear to linear by feature transformation have been recently presented in the literature. These notably include sparse coding methods and deep neural networks. However, many of these approaches require the repeated application of a learning process upon the presentation of unseen data input vectors, or else involve the use of large numbers of parameters and hyper-parameters, which must be chosen through cross-validation, thus increasing running time dramatically. In this paper, we propose and experimentally investigate a new approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01892","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":""},"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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHotn/DIJ/RYqxZTMVcqlRTCNlv+HbhPtnBrcGqcZFP55QoeeRJ+M696UFDxgt8ql3f9Pbj8XsO94gD4K0UPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:53:18.866623Z"},"content_sha256":"e966a20d9c3dd0f345273d7c6ab2334e8d5956a22fd3277573c13724f0901f5d","schema_version":"1.0","event_id":"sha256:e966a20d9c3dd0f345273d7c6ab2334e8d5956a22fd3277573c13724f0901f5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E/bundle.json","state_url":"https://pith.science/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E/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-05-28T12:53:18Z","links":{"resolver":"https://pith.science/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E","bundle":"https://pith.science/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E/bundle.json","state":"https://pith.science/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALFOWMALSQUU4NR3D4BMJNOJ6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ALFOWMALSQUU4NR3D4BMJNOJ6E","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":"e641d846ffc464e1518422a5f10d476dd714d3ec973b6b996149c382360012cd","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-06T11:42:16Z","title_canon_sha256":"f05393c991572810e21502058228a131642a10e233a374878420a48fdf04eca6"},"schema_version":"1.0","source":{"id":"1507.01892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01892","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01892v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01892","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"ALFOWMALSQUU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ALFOWMALSQUU4NR3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ALFOWMAL","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:e966a20d9c3dd0f345273d7c6ab2334e8d5956a22fd3277573c13724f0901f5d","target":"graph","created_at":"2026-05-18T01:37:12Z","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":"Many approaches to transform classification problems from non-linear to linear by feature transformation have been recently presented in the literature. These notably include sparse coding methods and deep neural networks. However, many of these approaches require the repeated application of a learning process upon the presentation of unseen data input vectors, or else involve the use of large numbers of parameters and hyper-parameters, which must be chosen through cross-validation, thus increasing running time dramatically. In this paper, we propose and experimentally investigate a new approa","authors_text":"Alessandro Montalto, Giovanni Tessitore, Roberto Prevete","cross_cats":["physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-06T11:42:16Z","title":"A linear approach for sparse coding by a two-layer neural network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01892","kind":"arxiv","version":1},"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:a0ee5c59714e54c78412c01e9bcda4fc37db1e446fba12b7cbf98a27a5451a66","target":"record","created_at":"2026-05-18T01:37:12Z","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":"e641d846ffc464e1518422a5f10d476dd714d3ec973b6b996149c382360012cd","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-06T11:42:16Z","title_canon_sha256":"f05393c991572810e21502058228a131642a10e233a374878420a48fdf04eca6"},"schema_version":"1.0","source":{"id":"1507.01892","kind":"arxiv","version":1}},"canonical_sha256":"02caeb300b94294e363b1f02c4b5c9f1359c423650120727c64f67fe144015ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02caeb300b94294e363b1f02c4b5c9f1359c423650120727c64f67fe144015ba","first_computed_at":"2026-05-18T01:37:12.136525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:12.136525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ue2NCSgQmm7yccXMuG4PvK3WnZYEiuK3GMp2DEMYLl3s6vT2ifP4uVPP7mrCm4xR+qQ/J1/sEbUdsS5V8qxQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:12.137174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0ee5c59714e54c78412c01e9bcda4fc37db1e446fba12b7cbf98a27a5451a66","sha256:e966a20d9c3dd0f345273d7c6ab2334e8d5956a22fd3277573c13724f0901f5d"],"state_sha256":"6f8d669af619957d87205028a596fb80ae6793484e33be3a9a37acde80e53549"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEqLgiXY1BE878fEwsktGI2jXV47hYnkwPixVszVz7SUQjUGm/6fDvi6K+8We3cP7dP/qzVgbkw3XhQdJJZ3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:53:18.868723Z","bundle_sha256":"42d3b78f3ad69a0f5359c37aad41e272dbcc3475a3b8fea5d6368253cfe62336"}}