{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Z7S3KAAACRQAOYGHRH6HOGCITJ","short_pith_number":"pith:Z7S3KAAA","schema_version":"1.0","canonical_sha256":"cfe5b5000014600760c789fc7718489a66f7581d2dbab79bc96d94a8efba6fa1","source":{"kind":"arxiv","id":"2011.13699","version":3},"attestation_state":"computed","paper":{"title":"A Grassmann Manifold Handbook: Basic Geometry and Computational Aspects","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.DG"],"primary_cat":"math.NA","authors_text":"P.-A. Absil, Ralf Zimmermann, Thomas Bendokat","submitted_at":"2020-11-27T12:29:28Z","abstract_excerpt":"The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems, dynamic low-rank decompositions and model reduction. With this mostly expository work, we aim to provide a collection of the essential facts and formulae on the geometry of the Grassmann manifold in a fashion that is fit for tackling the aforementioned problems with matrix-based algorithms. Moreover, we expose the Grassmann geometry both from the approach o"},"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":"2011.13699","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2020-11-27T12:29:28Z","cross_cats_sorted":["cs.NA","math.DG"],"title_canon_sha256":"2de8808f610e4a15d50d51eafb295fbe0e46ebea2acd54efc8b4512b218e6f57","abstract_canon_sha256":"1a0698f49a9ad9ff48db86c82193817f5d38605491b9b09ea5fe91aea4622ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:41.429914Z","signature_b64":"aNoyOd2siCtur/yA3+WWHmYSv/RG6dX4D70KJCw6soUzabMNvWucpnYY8NRgGxM0oxywUJLwEGxtF6MHezw3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfe5b5000014600760c789fc7718489a66f7581d2dbab79bc96d94a8efba6fa1","last_reissued_at":"2026-07-05T07:30:41.429554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:41.429554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Grassmann Manifold Handbook: Basic Geometry and Computational Aspects","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.DG"],"primary_cat":"math.NA","authors_text":"P.-A. Absil, Ralf Zimmermann, Thomas Bendokat","submitted_at":"2020-11-27T12:29:28Z","abstract_excerpt":"The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems, dynamic low-rank decompositions and model reduction. With this mostly expository work, we aim to provide a collection of the essential facts and formulae on the geometry of the Grassmann manifold in a fashion that is fit for tackling the aforementioned problems with matrix-based algorithms. Moreover, we expose the Grassmann geometry both from the approach o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13699","kind":"arxiv","version":3},"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/2011.13699/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":"2011.13699","created_at":"2026-07-05T07:30:41.429609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.13699v3","created_at":"2026-07-05T07:30:41.429609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13699","created_at":"2026-07-05T07:30:41.429609+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7S3KAAACRQA","created_at":"2026-07-05T07:30:41.429609+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7S3KAAACRQAOYGH","created_at":"2026-07-05T07:30:41.429609+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7S3KAAA","created_at":"2026-07-05T07:30:41.429609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05872","citing_title":"No Subspace to Track: Non-Identifiability and Optimizer State in Low-Rank Training","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22334","citing_title":"Riemannian geometry meets fMRI: the advantages of modeling correlation manifolds and eigenvector subspaces","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ","json":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ.json","graph_json":"https://pith.science/api/pith-number/Z7S3KAAACRQAOYGHRH6HOGCITJ/graph.json","events_json":"https://pith.science/api/pith-number/Z7S3KAAACRQAOYGHRH6HOGCITJ/events.json","paper":"https://pith.science/paper/Z7S3KAAA"},"agent_actions":{"view_html":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ","download_json":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ.json","view_paper":"https://pith.science/paper/Z7S3KAAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.13699&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7S3KAAACRQAOYGHRH6HOGCITJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7S3KAAACRQAOYGHRH6HOGCITJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ/action/storage_attestation","attest_author":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ/action/author_attestation","sign_citation":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ/action/citation_signature","submit_replication":"https://pith.science/pith/Z7S3KAAACRQAOYGHRH6HOGCITJ/action/replication_record"}},"created_at":"2026-07-05T07:30:41.429609+00:00","updated_at":"2026-07-05T07:30:41.429609+00:00"}