{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JQIKYFX2URB2UKDGNWMP3M4ZKW","short_pith_number":"pith:JQIKYFX2","schema_version":"1.0","canonical_sha256":"4c10ac16faa443aa28666d98fdb3995593d0d8024416236300cfc77877591f58","source":{"kind":"arxiv","id":"1804.01799","version":1},"attestation_state":"computed","paper":{"title":"Structural cost-optimal design of sensor networks for distributed estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Hamid R. Rabiee, Mohammadreza Doostmohammadian, Usman A. Khan","submitted_at":"2018-04-05T12:14:01Z","abstract_excerpt":"In this letter we discuss cost optimization of sensor networks monitoring structurally full-rank systems under distributed observability constraint. Using structured systems theory, the problem is relaxed into two subproblems: (i) sensing cost optimization and (ii) networking cost optimization. Both problems are reformulated as combinatorial optimization problems. The sensing cost optimization is shown to have a polynomial order solution. The networking cost optimization is shown to be NP-hard in general, but has a polynomial order solution under specific conditions. A 2-approximation polynomi"},"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":"1804.01799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-05T12:14:01Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"add1725bcd1b4356664713e0352d432a607e036e36290c6ecf371d9251d0e191","abstract_canon_sha256":"40093fe091e0302b9b7a101ef1aa6317fefc8587e64adde2e449caaf0c04748e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:14.836957Z","signature_b64":"RD81ueFhUU3DL7YtAE37wZQNV20q9PBdZWeOfq0zPJIj3XSkMHAeCWvhpOADSYjFu/qaC6gKp4ovKbQG6H+NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c10ac16faa443aa28666d98fdb3995593d0d8024416236300cfc77877591f58","last_reissued_at":"2026-05-18T00:15:14.836366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:14.836366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural cost-optimal design of sensor networks for distributed estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Hamid R. Rabiee, Mohammadreza Doostmohammadian, Usman A. Khan","submitted_at":"2018-04-05T12:14:01Z","abstract_excerpt":"In this letter we discuss cost optimization of sensor networks monitoring structurally full-rank systems under distributed observability constraint. Using structured systems theory, the problem is relaxed into two subproblems: (i) sensing cost optimization and (ii) networking cost optimization. Both problems are reformulated as combinatorial optimization problems. The sensing cost optimization is shown to have a polynomial order solution. The networking cost optimization is shown to be NP-hard in general, but has a polynomial order solution under specific conditions. A 2-approximation polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01799","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":"1804.01799","created_at":"2026-05-18T00:15:14.836478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01799v1","created_at":"2026-05-18T00:15:14.836478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01799","created_at":"2026-05-18T00:15:14.836478+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQIKYFX2URB2","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQIKYFX2URB2UKDG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQIKYFX2","created_at":"2026-05-18T12:32:31.084164+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/JQIKYFX2URB2UKDGNWMP3M4ZKW","json":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW.json","graph_json":"https://pith.science/api/pith-number/JQIKYFX2URB2UKDGNWMP3M4ZKW/graph.json","events_json":"https://pith.science/api/pith-number/JQIKYFX2URB2UKDGNWMP3M4ZKW/events.json","paper":"https://pith.science/paper/JQIKYFX2"},"agent_actions":{"view_html":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW","download_json":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW.json","view_paper":"https://pith.science/paper/JQIKYFX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01799&json=true","fetch_graph":"https://pith.science/api/pith-number/JQIKYFX2URB2UKDGNWMP3M4ZKW/graph.json","fetch_events":"https://pith.science/api/pith-number/JQIKYFX2URB2UKDGNWMP3M4ZKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/action/storage_attestation","attest_author":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/action/author_attestation","sign_citation":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/action/citation_signature","submit_replication":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/action/replication_record"}},"created_at":"2026-05-18T00:15:14.836478+00:00","updated_at":"2026-05-18T00:15:14.836478+00:00"}