{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KV3ODEP3SGSS7AASPCD5XR6LTJ","short_pith_number":"pith:KV3ODEP3","canonical_record":{"source":{"id":"2009.10071","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-19T21:03:37Z","cross_cats_sorted":["cs.LG","cs.MS","cs.NA","stat.ML"],"title_canon_sha256":"ab3aeaf573df225745ed8207e1c4e44362fae430933e543f6f1b4a7c2b7f6d91","abstract_canon_sha256":"1ba15c0631776925bb8de55eb93de4cf6ab4f26e0c272860edcc079de32a90a4"},"schema_version":"1.0"},"canonical_sha256":"5576e191fb91a52f80127887dbc7cb9a4b226a80174d9e0c22c9a75de6bdb7db","source":{"kind":"arxiv","id":"2009.10071","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10071","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10071v4","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10071","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"KV3ODEP3SGSS","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"pith_short_16","alias_value":"KV3ODEP3SGSS7AAS","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"pith_short_8","alias_value":"KV3ODEP3","created_at":"2026-07-05T01:58:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KV3ODEP3SGSS7AASPCD5XR6LTJ","target":"record","payload":{"canonical_record":{"source":{"id":"2009.10071","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-19T21:03:37Z","cross_cats_sorted":["cs.LG","cs.MS","cs.NA","stat.ML"],"title_canon_sha256":"ab3aeaf573df225745ed8207e1c4e44362fae430933e543f6f1b4a7c2b7f6d91","abstract_canon_sha256":"1ba15c0631776925bb8de55eb93de4cf6ab4f26e0c272860edcc079de32a90a4"},"schema_version":"1.0"},"canonical_sha256":"5576e191fb91a52f80127887dbc7cb9a4b226a80174d9e0c22c9a75de6bdb7db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:42.558281Z","signature_b64":"D6L8h28/kSFhu7T8DHFRhAY0/FIjlo4MpG2egHxBpbNFy7+aXqYo5Sq2y6RhSEFtc9DdrpKpFpuhJ3EtI+HxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5576e191fb91a52f80127887dbc7cb9a4b226a80174d9e0c22c9a75de6bdb7db","last_reissued_at":"2026-07-05T01:58:42.557859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:42.557859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.10071","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"72tLuEUH4t4xi8HB1HN5Cmsq3bp/0ExF/XuOnX4HD2p59E1FiTZQIbif16Lm8/ojV7TvKdxMIRJPuQcyYi59DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:06:49.054358Z"},"content_sha256":"d6ba7706b4402d035b49ac4489e10e4a34d6d29c9103645b2d0083f2a2a8953a","schema_version":"1.0","event_id":"sha256:d6ba7706b4402d035b49ac4489e10e4a34d6d29c9103645b2d0083f2a2a8953a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KV3ODEP3SGSS7AASPCD5XR6LTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QR and LQ Decomposition Matrix Backpropagation Algorithms for Square, Wide, and Deep -- Real or Complex -- Matrices and Their Software Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MS","cs.NA","stat.ML"],"primary_cat":"math.NA","authors_text":"Denisa A.O. Roberts, Lucas R. Roberts","submitted_at":"2020-09-19T21:03:37Z","abstract_excerpt":"This article presents matrix backpropagation algorithms for the QR decomposition of matrices $A_{m, n}$, that are either square (m = n), wide (m < n), or deep (m > n), with rank $k = min(m, n)$. Furthermore, we derive novel matrix backpropagation results for the pivoted (full-rank) QR decomposition and for the LQ decomposition of deep input matrices. Differentiable QR decomposition offers a numerically stable, computationally efficient method to solve least squares problems frequently encountered in machine learning and computer vision. Other use cases such as graph learning and network compre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10071","kind":"arxiv","version":4},"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.10071/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laR/+6nQOp0eCCFUJnRLPfT6/qIMtJNwWjMTw06w8jbFKmjdzlAhhPZF3097ufREMIp7k+hssVWxXKHNwDLyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:06:49.055168Z"},"content_sha256":"b0697575d12cd1495840466697e278a34e6b8f167e5d9d78b102da3a4b68f8c4","schema_version":"1.0","event_id":"sha256:b0697575d12cd1495840466697e278a34e6b8f167e5d9d78b102da3a4b68f8c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ/bundle.json","state_url":"https://pith.science/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T14:06:49Z","links":{"resolver":"https://pith.science/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ","bundle":"https://pith.science/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ/bundle.json","state":"https://pith.science/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV3ODEP3SGSS7AASPCD5XR6LTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KV3ODEP3SGSS7AASPCD5XR6LTJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ba15c0631776925bb8de55eb93de4cf6ab4f26e0c272860edcc079de32a90a4","cross_cats_sorted":["cs.LG","cs.MS","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-19T21:03:37Z","title_canon_sha256":"ab3aeaf573df225745ed8207e1c4e44362fae430933e543f6f1b4a7c2b7f6d91"},"schema_version":"1.0","source":{"id":"2009.10071","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10071","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10071v4","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10071","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"KV3ODEP3SGSS","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"pith_short_16","alias_value":"KV3ODEP3SGSS7AAS","created_at":"2026-07-05T01:58:42Z"},{"alias_kind":"pith_short_8","alias_value":"KV3ODEP3","created_at":"2026-07-05T01:58:42Z"}],"graph_snapshots":[{"event_id":"sha256:b0697575d12cd1495840466697e278a34e6b8f167e5d9d78b102da3a4b68f8c4","target":"graph","created_at":"2026-07-05T01:58:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.10071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This article presents matrix backpropagation algorithms for the QR decomposition of matrices $A_{m, n}$, that are either square (m = n), wide (m < n), or deep (m > n), with rank $k = min(m, n)$. Furthermore, we derive novel matrix backpropagation results for the pivoted (full-rank) QR decomposition and for the LQ decomposition of deep input matrices. Differentiable QR decomposition offers a numerically stable, computationally efficient method to solve least squares problems frequently encountered in machine learning and computer vision. Other use cases such as graph learning and network compre","authors_text":"Denisa A.O. Roberts, Lucas R. Roberts","cross_cats":["cs.LG","cs.MS","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-19T21:03:37Z","title":"QR and LQ Decomposition Matrix Backpropagation Algorithms for Square, Wide, and Deep -- Real or Complex -- Matrices and Their Software Implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10071","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d6ba7706b4402d035b49ac4489e10e4a34d6d29c9103645b2d0083f2a2a8953a","target":"record","created_at":"2026-07-05T01:58:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ba15c0631776925bb8de55eb93de4cf6ab4f26e0c272860edcc079de32a90a4","cross_cats_sorted":["cs.LG","cs.MS","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-09-19T21:03:37Z","title_canon_sha256":"ab3aeaf573df225745ed8207e1c4e44362fae430933e543f6f1b4a7c2b7f6d91"},"schema_version":"1.0","source":{"id":"2009.10071","kind":"arxiv","version":4}},"canonical_sha256":"5576e191fb91a52f80127887dbc7cb9a4b226a80174d9e0c22c9a75de6bdb7db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5576e191fb91a52f80127887dbc7cb9a4b226a80174d9e0c22c9a75de6bdb7db","first_computed_at":"2026-07-05T01:58:42.557859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:58:42.557859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D6L8h28/kSFhu7T8DHFRhAY0/FIjlo4MpG2egHxBpbNFy7+aXqYo5Sq2y6RhSEFtc9DdrpKpFpuhJ3EtI+HxBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:58:42.558281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.10071","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6ba7706b4402d035b49ac4489e10e4a34d6d29c9103645b2d0083f2a2a8953a","sha256:b0697575d12cd1495840466697e278a34e6b8f167e5d9d78b102da3a4b68f8c4"],"state_sha256":"871994d89bf66f29d51c2c93009c846428d7e5d5a959b24558c44c95a7f1dc8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIjPJAvc3+QeFHv+4VyIFSjyqHHCQLZEtL6CAHJyYmUBsckr6ECdl6eP79ipvkxLcOhNRmWHtaBzqjIYs/SIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T14:06:49.059493Z","bundle_sha256":"c00c1a8146e8db2a522dd7ee0131847c934f7d929420b6209f517dd2d68745b7"}}