{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OZ5KPPFZEU7PX6VD54KJXUUTCC","short_pith_number":"pith:OZ5KPPFZ","schema_version":"1.0","canonical_sha256":"767aa7bcb9253efbfaa3ef149bd29310bf9510dc5883989d91397b1b40b0bba8","source":{"kind":"arxiv","id":"1303.5259","version":1},"attestation_state":"computed","paper":{"title":"Efficient Sparseness-Enforcing Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"G\\\"unther Palm, Markus Thom","submitted_at":"2013-03-21T14:01:14Z","abstract_excerpt":"We propose a linear time and constant space algorithm for computing Euclidean projections onto sets on which a normalized sparseness measure attains a constant value. These non-convex target sets can be characterized as intersections of a simplex and a hypersphere. Some previous methods required the vector to be projected to be sorted, resulting in at least quasilinear time complexity and linear space complexity. We improve on this by adaptation of a linear time algorithm for projecting onto simplexes. In conclusion, we propose an efficient algorithm for computing the product of the gradient o"},"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":"1303.5259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-21T14:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"55cabe8233295e82b02c016c1bead417db1e5660ac785cd42eb66e5fec30737d","abstract_canon_sha256":"8cb88367c5f4473d479f999576cfc981bbd8aafa63c81f2339a4260e02a5877a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:13.399431Z","signature_b64":"20jpNxnG64FnPHhiQ5bpO+SQfxvog7kFHy5ylp+MhLYZIcYT4qJq7R6lvs5X+JZcIaBKdW10AcevekxHPW/VBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"767aa7bcb9253efbfaa3ef149bd29310bf9510dc5883989d91397b1b40b0bba8","last_reissued_at":"2026-05-18T03:30:13.398643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:13.398643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sparseness-Enforcing Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"G\\\"unther Palm, Markus Thom","submitted_at":"2013-03-21T14:01:14Z","abstract_excerpt":"We propose a linear time and constant space algorithm for computing Euclidean projections onto sets on which a normalized sparseness measure attains a constant value. These non-convex target sets can be characterized as intersections of a simplex and a hypersphere. Some previous methods required the vector to be projected to be sorted, resulting in at least quasilinear time complexity and linear space complexity. We improve on this by adaptation of a linear time algorithm for projecting onto simplexes. In conclusion, we propose an efficient algorithm for computing the product of the gradient o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5259","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":"1303.5259","created_at":"2026-05-18T03:30:13.398760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5259v1","created_at":"2026-05-18T03:30:13.398760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5259","created_at":"2026-05-18T03:30:13.398760+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZ5KPPFZEU7P","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZ5KPPFZEU7PX6VD","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZ5KPPFZ","created_at":"2026-05-18T12:27:54.935989+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/OZ5KPPFZEU7PX6VD54KJXUUTCC","json":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC.json","graph_json":"https://pith.science/api/pith-number/OZ5KPPFZEU7PX6VD54KJXUUTCC/graph.json","events_json":"https://pith.science/api/pith-number/OZ5KPPFZEU7PX6VD54KJXUUTCC/events.json","paper":"https://pith.science/paper/OZ5KPPFZ"},"agent_actions":{"view_html":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC","download_json":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC.json","view_paper":"https://pith.science/paper/OZ5KPPFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5259&json=true","fetch_graph":"https://pith.science/api/pith-number/OZ5KPPFZEU7PX6VD54KJXUUTCC/graph.json","fetch_events":"https://pith.science/api/pith-number/OZ5KPPFZEU7PX6VD54KJXUUTCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/action/storage_attestation","attest_author":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/action/author_attestation","sign_citation":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/action/citation_signature","submit_replication":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/action/replication_record"}},"created_at":"2026-05-18T03:30:13.398760+00:00","updated_at":"2026-05-18T03:30:13.398760+00:00"}