{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OZ5KPPFZEU7PX6VD54KJXUUTCC","short_pith_number":"pith:OZ5KPPFZ","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"},"canonical_sha256":"767aa7bcb9253efbfaa3ef149bd29310bf9510dc5883989d91397b1b40b0bba8","source":{"kind":"arxiv","id":"1303.5259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5259","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5259v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5259","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"OZ5KPPFZEU7P","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OZ5KPPFZEU7PX6VD","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OZ5KPPFZ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OZ5KPPFZEU7PX6VD54KJXUUTCC","target":"record","payload":{"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"},"canonical_sha256":"767aa7bcb9253efbfaa3ef149bd29310bf9510dc5883989d91397b1b40b0bba8","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"},"source_kind":"arxiv","source_id":"1303.5259","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-18T03:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9RWbDTNN7KlJsQ09Dv/0BbVi5U4X2wBUeyTxYbWUketPT4NTUajb/QWm71A+chHGYoA91AM+AaTP/EJMrVrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:43:45.763746Z"},"content_sha256":"6c0d9275fabe4b3785b78ed8bdfcc444b28f217e5efd92241cc0a68a60543d80","schema_version":"1.0","event_id":"sha256:6c0d9275fabe4b3785b78ed8bdfcc444b28f217e5efd92241cc0a68a60543d80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OZ5KPPFZEU7PX6VD54KJXUUTCC","target":"graph","payload":{"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"},"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-18T03:30:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kizxGf43qPL+/1Z+8kC7t66263IAT7BxTKwfyv9l/Y5vOPU2DOn+9ZNYyN8XN+0gCnRplZrGLJfVGjiHDSmhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:43:45.764497Z"},"content_sha256":"53593957d1a26730b51cc92d7acd16c703a448685d5c0fb21e9117c663e07b46","schema_version":"1.0","event_id":"sha256:53593957d1a26730b51cc92d7acd16c703a448685d5c0fb21e9117c663e07b46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/bundle.json","state_url":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/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-09T03:43:45Z","links":{"resolver":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC","bundle":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/bundle.json","state":"https://pith.science/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZ5KPPFZEU7PX6VD54KJXUUTCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OZ5KPPFZEU7PX6VD54KJXUUTCC","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":"8cb88367c5f4473d479f999576cfc981bbd8aafa63c81f2339a4260e02a5877a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-21T14:01:14Z","title_canon_sha256":"55cabe8233295e82b02c016c1bead417db1e5660ac785cd42eb66e5fec30737d"},"schema_version":"1.0","source":{"id":"1303.5259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.5259","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"arxiv_version","alias_value":"1303.5259v1","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5259","created_at":"2026-05-18T03:30:13Z"},{"alias_kind":"pith_short_12","alias_value":"OZ5KPPFZEU7P","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OZ5KPPFZEU7PX6VD","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OZ5KPPFZ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:53593957d1a26730b51cc92d7acd16c703a448685d5c0fb21e9117c663e07b46","target":"graph","created_at":"2026-05-18T03:30:13Z","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 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","authors_text":"G\\\"unther Palm, Markus Thom","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-21T14:01:14Z","title":"Efficient Sparseness-Enforcing Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5259","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:6c0d9275fabe4b3785b78ed8bdfcc444b28f217e5efd92241cc0a68a60543d80","target":"record","created_at":"2026-05-18T03:30:13Z","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":"8cb88367c5f4473d479f999576cfc981bbd8aafa63c81f2339a4260e02a5877a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-21T14:01:14Z","title_canon_sha256":"55cabe8233295e82b02c016c1bead417db1e5660ac785cd42eb66e5fec30737d"},"schema_version":"1.0","source":{"id":"1303.5259","kind":"arxiv","version":1}},"canonical_sha256":"767aa7bcb9253efbfaa3ef149bd29310bf9510dc5883989d91397b1b40b0bba8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767aa7bcb9253efbfaa3ef149bd29310bf9510dc5883989d91397b1b40b0bba8","first_computed_at":"2026-05-18T03:30:13.398643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:13.398643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"20jpNxnG64FnPHhiQ5bpO+SQfxvog7kFHy5ylp+MhLYZIcYT4qJq7R6lvs5X+JZcIaBKdW10AcevekxHPW/VBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:13.399431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.5259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c0d9275fabe4b3785b78ed8bdfcc444b28f217e5efd92241cc0a68a60543d80","sha256:53593957d1a26730b51cc92d7acd16c703a448685d5c0fb21e9117c663e07b46"],"state_sha256":"993bcc13de1c71041c4e4ebd13c4f1a99c91d3d8e37e27373d6c8e8671f3dbef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6bfPL2taFlNetK26vHeHN65Tq9YyXH9b8nVIj3f3f744rZuIu0fXr4c0OX7cFujuZGwGkQnBJIpeI+sRkvHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:43:45.768210Z","bundle_sha256":"7dcb9c2ef8137909ffa297d6badf4ba09836fb4102e314491d8f74e205b7dc96"}}