{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5JX2MRB5ZN6DMXG6374KTAB4FG","short_pith_number":"pith:5JX2MRB5","schema_version":"1.0","canonical_sha256":"ea6fa6443dcb7c365cdedff8a9803c29be8a375c719e9ff0f5432683c694b118","source":{"kind":"arxiv","id":"1510.00059","version":1},"attestation_state":"computed","paper":{"title":"On Remote Estimation with Multiple Communication Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Emrah Akyol, Tamer Basar, Xiaobin Gao","submitted_at":"2015-09-30T22:36:00Z","abstract_excerpt":"This paper considers a sequential estimation and sensor scheduling problem in the presence of multiple communication channels. As opposed to the classical remote estimation problem that involves one perfect (noiseless) channel and one extremely noisy channel (which corresponds to not transmitting the observed state), a more realistic additive noise channel with fixed power constraint along with a more costly perfect channel is considered. It is shown, via a counter-example, that the common folklore of applying symmetric threshold policy, which is well known to be optimal (for unimodal state de"},"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":"1510.00059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-30T22:36:00Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"0fefdd8aa2e9e58512ae129af8140b5f596c752d1bd675a2ffc21418d45f6bf8","abstract_canon_sha256":"6306a58959ad949afab2ce7b35ec21a4dd3ce9aa8e7304272d9b53bdddff17ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:20.853048Z","signature_b64":"R/oSC64iMGLKqyF0xKo5nBbJVf1Ci2ZQ12ZawnxlYSUF/Pt5wjbiDeN3qkr2RGzypkG9IksQyyTahq8WVXkkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea6fa6443dcb7c365cdedff8a9803c29be8a375c719e9ff0f5432683c694b118","last_reissued_at":"2026-05-18T01:31:20.852338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:20.852338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Remote Estimation with Multiple Communication Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Emrah Akyol, Tamer Basar, Xiaobin Gao","submitted_at":"2015-09-30T22:36:00Z","abstract_excerpt":"This paper considers a sequential estimation and sensor scheduling problem in the presence of multiple communication channels. As opposed to the classical remote estimation problem that involves one perfect (noiseless) channel and one extremely noisy channel (which corresponds to not transmitting the observed state), a more realistic additive noise channel with fixed power constraint along with a more costly perfect channel is considered. It is shown, via a counter-example, that the common folklore of applying symmetric threshold policy, which is well known to be optimal (for unimodal state de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00059","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":"1510.00059","created_at":"2026-05-18T01:31:20.852469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00059v1","created_at":"2026-05-18T01:31:20.852469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00059","created_at":"2026-05-18T01:31:20.852469+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JX2MRB5ZN6D","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JX2MRB5ZN6DMXG6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JX2MRB5","created_at":"2026-05-18T12:29:05.191682+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/5JX2MRB5ZN6DMXG6374KTAB4FG","json":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG.json","graph_json":"https://pith.science/api/pith-number/5JX2MRB5ZN6DMXG6374KTAB4FG/graph.json","events_json":"https://pith.science/api/pith-number/5JX2MRB5ZN6DMXG6374KTAB4FG/events.json","paper":"https://pith.science/paper/5JX2MRB5"},"agent_actions":{"view_html":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG","download_json":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG.json","view_paper":"https://pith.science/paper/5JX2MRB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00059&json=true","fetch_graph":"https://pith.science/api/pith-number/5JX2MRB5ZN6DMXG6374KTAB4FG/graph.json","fetch_events":"https://pith.science/api/pith-number/5JX2MRB5ZN6DMXG6374KTAB4FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG/action/storage_attestation","attest_author":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG/action/author_attestation","sign_citation":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG/action/citation_signature","submit_replication":"https://pith.science/pith/5JX2MRB5ZN6DMXG6374KTAB4FG/action/replication_record"}},"created_at":"2026-05-18T01:31:20.852469+00:00","updated_at":"2026-05-18T01:31:20.852469+00:00"}