{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NLAWSBQ2GD3VPBYFT4543PJRYN","short_pith_number":"pith:NLAWSBQ2","schema_version":"1.0","canonical_sha256":"6ac169061a30f75787059f3bcdbd31c35a3915f9c6d96063cfe57f49ab4b94ba","source":{"kind":"arxiv","id":"1503.01002","version":1},"attestation_state":"computed","paper":{"title":"Projection onto the capped simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Weiran Wang","submitted_at":"2015-03-03T16:40:17Z","abstract_excerpt":"We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and C++ implementations of the proposed algorithm can be downloaded at https://eng.ucmerced.edu/people/wwang5."},"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":"1503.01002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-03T16:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"8f3df22ba693ea59dff1b3d393a620d09ec9a45f462de0425ee32cbc8353c1b3","abstract_canon_sha256":"ba52958eb2d29bbff49cee5f986a52e21aec9313be5f22985c32d45b81d2a2f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:47.923142Z","signature_b64":"YmMSZSOghlRoC7YaypRDhWTR3RMOcDsqxV86e1Z1GlHKJBybAKuy+zaE1LY6fPgWisAW277FIG0xODNIJHVMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac169061a30f75787059f3bcdbd31c35a3915f9c6d96063cfe57f49ab4b94ba","last_reissued_at":"2026-05-18T02:25:47.922578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:47.922578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection onto the capped simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Weiran Wang","submitted_at":"2015-03-03T16:40:17Z","abstract_excerpt":"We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and C++ implementations of the proposed algorithm can be downloaded at https://eng.ucmerced.edu/people/wwang5."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01002","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":"1503.01002","created_at":"2026-05-18T02:25:47.922661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01002v1","created_at":"2026-05-18T02:25:47.922661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01002","created_at":"2026-05-18T02:25:47.922661+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLAWSBQ2GD3V","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLAWSBQ2GD3VPBYF","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLAWSBQ2","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20069","citing_title":"Smooth Partial Lotteries for Stable Randomized Selection","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06900","citing_title":"Accelerated Relax-and-Round for Concave Coverage Problems","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN","json":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN.json","graph_json":"https://pith.science/api/pith-number/NLAWSBQ2GD3VPBYFT4543PJRYN/graph.json","events_json":"https://pith.science/api/pith-number/NLAWSBQ2GD3VPBYFT4543PJRYN/events.json","paper":"https://pith.science/paper/NLAWSBQ2"},"agent_actions":{"view_html":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN","download_json":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN.json","view_paper":"https://pith.science/paper/NLAWSBQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01002&json=true","fetch_graph":"https://pith.science/api/pith-number/NLAWSBQ2GD3VPBYFT4543PJRYN/graph.json","fetch_events":"https://pith.science/api/pith-number/NLAWSBQ2GD3VPBYFT4543PJRYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN/action/storage_attestation","attest_author":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN/action/author_attestation","sign_citation":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN/action/citation_signature","submit_replication":"https://pith.science/pith/NLAWSBQ2GD3VPBYFT4543PJRYN/action/replication_record"}},"created_at":"2026-05-18T02:25:47.922661+00:00","updated_at":"2026-05-18T02:25:47.922661+00:00"}