{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4WQ3MMPU5SJE6FNZ5NAXORE6DU","short_pith_number":"pith:4WQ3MMPU","schema_version":"1.0","canonical_sha256":"e5a1b631f4ec924f15b9eb4177449e1d1e16279c502b7bf7ffba9bc2a5a67863","source":{"kind":"arxiv","id":"2311.09791","version":2},"attestation_state":"computed","paper":{"title":"Low-cost singular value decomposition with optimal sensor placement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Ashton Hetherington, Soledad Le Clainche","submitted_at":"2023-11-16T11:14:54Z","abstract_excerpt":"This paper presents a new method capable of reconstructing datasets with great precision and very low computational cost using a novel variant of the singular value decomposition (SVD) algorithm that has been named low-cost SVD (lcSVD). This algorithm allows to reconstruct a dataset from a minimum amount of points, that can be selected randomly, equidistantly or can be calculated using the optimal sensor placement functionality that is also presented in this paper, which finds minimizing the reconstruction error to validate the calculated sensor positions. This method also allows to find the 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":"2311.09791","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2023-11-16T11:14:54Z","cross_cats_sorted":[],"title_canon_sha256":"e38168a672c106f02544b1408d11c1020815badbaa1224134eb29a265ae54cc1","abstract_canon_sha256":"6426c6bf32762fcb04caacd90b61d5a112d89aa4e6f8f02f894022dec5efbdd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:46.565918Z","signature_b64":"C+AabYQh4jyNcEqjDywGebmf1QyWu1iXnj8ejd/Sga3+O9S6eu8UfxDkTdbFEM+BrrvFGzsLfaxUrsfV84+mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a1b631f4ec924f15b9eb4177449e1d1e16279c502b7bf7ffba9bc2a5a67863","last_reissued_at":"2026-07-05T07:13:46.565466Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:46.565466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-cost singular value decomposition with optimal sensor placement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Ashton Hetherington, Soledad Le Clainche","submitted_at":"2023-11-16T11:14:54Z","abstract_excerpt":"This paper presents a new method capable of reconstructing datasets with great precision and very low computational cost using a novel variant of the singular value decomposition (SVD) algorithm that has been named low-cost SVD (lcSVD). This algorithm allows to reconstruct a dataset from a minimum amount of points, that can be selected randomly, equidistantly or can be calculated using the optimal sensor placement functionality that is also presented in this paper, which finds minimizing the reconstruction error to validate the calculated sensor positions. This method also allows to find the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09791","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.09791/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":"2311.09791","created_at":"2026-07-05T07:13:46.565519+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09791v2","created_at":"2026-07-05T07:13:46.565519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09791","created_at":"2026-07-05T07:13:46.565519+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WQ3MMPU5SJE","created_at":"2026-07-05T07:13:46.565519+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WQ3MMPU5SJE6FNZ","created_at":"2026-07-05T07:13:46.565519+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WQ3MMPU","created_at":"2026-07-05T07:13:46.565519+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00539","citing_title":"Ensemble Kalman Filter for Data Assimilation coupled with low-resolution computations techniques applied in Fluid Dynamics","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU","json":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU.json","graph_json":"https://pith.science/api/pith-number/4WQ3MMPU5SJE6FNZ5NAXORE6DU/graph.json","events_json":"https://pith.science/api/pith-number/4WQ3MMPU5SJE6FNZ5NAXORE6DU/events.json","paper":"https://pith.science/paper/4WQ3MMPU"},"agent_actions":{"view_html":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU","download_json":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU.json","view_paper":"https://pith.science/paper/4WQ3MMPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09791&json=true","fetch_graph":"https://pith.science/api/pith-number/4WQ3MMPU5SJE6FNZ5NAXORE6DU/graph.json","fetch_events":"https://pith.science/api/pith-number/4WQ3MMPU5SJE6FNZ5NAXORE6DU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU/action/storage_attestation","attest_author":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU/action/author_attestation","sign_citation":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU/action/citation_signature","submit_replication":"https://pith.science/pith/4WQ3MMPU5SJE6FNZ5NAXORE6DU/action/replication_record"}},"created_at":"2026-07-05T07:13:46.565519+00:00","updated_at":"2026-07-05T07:13:46.565519+00:00"}