{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OZQDMMUFOQ56YVZDFHCTYB7QIR","short_pith_number":"pith:OZQDMMUF","schema_version":"1.0","canonical_sha256":"7660363285743bec572329c53c07f04451c0ea99285cccf9812260be7877896c","source":{"kind":"arxiv","id":"2605.16584","version":1},"attestation_state":"computed","paper":{"title":"Provably Efficient Sensor Allocation for Unknown High-dimensional Systems with Limited Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Derya Cansever, Na Li, Yuyang Zhang","submitted_at":"2026-05-15T19:41:21Z","abstract_excerpt":"This paper focuses on learning efficient sensor allocations that ensure observability of unknown high-dimensional linear systems using only a small number of sensors. Existing methods either require an impractically large number of sensors or assume access to an observable allocation in advance. We propose a two-stage framework that overcomes these limitations: first, a novel system identification algorithm integrates information from multiple trajectories, each observing different subsets of state coordinates; then, a classic sensor allocation method is adapted to operate on the learned syste"},"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":"2605.16584","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-15T19:41:21Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"8f902dffcd153c01c40b5024e45022be7ba348728e5490701f2d2b6ddf91b24b","abstract_canon_sha256":"805d8d0390cce14fe964756e250659d7564741d3cfa119956e46c09bda4bce92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:31.114679Z","signature_b64":"Ne4isf4Anielvyxv70LUFZ6cKodS9rqvyqK/VJKwhCM/9Pe5g+Eo5XE5+ej6LEbiygFqaD25AZQLJEiYWXw1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7660363285743bec572329c53c07f04451c0ea99285cccf9812260be7877896c","last_reissued_at":"2026-05-20T00:02:31.113830Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:31.113830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably Efficient Sensor Allocation for Unknown High-dimensional Systems with Limited Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Derya Cansever, Na Li, Yuyang Zhang","submitted_at":"2026-05-15T19:41:21Z","abstract_excerpt":"This paper focuses on learning efficient sensor allocations that ensure observability of unknown high-dimensional linear systems using only a small number of sensors. Existing methods either require an impractically large number of sensors or assume access to an observable allocation in advance. We propose a two-stage framework that overcomes these limitations: first, a novel system identification algorithm integrates information from multiple trajectories, each observing different subsets of state coordinates; then, a classic sensor allocation method is adapted to operate on the learned syste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16584","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/2605.16584/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.845864Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.611478Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3a956eb261d0aa1cd4e864426ae66233315e4e0b35019788b8353d29c54f2b6f"},"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":"2605.16584","created_at":"2026-05-20T00:02:31.113961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16584v1","created_at":"2026-05-20T00:02:31.113961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16584","created_at":"2026-05-20T00:02:31.113961+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZQDMMUFOQ56","created_at":"2026-05-20T00:02:31.113961+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZQDMMUFOQ56YVZD","created_at":"2026-05-20T00:02:31.113961+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZQDMMUF","created_at":"2026-05-20T00:02:31.113961+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/OZQDMMUFOQ56YVZDFHCTYB7QIR","json":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR.json","graph_json":"https://pith.science/api/pith-number/OZQDMMUFOQ56YVZDFHCTYB7QIR/graph.json","events_json":"https://pith.science/api/pith-number/OZQDMMUFOQ56YVZDFHCTYB7QIR/events.json","paper":"https://pith.science/paper/OZQDMMUF"},"agent_actions":{"view_html":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR","download_json":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR.json","view_paper":"https://pith.science/paper/OZQDMMUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16584&json=true","fetch_graph":"https://pith.science/api/pith-number/OZQDMMUFOQ56YVZDFHCTYB7QIR/graph.json","fetch_events":"https://pith.science/api/pith-number/OZQDMMUFOQ56YVZDFHCTYB7QIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR/action/storage_attestation","attest_author":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR/action/author_attestation","sign_citation":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR/action/citation_signature","submit_replication":"https://pith.science/pith/OZQDMMUFOQ56YVZDFHCTYB7QIR/action/replication_record"}},"created_at":"2026-05-20T00:02:31.113961+00:00","updated_at":"2026-05-20T00:02:31.113961+00:00"}