{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DA4PIAKJMLSQ2ULQS3YZ4WC36B","short_pith_number":"pith:DA4PIAKJ","canonical_record":{"source":{"id":"1605.05023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-17T05:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"fa87c080b6a83712dfb7f991c3c3869be1013367970884b851d5a8d205712624","abstract_canon_sha256":"cc940f1fc75adc989e85024eb63ee4c22e1eab1926b4253a7f203a81bb596996"},"schema_version":"1.0"},"canonical_sha256":"1838f4014962e50d517096f19e585bf0649a6c90fc9d8ae30bd3d3e34155888a","source":{"kind":"arxiv","id":"1605.05023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05023","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05023v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05023","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"DA4PIAKJMLSQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DA4PIAKJMLSQ2ULQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DA4PIAKJ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DA4PIAKJMLSQ2ULQS3YZ4WC36B","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-17T05:51:42Z","cross_cats_sorted":[],"title_canon_sha256":"fa87c080b6a83712dfb7f991c3c3869be1013367970884b851d5a8d205712624","abstract_canon_sha256":"cc940f1fc75adc989e85024eb63ee4c22e1eab1926b4253a7f203a81bb596996"},"schema_version":"1.0"},"canonical_sha256":"1838f4014962e50d517096f19e585bf0649a6c90fc9d8ae30bd3d3e34155888a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.687266Z","signature_b64":"EXdjW8y5o0Eq3mLdDXB734R1732xqZIYL82nY6hIyLabi4O8W/zZknP3mr+ZSRw+Yvrk3tPNy+azNZNGZmVtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1838f4014962e50d517096f19e585bf0649a6c90fc9d8ae30bd3d3e34155888a","last_reissued_at":"2026-05-18T01:14:37.686667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.686667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05023","source_version":1,"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-05-18T01:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iTgzrSm2euIJjqccmxag0QjWLIChdwSmmAad1EWAF7YdXOHWymN3YWg5sY1WMykhCNB9+WXj+wFZ7DqpbcNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:12:45.054016Z"},"content_sha256":"58207ccf1c136bf55f80bc00aa3fe1f2fd519650366e70a3b88c16d5c2b76779","schema_version":"1.0","event_id":"sha256:58207ccf1c136bf55f80bc00aa3fe1f2fd519650366e70a3b88c16d5c2b76779"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DA4PIAKJMLSQ2ULQS3YZ4WC36B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comments on \"A Square-Root-Free Matrix Decomposition Method for Energy-Efficient Least Square Computation on Embedded Systems\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Mohammad M. Mansour","submitted_at":"2016-05-17T05:51:42Z","abstract_excerpt":"A square-root-free matrix QR decomposition (QRD) scheme was rederived in [1] based on [2] to simplify computations when solving least-squares (LS) problems on embedded systems. The scheme of [1] aims at eliminating both the square-root and division operations in the QRD normalization and backward substitution steps in the LS computations. It is claimed in [1] that the LS solution only requires finding the directions of the orthogonal basis of the matrix in question, regardless of the normalization of their Euclidean norms. MIMO detection problems have been named as potential applications that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05023","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"},"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-05-18T01:14:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJKIMu7apG8F/DerxpC0hJuLq72VP/K+lXSLgZEwtEQRf12FvpA4WKaXhAIqCO0NuiOzsPikOknnto8lwN/5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:12:45.054380Z"},"content_sha256":"fcb2c92ab3842349aabccd7a4c64a5fce24b435350969b4a01beae11cb02662d","schema_version":"1.0","event_id":"sha256:fcb2c92ab3842349aabccd7a4c64a5fce24b435350969b4a01beae11cb02662d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B/bundle.json","state_url":"https://pith.science/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B/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-06-20T05:12:45Z","links":{"resolver":"https://pith.science/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B","bundle":"https://pith.science/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B/bundle.json","state":"https://pith.science/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DA4PIAKJMLSQ2ULQS3YZ4WC36B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DA4PIAKJMLSQ2ULQS3YZ4WC36B","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":"cc940f1fc75adc989e85024eb63ee4c22e1eab1926b4253a7f203a81bb596996","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-17T05:51:42Z","title_canon_sha256":"fa87c080b6a83712dfb7f991c3c3869be1013367970884b851d5a8d205712624"},"schema_version":"1.0","source":{"id":"1605.05023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05023","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05023v1","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05023","created_at":"2026-05-18T01:14:37Z"},{"alias_kind":"pith_short_12","alias_value":"DA4PIAKJMLSQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"DA4PIAKJMLSQ2ULQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"DA4PIAKJ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:fcb2c92ab3842349aabccd7a4c64a5fce24b435350969b4a01beae11cb02662d","target":"graph","created_at":"2026-05-18T01:14:37Z","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"},"paper":{"abstract_excerpt":"A square-root-free matrix QR decomposition (QRD) scheme was rederived in [1] based on [2] to simplify computations when solving least-squares (LS) problems on embedded systems. The scheme of [1] aims at eliminating both the square-root and division operations in the QRD normalization and backward substitution steps in the LS computations. It is claimed in [1] that the LS solution only requires finding the directions of the orthogonal basis of the matrix in question, regardless of the normalization of their Euclidean norms. MIMO detection problems have been named as potential applications that ","authors_text":"Mohammad M. Mansour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-17T05:51:42Z","title":"Comments on \"A Square-Root-Free Matrix Decomposition Method for Energy-Efficient Least Square Computation on Embedded Systems\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05023","kind":"arxiv","version":1},"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:58207ccf1c136bf55f80bc00aa3fe1f2fd519650366e70a3b88c16d5c2b76779","target":"record","created_at":"2026-05-18T01:14:37Z","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":"cc940f1fc75adc989e85024eb63ee4c22e1eab1926b4253a7f203a81bb596996","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-05-17T05:51:42Z","title_canon_sha256":"fa87c080b6a83712dfb7f991c3c3869be1013367970884b851d5a8d205712624"},"schema_version":"1.0","source":{"id":"1605.05023","kind":"arxiv","version":1}},"canonical_sha256":"1838f4014962e50d517096f19e585bf0649a6c90fc9d8ae30bd3d3e34155888a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1838f4014962e50d517096f19e585bf0649a6c90fc9d8ae30bd3d3e34155888a","first_computed_at":"2026-05-18T01:14:37.686667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:37.686667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EXdjW8y5o0Eq3mLdDXB734R1732xqZIYL82nY6hIyLabi4O8W/zZknP3mr+ZSRw+Yvrk3tPNy+azNZNGZmVtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:37.687266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58207ccf1c136bf55f80bc00aa3fe1f2fd519650366e70a3b88c16d5c2b76779","sha256:fcb2c92ab3842349aabccd7a4c64a5fce24b435350969b4a01beae11cb02662d"],"state_sha256":"f395d050ff500f5bf5aed5dc6dc330a73fd7bdf0ca0b5a811c91b9b958588449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohfJr8vNsi1ADGeAzmCRVl/7iIg1N0qM7Qy8KFXE+em82d83bS/K7me1YvrgrmYQHZg401lEvdrbAZxJx3+WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:12:45.056258Z","bundle_sha256":"596661860ce554ac92e9a6768d16601aabeffc21098b148af3215182086f4cc5"}}