{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OCC7LNXF7E3RKHSGI64IGC66J7","short_pith_number":"pith:OCC7LNXF","canonical_record":{"source":{"id":"1403.3466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-14T00:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"75fd45ed2e4b8e8c3ec618acdf4eed92f1f1f906251023ecff60cc2229bc14d3","abstract_canon_sha256":"8858875e9afb6808fd0478d95c24b7249c85dc7b1298623e50d131d5a4125739"},"schema_version":"1.0"},"canonical_sha256":"7085f5b6e5f937151e4647b8830bde4fd94e6b297e5359b9a951457fc3569011","source":{"kind":"arxiv","id":"1403.3466","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3466","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3466v2","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3466","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"OCC7LNXF7E3R","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OCC7LNXF7E3RKHSG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OCC7LNXF","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OCC7LNXF7E3RKHSGI64IGC66J7","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-14T00:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"75fd45ed2e4b8e8c3ec618acdf4eed92f1f1f906251023ecff60cc2229bc14d3","abstract_canon_sha256":"8858875e9afb6808fd0478d95c24b7249c85dc7b1298623e50d131d5a4125739"},"schema_version":"1.0"},"canonical_sha256":"7085f5b6e5f937151e4647b8830bde4fd94e6b297e5359b9a951457fc3569011","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.199409Z","signature_b64":"R3PeaZ4GOzswr+6Som8vUL7ucOmwf1iSoFZCIAAo7UjVvehrdSFujWrwcTmMAnhPX1uQRNXl3vU6XDYHJJsDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7085f5b6e5f937151e4647b8830bde4fd94e6b297e5359b9a951457fc3569011","last_reissued_at":"2026-05-18T01:41:58.198897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.198897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3466","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgBHd7PkSHRvOqm1mymzscXAzpn7HnDYoj35YvuLShqmFfcJPViMuGcrpFZlinoEnaNDCl6uTorxtJA3G1c6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:34:38.913354Z"},"content_sha256":"9a7dde0ed68213cfd5b60fa3b4bc48c73864fe8dbcc8ac494cb6275a2bf3e3fa","schema_version":"1.0","event_id":"sha256:9a7dde0ed68213cfd5b60fa3b4bc48c73864fe8dbcc8ac494cb6275a2bf3e3fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OCC7LNXF7E3RKHSGI64IGC66J7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Sensor Scheduling via Distributed Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chong Li, Nicola Elia","submitted_at":"2014-03-14T00:28:43Z","abstract_excerpt":"In this paper, we propose a stochastic scheduling strategy for estimating the states of N discrete-time linear time invariant (DTLTI) dynamic systems, where only one system can be observed by the sensor at each time instant due to practical resource constraints. The idea of our stochastic strategy is that a system is randomly selected for observation at each time instant according to a pre-assigned probability distribution. We aim to find the optimal pre-assigned probability in order to minimize the maximal estimate error covariance among dynamic systems. We first show that under mild conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3466","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLtNL1wfTlCU2Dl0iwKZ9yDr57kSds9L0GLvLTepzclZT+2y9/eN9B51IGE+8/qAWldRLJuU+6NPBD6wJGpKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:34:38.913712Z"},"content_sha256":"fedaa3ee4c0e85d44e82d4f7114c21c5a58d47cd9eb9814b1c43c076b12a571e","schema_version":"1.0","event_id":"sha256:fedaa3ee4c0e85d44e82d4f7114c21c5a58d47cd9eb9814b1c43c076b12a571e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCC7LNXF7E3RKHSGI64IGC66J7/bundle.json","state_url":"https://pith.science/pith/OCC7LNXF7E3RKHSGI64IGC66J7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCC7LNXF7E3RKHSGI64IGC66J7/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-01T17:34:38Z","links":{"resolver":"https://pith.science/pith/OCC7LNXF7E3RKHSGI64IGC66J7","bundle":"https://pith.science/pith/OCC7LNXF7E3RKHSGI64IGC66J7/bundle.json","state":"https://pith.science/pith/OCC7LNXF7E3RKHSGI64IGC66J7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCC7LNXF7E3RKHSGI64IGC66J7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OCC7LNXF7E3RKHSGI64IGC66J7","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":"8858875e9afb6808fd0478d95c24b7249c85dc7b1298623e50d131d5a4125739","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-14T00:28:43Z","title_canon_sha256":"75fd45ed2e4b8e8c3ec618acdf4eed92f1f1f906251023ecff60cc2229bc14d3"},"schema_version":"1.0","source":{"id":"1403.3466","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3466","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3466v2","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3466","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"OCC7LNXF7E3R","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OCC7LNXF7E3RKHSG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OCC7LNXF","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:fedaa3ee4c0e85d44e82d4f7114c21c5a58d47cd9eb9814b1c43c076b12a571e","target":"graph","created_at":"2026-05-18T01:41:58Z","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 propose a stochastic scheduling strategy for estimating the states of N discrete-time linear time invariant (DTLTI) dynamic systems, where only one system can be observed by the sensor at each time instant due to practical resource constraints. The idea of our stochastic strategy is that a system is randomly selected for observation at each time instant according to a pre-assigned probability distribution. We aim to find the optimal pre-assigned probability in order to minimize the maximal estimate error covariance among dynamic systems. We first show that under mild conditio","authors_text":"Chong Li, Nicola Elia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-14T00:28:43Z","title":"Stochastic Sensor Scheduling via Distributed Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3466","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:9a7dde0ed68213cfd5b60fa3b4bc48c73864fe8dbcc8ac494cb6275a2bf3e3fa","target":"record","created_at":"2026-05-18T01:41:58Z","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":"8858875e9afb6808fd0478d95c24b7249c85dc7b1298623e50d131d5a4125739","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-14T00:28:43Z","title_canon_sha256":"75fd45ed2e4b8e8c3ec618acdf4eed92f1f1f906251023ecff60cc2229bc14d3"},"schema_version":"1.0","source":{"id":"1403.3466","kind":"arxiv","version":2}},"canonical_sha256":"7085f5b6e5f937151e4647b8830bde4fd94e6b297e5359b9a951457fc3569011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7085f5b6e5f937151e4647b8830bde4fd94e6b297e5359b9a951457fc3569011","first_computed_at":"2026-05-18T01:41:58.198897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:58.198897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R3PeaZ4GOzswr+6Som8vUL7ucOmwf1iSoFZCIAAo7UjVvehrdSFujWrwcTmMAnhPX1uQRNXl3vU6XDYHJJsDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:58.199409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3466","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a7dde0ed68213cfd5b60fa3b4bc48c73864fe8dbcc8ac494cb6275a2bf3e3fa","sha256:fedaa3ee4c0e85d44e82d4f7114c21c5a58d47cd9eb9814b1c43c076b12a571e"],"state_sha256":"0fcd1cd069b550f9367247e7af863b630baee79aa14196be31e511b7eb82bfd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8/Bz/0yHBqkW2R9jdHQCvlePDByAneej8kZwvplOrX5VAPmytD/vH7G5HLBKZie+qY9KjZNl2y9DNJXVihFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:34:38.915796Z","bundle_sha256":"b9cd62eb02087c13dfcdb33d6f4ed8629f841e175e987c458d8dc421ff369be2"}}