{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SSKJANDNUUSSZLCNWB6FD53LTP","short_pith_number":"pith:SSKJANDN","schema_version":"1.0","canonical_sha256":"949490346da5252cac4db07c51f76b9be878f87c9e0537429b35b080c730fdc2","source":{"kind":"arxiv","id":"1101.6081","version":2},"attestation_state":"computed","paper":{"title":"Projection Onto A Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojing Ye, Yunmei Chen","submitted_at":"2011-01-31T20:59:45Z","abstract_excerpt":"This mini-paper presents a fast and simple algorithm to compute the projection onto the canonical simplex $\\triangle^n$. Utilizing the Moreau's identity, we show that the problem is essentially a univariate minimization and the objective function is strictly convex and continuously differentiable. Moreover, it is shown that there are at most n candidates which can be computed explicitly, and the minimizer is the only one that falls into the correct interval."},"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":"1101.6081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-01-31T20:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"37c9a6334f6fb0b2cb2ca2afc6b46f9a2e235cd4b93016e33b0a4b8d7c83d5fe","abstract_canon_sha256":"8036bddb3bb396ac2d8dfed0ae973d900848589063501a94214e39d42febe6a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.625807Z","signature_b64":"FRE+iOKW2QcyHkdVC72y291G7DMO97FhsAORHQv+hdDrzNdJ/TgmPeXuzSL4QHj+zrR7wWUQ21PcPTRR6Ya1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949490346da5252cac4db07c51f76b9be878f87c9e0537429b35b080c730fdc2","last_reissued_at":"2026-05-18T02:22:41.624990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.624990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection Onto A Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojing Ye, Yunmei Chen","submitted_at":"2011-01-31T20:59:45Z","abstract_excerpt":"This mini-paper presents a fast and simple algorithm to compute the projection onto the canonical simplex $\\triangle^n$. Utilizing the Moreau's identity, we show that the problem is essentially a univariate minimization and the objective function is strictly convex and continuously differentiable. Moreover, it is shown that there are at most n candidates which can be computed explicitly, and the minimizer is the only one that falls into the correct interval."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.6081","kind":"arxiv","version":2},"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":"1101.6081","created_at":"2026-05-18T02:22:41.625126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.6081v2","created_at":"2026-05-18T02:22:41.625126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.6081","created_at":"2026-05-18T02:22:41.625126+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSKJANDNUUSS","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSKJANDNUUSSZLCN","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSKJANDN","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.13267","citing_title":"Learning discrete Bayesian networks with hierarchical Dirichlet shrinkage","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP","json":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP.json","graph_json":"https://pith.science/api/pith-number/SSKJANDNUUSSZLCNWB6FD53LTP/graph.json","events_json":"https://pith.science/api/pith-number/SSKJANDNUUSSZLCNWB6FD53LTP/events.json","paper":"https://pith.science/paper/SSKJANDN"},"agent_actions":{"view_html":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP","download_json":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP.json","view_paper":"https://pith.science/paper/SSKJANDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.6081&json=true","fetch_graph":"https://pith.science/api/pith-number/SSKJANDNUUSSZLCNWB6FD53LTP/graph.json","fetch_events":"https://pith.science/api/pith-number/SSKJANDNUUSSZLCNWB6FD53LTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP/action/storage_attestation","attest_author":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP/action/author_attestation","sign_citation":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP/action/citation_signature","submit_replication":"https://pith.science/pith/SSKJANDNUUSSZLCNWB6FD53LTP/action/replication_record"}},"created_at":"2026-05-18T02:22:41.625126+00:00","updated_at":"2026-05-18T02:22:41.625126+00:00"}