{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FJMAXR6SCT4L4KNUGTGJR2AT67","short_pith_number":"pith:FJMAXR6S","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"},"canonical_sha256":"2a580bc7d214f8be29b434cc98e813f7ea4215d75eadf9224243ae57be6346c5","source":{"kind":"arxiv","id":"1709.08823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08823","created_at":"2026-05-18T00:19:17Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08823v2","created_at":"2026-05-18T00:19:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08823","created_at":"2026-05-18T00:19:17Z"},{"alias_kind":"pith_short_12","alias_value":"FJMAXR6SCT4L","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJMAXR6SCT4L4KNU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJMAXR6S","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FJMAXR6SCT4L4KNUGTGJR2AT67","target":"record","payload":{"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"},"canonical_sha256":"2a580bc7d214f8be29b434cc98e813f7ea4215d75eadf9224243ae57be6346c5","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"},"source_kind":"arxiv","source_id":"1709.08823","source_version":2,"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:19:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OM7DG3aQX26O+pZvTaUJaLXlVw1crsD555g4cFZg5T3mOAiFAiavPTN+3UBuWX1mhSLxQKOtFthf1X0RNdqPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:22:36.435442Z"},"content_sha256":"603243160b3183af13d949bbfe856d1ed8bde1e13f518e4ecd643bce1f38c90c","schema_version":"1.0","event_id":"sha256:603243160b3183af13d949bbfe856d1ed8bde1e13f518e4ecd643bce1f38c90c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FJMAXR6SCT4L4KNUGTGJR2AT67","target":"graph","payload":{"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"},"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:19:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjrJJY7piP5Kukk9ogz0aonOfTnZ126goG7YbOtwtGQVl1G8aVXKzeJlJbFSVtqfr19q1CAzUiHsgdszAjFlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:22:36.436005Z"},"content_sha256":"5e3b8ac34725e8f879eedd07ffbaceb9336ada7f1d4e5171091db73897a0b019","schema_version":"1.0","event_id":"sha256:5e3b8ac34725e8f879eedd07ffbaceb9336ada7f1d4e5171091db73897a0b019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/bundle.json","state_url":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/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-05-31T20:22:36Z","links":{"resolver":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67","bundle":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/bundle.json","state":"https://pith.science/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJMAXR6SCT4L4KNUGTGJR2AT67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FJMAXR6SCT4L4KNUGTGJR2AT67","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":"2c5d6892d7c7bc783e8611d108964e515c3480e3d3d9dea520405a236c6622b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-26T04:30:19Z","title_canon_sha256":"c46a55d1a42240dac2ad60dd6581e25cf924d4ceeddf67c3755f401dfb275b10"},"schema_version":"1.0","source":{"id":"1709.08823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08823","created_at":"2026-05-18T00:19:17Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08823v2","created_at":"2026-05-18T00:19:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08823","created_at":"2026-05-18T00:19:17Z"},{"alias_kind":"pith_short_12","alias_value":"FJMAXR6SCT4L","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJMAXR6SCT4L4KNU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJMAXR6S","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:5e3b8ac34725e8f879eedd07ffbaceb9336ada7f1d4e5171091db73897a0b019","target":"graph","created_at":"2026-05-18T00:19:17Z","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":"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","authors_text":"Abolfazl Hashemi, Haris Vikalo, Mahsa Ghasemi, Ufuk Topcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-26T04:30:19Z","title":"A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08823","kind":"arxiv","version":2},"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:603243160b3183af13d949bbfe856d1ed8bde1e13f518e4ecd643bce1f38c90c","target":"record","created_at":"2026-05-18T00:19:17Z","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":"2c5d6892d7c7bc783e8611d108964e515c3480e3d3d9dea520405a236c6622b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-26T04:30:19Z","title_canon_sha256":"c46a55d1a42240dac2ad60dd6581e25cf924d4ceeddf67c3755f401dfb275b10"},"schema_version":"1.0","source":{"id":"1709.08823","kind":"arxiv","version":2}},"canonical_sha256":"2a580bc7d214f8be29b434cc98e813f7ea4215d75eadf9224243ae57be6346c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a580bc7d214f8be29b434cc98e813f7ea4215d75eadf9224243ae57be6346c5","first_computed_at":"2026-05-18T00:19:17.034784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:17.034784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/14Dkvacw/8jHMtfucdtF9FyUc3g8yzgZDlZTQTKgpgHYPnIce6j5ZVr0JdVn3BFF90Of+BK6i2/nzB47rKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:17.035499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:603243160b3183af13d949bbfe856d1ed8bde1e13f518e4ecd643bce1f38c90c","sha256:5e3b8ac34725e8f879eedd07ffbaceb9336ada7f1d4e5171091db73897a0b019"],"state_sha256":"7b4299c2eac06f5f4eae622ecdfdd6acd707616153c05ec8d007447a2b0552a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJLtQMqKbmypmplSR+FNvVO54AQtoKiYNqF0wjwgEuoz2n1EoYzerjObWb7ZqO7VuLjpCnGBf051HruhhxjPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:22:36.439985Z","bundle_sha256":"a3effe79d338a67178597562efcb35ed8f07ad38ab4742dc4dd3bcc3e6d1087e"}}