{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FJMAXR6SCT4L4KNUGTGJR2AT67","short_pith_number":"pith:FJMAXR6S","schema_version":"1.0","canonical_sha256":"2a580bc7d214f8be29b434cc98e813f7ea4215d75eadf9224243ae57be6346c5","source":{"kind":"arxiv","id":"1709.08823","version":2},"attestation_state":"computed","paper":{"title":"A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Abolfazl Hashemi, Haris Vikalo, Mahsa Ghasemi, Ufuk Topcu","submitted_at":"2017-09-26T04:30:19Z","abstract_excerpt":"We study the problem of scheduling sensors in a resource-constrained linear dynamical system, where the objective is to select a small subset of sensors from a large network to perform the state estimation task. We formulate this problem as the maximization of a monotone set function under a matroid constraint. We propose a randomized greedy algorithm that is significantly faster than state-of-the-art methods. By introducing the notion of curvature which quantifies how close a function is to being submodular, we analyze the performance of the proposed algorithm and find a bound on the expected"},"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":"1709.08823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-26T04:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"c46a55d1a42240dac2ad60dd6581e25cf924d4ceeddf67c3755f401dfb275b10","abstract_canon_sha256":"2c5d6892d7c7bc783e8611d108964e515c3480e3d3d9dea520405a236c6622b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:17.035499Z","signature_b64":"G/14Dkvacw/8jHMtfucdtF9FyUc3g8yzgZDlZTQTKgpgHYPnIce6j5ZVr0JdVn3BFF90Of+BK6i2/nzB47rKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a580bc7d214f8be29b434cc98e813f7ea4215d75eadf9224243ae57be6346c5","last_reissued_at":"2026-05-18T00:19:17.034784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:17.034784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Abolfazl Hashemi, Haris Vikalo, Mahsa Ghasemi, Ufuk Topcu","submitted_at":"2017-09-26T04:30:19Z","abstract_excerpt":"We study the problem of scheduling sensors in a resource-constrained linear dynamical system, where the objective is to select a small subset of sensors from a large network to perform the state estimation task. We formulate this problem as the maximization of a monotone set function under a matroid constraint. We propose a randomized greedy algorithm that is significantly faster than state-of-the-art methods. By introducing the notion of curvature which quantifies how close a function is to being submodular, we analyze the performance of the proposed algorithm and find a bound on the expected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08823","kind":"arxiv","version":2},"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":"1709.08823","created_at":"2026-05-18T00:19:17.034919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08823v2","created_at":"2026-05-18T00:19:17.034919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08823","created_at":"2026-05-18T00:19:17.034919+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJMAXR6SCT4L","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJMAXR6SCT4L4KNU","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJMAXR6S","created_at":"2026-05-18T12:31:15.632608+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/FJMAXR6SCT4L4KNUGTGJR2AT67","json":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67.json","graph_json":"https://pith.science/api/pith-number/FJMAXR6SCT4L4KNUGTGJR2AT67/graph.json","events_json":"https://pith.science/api/pith-number/FJMAXR6SCT4L4KNUGTGJR2AT67/events.json","paper":"https://pith.science/paper/FJMAXR6S"},"agent_actions":{"view_html":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67","download_json":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67.json","view_paper":"https://pith.science/paper/FJMAXR6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08823&json=true","fetch_graph":"https://pith.science/api/pith-number/FJMAXR6SCT4L4KNUGTGJR2AT67/graph.json","fetch_events":"https://pith.science/api/pith-number/FJMAXR6SCT4L4KNUGTGJR2AT67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/action/storage_attestation","attest_author":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/action/author_attestation","sign_citation":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/action/citation_signature","submit_replication":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/action/replication_record"}},"created_at":"2026-05-18T00:19:17.034919+00:00","updated_at":"2026-05-18T00:19:17.034919+00:00"}