{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YF6BHPHET4IVDRVKWP7YLV4OCS","short_pith_number":"pith:YF6BHPHE","schema_version":"1.0","canonical_sha256":"c17c13bce49f1151c6aab3ff85d78e14bfd49618e42d3a8b604b10bc4aa97aa4","source":{"kind":"arxiv","id":"1805.03717","version":1},"attestation_state":"computed","paper":{"title":"Greedy Sensor Placement with Cost Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emily Clark, J. Nathan Kutz, Steven L. Brunton, Travis Askham","submitted_at":"2018-05-09T20:10:43Z","abstract_excerpt":"The problem of optimally placing sensors under a cost constraint arises naturally in the design of industrial and commercial products, as well as in scientific experiments. We consider a relaxation of the full optimization formulation of this problem and then extend a well-established QR-based greedy algorithm for the optimal sensor placement problem without cost constraints. We demonstrate the effectiveness of this algorithm on data sets related to facial recognition, climate science, and fluid mechanics. This algorithm is scalable and often identifies sparse sensors with near optimal reconst"},"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":"1805.03717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-09T20:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"9a6b93e54e0eeb6f8a7d02fedf09b71df3f2043e1a8ea02cd8aad9e247ce8f0f","abstract_canon_sha256":"ee9222b9d991e11092e5c7648d1c7997097325bb5c8fed7f88c8555a79e44388"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:18.937625Z","signature_b64":"EZalGfvq/HWZcc3ijOPm2L2LVbPn1fLe076NPl3uQuERAeuRDIVTMWNp9KrDgVe2tEcmL9kVCPSJrIiONJ85CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17c13bce49f1151c6aab3ff85d78e14bfd49618e42d3a8b604b10bc4aa97aa4","last_reissued_at":"2026-05-18T00:16:18.937011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:18.937011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Sensor Placement with Cost Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Emily Clark, J. Nathan Kutz, Steven L. Brunton, Travis Askham","submitted_at":"2018-05-09T20:10:43Z","abstract_excerpt":"The problem of optimally placing sensors under a cost constraint arises naturally in the design of industrial and commercial products, as well as in scientific experiments. We consider a relaxation of the full optimization formulation of this problem and then extend a well-established QR-based greedy algorithm for the optimal sensor placement problem without cost constraints. We demonstrate the effectiveness of this algorithm on data sets related to facial recognition, climate science, and fluid mechanics. This algorithm is scalable and often identifies sparse sensors with near optimal reconst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03717","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03717","created_at":"2026-05-18T00:16:18.937106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03717v1","created_at":"2026-05-18T00:16:18.937106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03717","created_at":"2026-05-18T00:16:18.937106+00:00"},{"alias_kind":"pith_short_12","alias_value":"YF6BHPHET4IV","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YF6BHPHET4IVDRVK","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YF6BHPHE","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS","json":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS.json","graph_json":"https://pith.science/api/pith-number/YF6BHPHET4IVDRVKWP7YLV4OCS/graph.json","events_json":"https://pith.science/api/pith-number/YF6BHPHET4IVDRVKWP7YLV4OCS/events.json","paper":"https://pith.science/paper/YF6BHPHE"},"agent_actions":{"view_html":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS","download_json":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS.json","view_paper":"https://pith.science/paper/YF6BHPHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03717&json=true","fetch_graph":"https://pith.science/api/pith-number/YF6BHPHET4IVDRVKWP7YLV4OCS/graph.json","fetch_events":"https://pith.science/api/pith-number/YF6BHPHET4IVDRVKWP7YLV4OCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS/action/storage_attestation","attest_author":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS/action/author_attestation","sign_citation":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS/action/citation_signature","submit_replication":"https://pith.science/pith/YF6BHPHET4IVDRVKWP7YLV4OCS/action/replication_record"}},"created_at":"2026-05-18T00:16:18.937106+00:00","updated_at":"2026-05-18T00:16:18.937106+00:00"}