{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z2VY2FZM7JD22EOUSMPCEHNKRH","short_pith_number":"pith:Z2VY2FZM","schema_version":"1.0","canonical_sha256":"ceab8d172cfa47ad11d4931e221daa89fdb7b37d661f232031a3486d85ebfc13","source":{"kind":"arxiv","id":"1309.1541","version":1},"attestation_state":"computed","paper":{"title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2013-09-06T05:48:40Z","abstract_excerpt":"We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering."},"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":"1309.1541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-06T05:48:40Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"da183178debb720da835272da7b7d793e3f896aad8c31a3bb14f3db983b6a1db","abstract_canon_sha256":"af8eb9d72ed1290d9be91c01a09eeb697054190bf47fe2b8cf642b7caa789bbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:59.187188Z","signature_b64":"32Lzq6CGCHYbWzFjGe9zglC1EpuMJrnvlYi5krIKDYkaIAYiUpwzs+Qs6QrBFO1AZ5s1puCld5O/aN2WdKdeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceab8d172cfa47ad11d4931e221daa89fdb7b37d661f232031a3486d85ebfc13","last_reissued_at":"2026-05-18T03:13:59.186388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:59.186388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Miguel \\'A. Carreira-Perpi\\~n\\'an, Weiran Wang","submitted_at":"2013-09-06T05:48:40Z","abstract_excerpt":"We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1541","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":"1309.1541","created_at":"2026-05-18T03:13:59.186522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1541v1","created_at":"2026-05-18T03:13:59.186522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1541","created_at":"2026-05-18T03:13:59.186522+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2VY2FZM7JD2","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2VY2FZM7JD22EOU","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2VY2FZM","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.21107","citing_title":"Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction","ref_index":108,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09138","citing_title":"Enhanced quantum capacity thresholds from symmetry","ref_index":62,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08850","citing_title":"Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09138","citing_title":"Enhanced quantum capacity thresholds from symmetry","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06190","citing_title":"Constrained Contextual Bandits with Adversarial Contexts","ref_index":97,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH","json":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH.json","graph_json":"https://pith.science/api/pith-number/Z2VY2FZM7JD22EOUSMPCEHNKRH/graph.json","events_json":"https://pith.science/api/pith-number/Z2VY2FZM7JD22EOUSMPCEHNKRH/events.json","paper":"https://pith.science/paper/Z2VY2FZM"},"agent_actions":{"view_html":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH","download_json":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH.json","view_paper":"https://pith.science/paper/Z2VY2FZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1541&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2VY2FZM7JD22EOUSMPCEHNKRH/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2VY2FZM7JD22EOUSMPCEHNKRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH/action/storage_attestation","attest_author":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH/action/author_attestation","sign_citation":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH/action/citation_signature","submit_replication":"https://pith.science/pith/Z2VY2FZM7JD22EOUSMPCEHNKRH/action/replication_record"}},"created_at":"2026-05-18T03:13:59.186522+00:00","updated_at":"2026-05-18T03:13:59.186522+00:00"}