{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RREAORIAN3DJPRIJZCIABQGQAX","short_pith_number":"pith:RREAORIA","schema_version":"1.0","canonical_sha256":"8c480745006ec697c509c89000c0d005ddc7520fdf9c08e5e50b4cb1e38efe4f","source":{"kind":"arxiv","id":"1610.05471","version":1},"attestation_state":"computed","paper":{"title":"Optimal Communication Scheduling and Remote Estimation over an Additive Noise Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Emrah Akyol, Tamer Basar, Xiaobin Gao","submitted_at":"2016-10-18T08:08:59Z","abstract_excerpt":"This paper considers a sequential sensor scheduling and remote estimation problem with one sensor and one estimator. The sensor makes sequential observations about the state of an underlying memoryless stochastic process and makes a decision as to whether or not to send this measurement to the estimator. The sensor and the estimator have the common objective of minimizing expected distortion in the estimation of the state of the process, over a finite time horizon. The sensor is either charged a cost for each transmission or constrained on transmission times. As opposed to the prior work where"},"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":"1610.05471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-18T08:08:59Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"f25edd95cb8aa2dca1d12de99bcfd1aee915d5daa8e950cf73d1993c36d05c3c","abstract_canon_sha256":"8d0ee31b6bc1beb8c43fa32dae77c54b9a63f8f268a6faf63c4b0086fc16046c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:59.222457Z","signature_b64":"L6iEKfAWsrb7aH67x5IRmLVc168nOtWue2QlqJxzLt0JGe4QJEx9YoMFmlENgqS6yoPeR4pn4rHYkXc4OBoUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c480745006ec697c509c89000c0d005ddc7520fdf9c08e5e50b4cb1e38efe4f","last_reissued_at":"2026-05-18T01:01:59.221842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:59.221842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Communication Scheduling and Remote Estimation over an Additive Noise Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Emrah Akyol, Tamer Basar, Xiaobin Gao","submitted_at":"2016-10-18T08:08:59Z","abstract_excerpt":"This paper considers a sequential sensor scheduling and remote estimation problem with one sensor and one estimator. The sensor makes sequential observations about the state of an underlying memoryless stochastic process and makes a decision as to whether or not to send this measurement to the estimator. The sensor and the estimator have the common objective of minimizing expected distortion in the estimation of the state of the process, over a finite time horizon. The sensor is either charged a cost for each transmission or constrained on transmission times. As opposed to the prior work where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05471","kind":"arxiv","version":1},"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":"1610.05471","created_at":"2026-05-18T01:01:59.221936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05471v1","created_at":"2026-05-18T01:01:59.221936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05471","created_at":"2026-05-18T01:01:59.221936+00:00"},{"alias_kind":"pith_short_12","alias_value":"RREAORIAN3DJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RREAORIAN3DJPRIJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RREAORIA","created_at":"2026-05-18T12:30:41.710351+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/RREAORIAN3DJPRIJZCIABQGQAX","json":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX.json","graph_json":"https://pith.science/api/pith-number/RREAORIAN3DJPRIJZCIABQGQAX/graph.json","events_json":"https://pith.science/api/pith-number/RREAORIAN3DJPRIJZCIABQGQAX/events.json","paper":"https://pith.science/paper/RREAORIA"},"agent_actions":{"view_html":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX","download_json":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX.json","view_paper":"https://pith.science/paper/RREAORIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05471&json=true","fetch_graph":"https://pith.science/api/pith-number/RREAORIAN3DJPRIJZCIABQGQAX/graph.json","fetch_events":"https://pith.science/api/pith-number/RREAORIAN3DJPRIJZCIABQGQAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX/action/storage_attestation","attest_author":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX/action/author_attestation","sign_citation":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX/action/citation_signature","submit_replication":"https://pith.science/pith/RREAORIAN3DJPRIJZCIABQGQAX/action/replication_record"}},"created_at":"2026-05-18T01:01:59.221936+00:00","updated_at":"2026-05-18T01:01:59.221936+00:00"}