{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IDA4C77Z4NGXV6YRGJO26GAP4L","short_pith_number":"pith:IDA4C77Z","schema_version":"1.0","canonical_sha256":"40c1c17ff9e34d7afb11325daf180fe2f9704c5405a6e3dc3e2eea8939fec3ff","source":{"kind":"arxiv","id":"1603.08367","version":1},"attestation_state":"computed","paper":{"title":"Sparse Activity and Sparse Connectivity in Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"G\\\"unther Palm, Markus Thom","submitted_at":"2016-03-28T12:06:49Z","abstract_excerpt":"Sparseness is a useful regularizer for learning in a wide range of applications, in particular in neural networks. This paper proposes a model targeted at classification tasks, where sparse activity and sparse connectivity are used to enhance classification capabilities. The tool for achieving this is a sparseness-enforcing projection operator which finds the closest vector with a pre-defined sparseness for any given vector. In the theoretical part of this paper, a comprehensive theory for such a projection is developed. In conclusion, it is shown that the projection is differentiable almost e"},"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":"1603.08367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-28T12:06:49Z","cross_cats_sorted":["cs.CG","cs.CV","cs.NE"],"title_canon_sha256":"752c28efc716bf1e5ef2776854fa8178abc7f20e3a433116404a21e651570030","abstract_canon_sha256":"45cd2e214cbe4b7dae285673569d643df5672e80ced16a6e5aa2bd18f155566d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:59.327426Z","signature_b64":"BXU9HhVapl0OZqqqUVapw07iSpS12aVVxtYtn2UkKOPFUtgIeH91NXnQod+fl1yzGuRv73esRs+KR+Dm1/OnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c1c17ff9e34d7afb11325daf180fe2f9704c5405a6e3dc3e2eea8939fec3ff","last_reissued_at":"2026-05-18T01:16:59.326728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:59.326728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Activity and Sparse Connectivity in Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"G\\\"unther Palm, Markus Thom","submitted_at":"2016-03-28T12:06:49Z","abstract_excerpt":"Sparseness is a useful regularizer for learning in a wide range of applications, in particular in neural networks. This paper proposes a model targeted at classification tasks, where sparse activity and sparse connectivity are used to enhance classification capabilities. The tool for achieving this is a sparseness-enforcing projection operator which finds the closest vector with a pre-defined sparseness for any given vector. In the theoretical part of this paper, a comprehensive theory for such a projection is developed. In conclusion, it is shown that the projection is differentiable almost e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08367","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.08367","created_at":"2026-05-18T01:16:59.326850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08367v1","created_at":"2026-05-18T01:16:59.326850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08367","created_at":"2026-05-18T01:16:59.326850+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDA4C77Z4NGX","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDA4C77Z4NGXV6YR","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDA4C77Z","created_at":"2026-05-18T12:30:22.444734+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/IDA4C77Z4NGXV6YRGJO26GAP4L","json":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L.json","graph_json":"https://pith.science/api/pith-number/IDA4C77Z4NGXV6YRGJO26GAP4L/graph.json","events_json":"https://pith.science/api/pith-number/IDA4C77Z4NGXV6YRGJO26GAP4L/events.json","paper":"https://pith.science/paper/IDA4C77Z"},"agent_actions":{"view_html":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L","download_json":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L.json","view_paper":"https://pith.science/paper/IDA4C77Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08367&json=true","fetch_graph":"https://pith.science/api/pith-number/IDA4C77Z4NGXV6YRGJO26GAP4L/graph.json","fetch_events":"https://pith.science/api/pith-number/IDA4C77Z4NGXV6YRGJO26GAP4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L/action/storage_attestation","attest_author":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L/action/author_attestation","sign_citation":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L/action/citation_signature","submit_replication":"https://pith.science/pith/IDA4C77Z4NGXV6YRGJO26GAP4L/action/replication_record"}},"created_at":"2026-05-18T01:16:59.326850+00:00","updated_at":"2026-05-18T01:16:59.326850+00:00"}