{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:U4UXEVJW6WV47EDEFUITI7DQZG","short_pith_number":"pith:U4UXEVJW","schema_version":"1.0","canonical_sha256":"a729725536f5abcf90642d11347c70c9bbc49565b5d823f72e33d13ae366f813","source":{"kind":"arxiv","id":"2009.13502","version":1},"attestation_state":"computed","paper":{"title":"Simpler Grassmannian optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ke Ye, Lek-Heng Lim, Zehua Lai","submitted_at":"2020-09-28T17:49:19Z","abstract_excerpt":"There are two widely used models for the Grassmannian $\\operatorname{Gr}(k,n)$, as the set of equivalence classes of orthogonal matrices $\\operatorname{O}(n)/(\\operatorname{O}(k) \\times \\operatorname{O}(n-k))$, and as the set of trace-$k$ projection matrices $\\{P \\in \\mathbb{R}^{n \\times n} : P^{\\mathsf{T}} = P = P^2,\\; \\operatorname{tr}(P) = k\\}$. The former, standard in manifold optimization, has the advantage of giving numerically stable algorithms but the disadvantage of having to work with equivalence classes of matrices. The latter, widely used in coding theory and probability, has the a"},"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":"2009.13502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-28T17:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"97eb505e5a6748826347966dec889fb4996d4815b6c40257a006eb6411c3cbc9","abstract_canon_sha256":"d9614f58278c43aea4b2c33cfb8085a55c9eaa150b3cdef517775bbf08794abe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:30.621087Z","signature_b64":"+lim0ALySIXHMIwjeiWkltQaw3cALE9KW7Xax1X/Dw4atPoiScrMnUGy3FbohLq6ITirp53jWnDEcUu5JdT3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a729725536f5abcf90642d11347c70c9bbc49565b5d823f72e33d13ae366f813","last_reissued_at":"2026-07-05T01:38:30.620693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:30.620693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simpler Grassmannian optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ke Ye, Lek-Heng Lim, Zehua Lai","submitted_at":"2020-09-28T17:49:19Z","abstract_excerpt":"There are two widely used models for the Grassmannian $\\operatorname{Gr}(k,n)$, as the set of equivalence classes of orthogonal matrices $\\operatorname{O}(n)/(\\operatorname{O}(k) \\times \\operatorname{O}(n-k))$, and as the set of trace-$k$ projection matrices $\\{P \\in \\mathbb{R}^{n \\times n} : P^{\\mathsf{T}} = P = P^2,\\; \\operatorname{tr}(P) = k\\}$. The former, standard in manifold optimization, has the advantage of giving numerically stable algorithms but the disadvantage of having to work with equivalence classes of matrices. The latter, widely used in coding theory and probability, has the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.13502","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.13502/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.13502","created_at":"2026-07-05T01:38:30.620761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.13502v1","created_at":"2026-07-05T01:38:30.620761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.13502","created_at":"2026-07-05T01:38:30.620761+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4UXEVJW6WV4","created_at":"2026-07-05T01:38:30.620761+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4UXEVJW6WV47EDE","created_at":"2026-07-05T01:38:30.620761+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4UXEVJW","created_at":"2026-07-05T01:38:30.620761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18257","citing_title":"On the packing dimension of unions and extensions of $k$-planes","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG","json":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG.json","graph_json":"https://pith.science/api/pith-number/U4UXEVJW6WV47EDEFUITI7DQZG/graph.json","events_json":"https://pith.science/api/pith-number/U4UXEVJW6WV47EDEFUITI7DQZG/events.json","paper":"https://pith.science/paper/U4UXEVJW"},"agent_actions":{"view_html":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG","download_json":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG.json","view_paper":"https://pith.science/paper/U4UXEVJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.13502&json=true","fetch_graph":"https://pith.science/api/pith-number/U4UXEVJW6WV47EDEFUITI7DQZG/graph.json","fetch_events":"https://pith.science/api/pith-number/U4UXEVJW6WV47EDEFUITI7DQZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG/action/storage_attestation","attest_author":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG/action/author_attestation","sign_citation":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG/action/citation_signature","submit_replication":"https://pith.science/pith/U4UXEVJW6WV47EDEFUITI7DQZG/action/replication_record"}},"created_at":"2026-07-05T01:38:30.620761+00:00","updated_at":"2026-07-05T01:38:30.620761+00:00"}