{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CEV6DCOE5M56ANP7F7Q27ITWCH","short_pith_number":"pith:CEV6DCOE","canonical_record":{"source":{"id":"1810.09820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-23T12:42:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7a06a9120ed57df2bc2b2be86ba2cd8d9c43dfb2f4e9ca0557575252675bcb8b","abstract_canon_sha256":"f2a6818014b19a707677b4e74dd64c664ccf4f4b8c0de341e9af9f2534896d20"},"schema_version":"1.0"},"canonical_sha256":"112be189c4eb3be035ff2fe1afa27611e3d25d149a66d134b3e0ecf48176701e","source":{"kind":"arxiv","id":"1810.09820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09820","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09820v2","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09820","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"CEV6DCOE5M56","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"pith_short_16","alias_value":"CEV6DCOE5M56ANP7","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"pith_short_8","alias_value":"CEV6DCOE","created_at":"2026-06-04T20:13:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CEV6DCOE5M56ANP7F7Q27ITWCH","target":"record","payload":{"canonical_record":{"source":{"id":"1810.09820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-23T12:42:55Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7a06a9120ed57df2bc2b2be86ba2cd8d9c43dfb2f4e9ca0557575252675bcb8b","abstract_canon_sha256":"f2a6818014b19a707677b4e74dd64c664ccf4f4b8c0de341e9af9f2534896d20"},"schema_version":"1.0"},"canonical_sha256":"112be189c4eb3be035ff2fe1afa27611e3d25d149a66d134b3e0ecf48176701e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:32.045183Z","signature_b64":"hGAqBe58apPZrLBkTTc31bSB9lq6U2DgmxOiYTVuEPig7pw2cCcu/AryZmA/FhSkHDlOFyrS42CDXc+vaowoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112be189c4eb3be035ff2fe1afa27611e3d25d149a66d134b3e0ecf48176701e","last_reissued_at":"2026-06-04T20:13:32.044694Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:32.044694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.09820","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-06-04T20:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5Hr5MrTwA9YgMboPJQrYlH5qtBoVoNwtB3vZ4pyQ1vq0oKAxrxsYrCwwR3DuZjAAXuh3xUnb43AXHjYW7fcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:23:27.507252Z"},"content_sha256":"1c953a867fe9efbc37855270d6d575897707829f0a13e639136ff4c761c85b20","schema_version":"1.0","event_id":"sha256:1c953a867fe9efbc37855270d6d575897707829f0a13e639136ff4c761c85b20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CEV6DCOE5M56ANP7F7Q27ITWCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Optimal Scheduling Policy for Remote State Estimation under Uncertain Channel Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Karl Henrik Johansson, Ling Shi, Qing-Shan Jia, Shuang Wu, Xiaoqiang Ren","submitted_at":"2018-10-23T12:42:55Z","abstract_excerpt":"We consider optimal sensor scheduling with unknown communication channel statistics. We formulate two types of scheduling problems with the communication rate being a soft or hard constraint, respectively. We first present some structural results on the optimal scheduling policy using dynamic programming and assuming the channel statistics is known. We prove that the Q-factor is monotonic and submodular, which leads to the threshold-like structures in both types of problems. Then we develop a stochastic approximation and parameter learning frameworks to deal with the two scheduling problems wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09820","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.09820/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-04T20:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNasYteZtxsZEFektwMMtErxrZo/rHapCFJKERXnaRIxqhwWE+VkXOG02WvhrobuJA7MfGl1N3YzGBb9Zyn5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:23:27.507873Z"},"content_sha256":"3f67dbf40e7df31b56cb82d9e2d5c0bace53f4ac22ecb48a100f5eba0a17edaa","schema_version":"1.0","event_id":"sha256:3f67dbf40e7df31b56cb82d9e2d5c0bace53f4ac22ecb48a100f5eba0a17edaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEV6DCOE5M56ANP7F7Q27ITWCH/bundle.json","state_url":"https://pith.science/pith/CEV6DCOE5M56ANP7F7Q27ITWCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEV6DCOE5M56ANP7F7Q27ITWCH/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-30T17:23:27Z","links":{"resolver":"https://pith.science/pith/CEV6DCOE5M56ANP7F7Q27ITWCH","bundle":"https://pith.science/pith/CEV6DCOE5M56ANP7F7Q27ITWCH/bundle.json","state":"https://pith.science/pith/CEV6DCOE5M56ANP7F7Q27ITWCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEV6DCOE5M56ANP7F7Q27ITWCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CEV6DCOE5M56ANP7F7Q27ITWCH","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":"f2a6818014b19a707677b4e74dd64c664ccf4f4b8c0de341e9af9f2534896d20","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-23T12:42:55Z","title_canon_sha256":"7a06a9120ed57df2bc2b2be86ba2cd8d9c43dfb2f4e9ca0557575252675bcb8b"},"schema_version":"1.0","source":{"id":"1810.09820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09820","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09820v2","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09820","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"CEV6DCOE5M56","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"pith_short_16","alias_value":"CEV6DCOE5M56ANP7","created_at":"2026-06-04T20:13:32Z"},{"alias_kind":"pith_short_8","alias_value":"CEV6DCOE","created_at":"2026-06-04T20:13:32Z"}],"graph_snapshots":[{"event_id":"sha256:3f67dbf40e7df31b56cb82d9e2d5c0bace53f4ac22ecb48a100f5eba0a17edaa","target":"graph","created_at":"2026-06-04T20:13:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.09820/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider optimal sensor scheduling with unknown communication channel statistics. We formulate two types of scheduling problems with the communication rate being a soft or hard constraint, respectively. We first present some structural results on the optimal scheduling policy using dynamic programming and assuming the channel statistics is known. We prove that the Q-factor is monotonic and submodular, which leads to the threshold-like structures in both types of problems. Then we develop a stochastic approximation and parameter learning frameworks to deal with the two scheduling problems wi","authors_text":"Karl Henrik Johansson, Ling Shi, Qing-Shan Jia, Shuang Wu, Xiaoqiang Ren","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-23T12:42:55Z","title":"Learning Optimal Scheduling Policy for Remote State Estimation under Uncertain Channel Condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09820","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:1c953a867fe9efbc37855270d6d575897707829f0a13e639136ff4c761c85b20","target":"record","created_at":"2026-06-04T20:13:32Z","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":"f2a6818014b19a707677b4e74dd64c664ccf4f4b8c0de341e9af9f2534896d20","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-10-23T12:42:55Z","title_canon_sha256":"7a06a9120ed57df2bc2b2be86ba2cd8d9c43dfb2f4e9ca0557575252675bcb8b"},"schema_version":"1.0","source":{"id":"1810.09820","kind":"arxiv","version":2}},"canonical_sha256":"112be189c4eb3be035ff2fe1afa27611e3d25d149a66d134b3e0ecf48176701e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"112be189c4eb3be035ff2fe1afa27611e3d25d149a66d134b3e0ecf48176701e","first_computed_at":"2026-06-04T20:13:32.044694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:13:32.044694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGAqBe58apPZrLBkTTc31bSB9lq6U2DgmxOiYTVuEPig7pw2cCcu/AryZmA/FhSkHDlOFyrS42CDXc+vaowoAQ==","signature_status":"signed_v1","signed_at":"2026-06-04T20:13:32.045183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c953a867fe9efbc37855270d6d575897707829f0a13e639136ff4c761c85b20","sha256:3f67dbf40e7df31b56cb82d9e2d5c0bace53f4ac22ecb48a100f5eba0a17edaa"],"state_sha256":"84f821647165c2af0e20e06e7baa6113adaf3253263fdf3cd69daeb494d88c80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7DkjNveg2mJD2Lxr0LLqcMz7wEQGH5tgWRsniI5t1poQLLek/IJ4h6Q9H2J4v8KNtgQZLz+liBuJzfkchrlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:23:27.510190Z","bundle_sha256":"0882e578c7865da8e6a85d62f96332bf842ddbc374c52b5335a7528ee3714565"}}