{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:D3MLV3ZYMX62V7ACCG2C4CDDZ7","short_pith_number":"pith:D3MLV3ZY","schema_version":"1.0","canonical_sha256":"1ed8baef3865fdaafc0211b42e0863cfca1f1aa1bddbd31ce837ebf79a93923f","source":{"kind":"arxiv","id":"2202.05330","version":1},"attestation_state":"computed","paper":{"title":"Data-driven sensor placement with shallow decoder networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Jan Williams, J. Nathan Kutz, Olivia Zahn","submitted_at":"2022-02-10T21:19:23Z","abstract_excerpt":"Sensor placement is an important and ubiquitous problem across the engineering and physical sciences for tasks such as reconstruction, forecasting and control. Surprisingly, there are few principled mathematical techniques developed to date for optimizing sensor locations, with the leading sensor placement algorithms often based upon the discovery of linear, low-rank sub-spaces and the QR algorithm. QR is a computationally efficient greedy search algorithm which selects sensor locations from candidate positions with maximal variance exhibited in a training data set. More recently, neural netwo"},"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":"2202.05330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2022-02-10T21:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"4e4aa438c778410913a03ca20b8520a51c84dbc82272d48a93085680344d0c47","abstract_canon_sha256":"93b0df191ec81d4d34902627a61275106aa08f171c62dd764a6116b190557293"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:07.104307Z","signature_b64":"IPAmUjx5MP4qRz8xOO0C1Jy2bkkg/+TYDnfI40EP+ErhWY+o8IgZ6oY2l94lqrogLMLgYMqVrh6Y6EEB5lQ2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ed8baef3865fdaafc0211b42e0863cfca1f1aa1bddbd31ce837ebf79a93923f","last_reissued_at":"2026-07-05T03:56:07.103853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:07.103853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-driven sensor placement with shallow decoder networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Jan Williams, J. Nathan Kutz, Olivia Zahn","submitted_at":"2022-02-10T21:19:23Z","abstract_excerpt":"Sensor placement is an important and ubiquitous problem across the engineering and physical sciences for tasks such as reconstruction, forecasting and control. Surprisingly, there are few principled mathematical techniques developed to date for optimizing sensor locations, with the leading sensor placement algorithms often based upon the discovery of linear, low-rank sub-spaces and the QR algorithm. QR is a computationally efficient greedy search algorithm which selects sensor locations from candidate positions with maximal variance exhibited in a training data set. More recently, neural netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05330","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/2202.05330/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":"2202.05330","created_at":"2026-07-05T03:56:07.103914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.05330v1","created_at":"2026-07-05T03:56:07.103914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05330","created_at":"2026-07-05T03:56:07.103914+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3MLV3ZYMX62","created_at":"2026-07-05T03:56:07.103914+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3MLV3ZYMX62V7AC","created_at":"2026-07-05T03:56:07.103914+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3MLV3ZY","created_at":"2026-07-05T03:56:07.103914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.08907","citing_title":"From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7","json":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7.json","graph_json":"https://pith.science/api/pith-number/D3MLV3ZYMX62V7ACCG2C4CDDZ7/graph.json","events_json":"https://pith.science/api/pith-number/D3MLV3ZYMX62V7ACCG2C4CDDZ7/events.json","paper":"https://pith.science/paper/D3MLV3ZY"},"agent_actions":{"view_html":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7","download_json":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7.json","view_paper":"https://pith.science/paper/D3MLV3ZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.05330&json=true","fetch_graph":"https://pith.science/api/pith-number/D3MLV3ZYMX62V7ACCG2C4CDDZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/D3MLV3ZYMX62V7ACCG2C4CDDZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7/action/storage_attestation","attest_author":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7/action/author_attestation","sign_citation":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7/action/citation_signature","submit_replication":"https://pith.science/pith/D3MLV3ZYMX62V7ACCG2C4CDDZ7/action/replication_record"}},"created_at":"2026-07-05T03:56:07.103914+00:00","updated_at":"2026-07-05T03:56:07.103914+00:00"}