{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ACHNTFMM7G4JGB3SJSSWUL6AM","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":"47af5359fb9f4b5db007e7ea51cdc2d91cf79d7f1a4de175b57465eb5d9af27e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-16T11:25:32Z","title_canon_sha256":"19c4be1a43c790000e6e82b6a7ebe9e3ee549b7cdc7c7f27cb96ac350e981865"},"schema_version":"1.0","source":{"id":"1702.04927","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04927","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04927v5","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04927","created_at":"2026-05-18T00:23:40Z"},{"alias_kind":"pith_short_12","alias_value":"3ACHNTFMM7G4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ACHNTFMM7G4JGB3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ACHNTFM","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:8014ca104dca708542f7fc28d911d2474f9ab99ea4e0ed2877b62c77bccbd360","target":"graph","created_at":"2026-05-18T00:23:40Z","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 paper we present new algorithms and analysis for the linear inverse sensor placement and scheduling problems over multiple time instances with power and communications constraints. The proposed algorithms, which deal directly with minimizing the mean squared error (MSE), are based on the convex relaxation approach to address the binary optimization scheduling problems that are formulated in sensor network scenarios. We propose to balance the energy and communications demands of operating a network of sensors over time while we still guarantee a minimum level of estimation accuracy. We ","authors_text":"Cristian Rusu, John Thompson, Neil M. Robertson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-16T11:25:32Z","title":"Sensor scheduling with time, energy and communication constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04927","kind":"arxiv","version":5},"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:29eddbf7c777603c2d93db565471f7aaef54843814820b8993f8b709d5f81743","target":"record","created_at":"2026-05-18T00:23:40Z","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":"47af5359fb9f4b5db007e7ea51cdc2d91cf79d7f1a4de175b57465eb5d9af27e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-16T11:25:32Z","title_canon_sha256":"19c4be1a43c790000e6e82b6a7ebe9e3ee549b7cdc7c7f27cb96ac350e981865"},"schema_version":"1.0","source":{"id":"1702.04927","kind":"arxiv","version":5}},"canonical_sha256":"d80476ccac67cdc4983b92652b517e0326bf4e953794cccece95d186ca72441f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d80476ccac67cdc4983b92652b517e0326bf4e953794cccece95d186ca72441f","first_computed_at":"2026-05-18T00:23:40.001739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:40.001739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3PZUFp7mm1V82RSmkcnB/gOZW9FoiaVXoIbMG0uMdC/TAKoDaVHX1HozYhp/Je6/UrXh4r6rjtLWU4uX3kOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:40.002327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04927","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29eddbf7c777603c2d93db565471f7aaef54843814820b8993f8b709d5f81743","sha256:8014ca104dca708542f7fc28d911d2474f9ab99ea4e0ed2877b62c77bccbd360"],"state_sha256":"35cfa1b21e052703aa0d453594f352eda7844368a387061d85c5ef0bf56ce33f"}