{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JQIKYFX2URB2UKDGNWMP3M4ZKW","short_pith_number":"pith:JQIKYFX2","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"},"canonical_sha256":"4c10ac16faa443aa28666d98fdb3995593d0d8024416236300cfc77877591f58","source":{"kind":"arxiv","id":"1804.01799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01799","created_at":"2026-05-18T00:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01799v1","created_at":"2026-05-18T00:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01799","created_at":"2026-05-18T00:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"JQIKYFX2URB2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JQIKYFX2URB2UKDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JQIKYFX2","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JQIKYFX2URB2UKDGNWMP3M4ZKW","target":"record","payload":{"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"},"canonical_sha256":"4c10ac16faa443aa28666d98fdb3995593d0d8024416236300cfc77877591f58","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"},"source_kind":"arxiv","source_id":"1804.01799","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWj7NGmEedseQlcFYxmCWDxUolslkK1c8rMcO4bHRIIaHrV0YKihi9598ajlueJQRqHq9s9dAUHY7BvwKYQHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:22:06.240290Z"},"content_sha256":"29ff49b12cc6152389ff849e87d88e89ef5845eef1858596ac46161e97d7186a","schema_version":"1.0","event_id":"sha256:29ff49b12cc6152389ff849e87d88e89ef5845eef1858596ac46161e97d7186a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JQIKYFX2URB2UKDGNWMP3M4ZKW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5andlq+a0ZGCEzkHo6nbOyYac+4Fr+dKd2hgtqjtlDF8GkJj6YvluPoRX9+LrHmd6icKhI2204svErZCfLP+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:22:06.241148Z"},"content_sha256":"5f8f684cbcc8008c24d4d01aebc5788934cb7f49d9518d62a02b5b82a856303e","schema_version":"1.0","event_id":"sha256:5f8f684cbcc8008c24d4d01aebc5788934cb7f49d9518d62a02b5b82a856303e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/bundle.json","state_url":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T16:22:06Z","links":{"resolver":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW","bundle":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/bundle.json","state":"https://pith.science/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQIKYFX2URB2UKDGNWMP3M4ZKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JQIKYFX2URB2UKDGNWMP3M4ZKW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"40093fe091e0302b9b7a101ef1aa6317fefc8587e64adde2e449caaf0c04748e","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-05T12:14:01Z","title_canon_sha256":"add1725bcd1b4356664713e0352d432a607e036e36290c6ecf371d9251d0e191"},"schema_version":"1.0","source":{"id":"1804.01799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01799","created_at":"2026-05-18T00:15:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01799v1","created_at":"2026-05-18T00:15:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01799","created_at":"2026-05-18T00:15:14Z"},{"alias_kind":"pith_short_12","alias_value":"JQIKYFX2URB2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JQIKYFX2URB2UKDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JQIKYFX2","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:5f8f684cbcc8008c24d4d01aebc5788934cb7f49d9518d62a02b5b82a856303e","target":"graph","created_at":"2026-05-18T00:15:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hamid R. Rabiee, Mohammadreza Doostmohammadian, Usman A. Khan","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-05T12:14:01Z","title":"Structural cost-optimal design of sensor networks for distributed estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01799","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:29ff49b12cc6152389ff849e87d88e89ef5845eef1858596ac46161e97d7186a","target":"record","created_at":"2026-05-18T00:15:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"40093fe091e0302b9b7a101ef1aa6317fefc8587e64adde2e449caaf0c04748e","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-04-05T12:14:01Z","title_canon_sha256":"add1725bcd1b4356664713e0352d432a607e036e36290c6ecf371d9251d0e191"},"schema_version":"1.0","source":{"id":"1804.01799","kind":"arxiv","version":1}},"canonical_sha256":"4c10ac16faa443aa28666d98fdb3995593d0d8024416236300cfc77877591f58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c10ac16faa443aa28666d98fdb3995593d0d8024416236300cfc77877591f58","first_computed_at":"2026-05-18T00:15:14.836366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:14.836366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RD81ueFhUU3DL7YtAE37wZQNV20q9PBdZWeOfq0zPJIj3XSkMHAeCWvhpOADSYjFu/qaC6gKp4ovKbQG6H+NDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:14.836957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29ff49b12cc6152389ff849e87d88e89ef5845eef1858596ac46161e97d7186a","sha256:5f8f684cbcc8008c24d4d01aebc5788934cb7f49d9518d62a02b5b82a856303e"],"state_sha256":"c4c43ec47133173d39928606e7b79552d487b28d180c501209ef0535c84dc989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBWsvAk458VIhl+UGUWZRY7bHPnB0NvcScCALlQWdma0WbvVnBMzKnFNxkvC4D/AuiibrHMekyBcXtYwQ9VGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:22:06.245513Z","bundle_sha256":"a3fdc8cd53c4e724c3be6f1756da4437036c1650b33ce55d124e53c883fe3bd6"}}