{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OUMQUPCTAJBVUNO6JLEXLXW44B","short_pith_number":"pith:OUMQUPCT","schema_version":"1.0","canonical_sha256":"75190a3c5302435a35de4ac975dedce07994f98c5e45799c2e26315299911459","source":{"kind":"arxiv","id":"1702.01779","version":4},"attestation_state":"computed","paper":{"title":"Tracking and Control of Gauss-Markov Processes over Packet-Drop Channels with Acknowledgments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Ashish Khisti, Babak Hassibi, Victoria Kostina","submitted_at":"2017-02-06T20:09:19Z","abstract_excerpt":"We consider the problem of tracking the state of Gauss-Markov processes over rate-limited erasure-prone links. We concentrate first on the scenario in which several independent processes are seen by a single observer. The observer maps the processes into finite-rate packets that are sent over the erasure-prone links to a state estimator, and are acknowledged upon packet arrivals. The aim of the state estimator is to track the processes with zero delay and with minimum mean square error (MMSE). We show that, in the limit of many processes, greedy quantization with respect to the squared error d"},"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":"1702.01779","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T20:09:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c93c1e88165be8f506c778ba88db25549930113857f99490908520a83764309","abstract_canon_sha256":"5480e939249e2e54b20788a13777bbc85fbb67a5bb3bc96bfd51e1b98bdb0094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:10.557485Z","signature_b64":"fcPDrB0jPgz2vcIxBF3ie33RhtyxQJhL2vRz/XT5xniags5KCzMTmi5mWMamOL+W7ZDEScwu5pM1lomJ1COmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75190a3c5302435a35de4ac975dedce07994f98c5e45799c2e26315299911459","last_reissued_at":"2026-05-18T00:15:10.556741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:10.556741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tracking and Control of Gauss-Markov Processes over Packet-Drop Channels with Acknowledgments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Ashish Khisti, Babak Hassibi, Victoria Kostina","submitted_at":"2017-02-06T20:09:19Z","abstract_excerpt":"We consider the problem of tracking the state of Gauss-Markov processes over rate-limited erasure-prone links. We concentrate first on the scenario in which several independent processes are seen by a single observer. The observer maps the processes into finite-rate packets that are sent over the erasure-prone links to a state estimator, and are acknowledged upon packet arrivals. The aim of the state estimator is to track the processes with zero delay and with minimum mean square error (MMSE). We show that, in the limit of many processes, greedy quantization with respect to the squared error d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01779","kind":"arxiv","version":4},"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":"1702.01779","created_at":"2026-05-18T00:15:10.556833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01779v4","created_at":"2026-05-18T00:15:10.556833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01779","created_at":"2026-05-18T00:15:10.556833+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUMQUPCTAJBV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUMQUPCTAJBVUNO6","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUMQUPCT","created_at":"2026-05-18T12:31:34.259226+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/OUMQUPCTAJBVUNO6JLEXLXW44B","json":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B.json","graph_json":"https://pith.science/api/pith-number/OUMQUPCTAJBVUNO6JLEXLXW44B/graph.json","events_json":"https://pith.science/api/pith-number/OUMQUPCTAJBVUNO6JLEXLXW44B/events.json","paper":"https://pith.science/paper/OUMQUPCT"},"agent_actions":{"view_html":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B","download_json":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B.json","view_paper":"https://pith.science/paper/OUMQUPCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01779&json=true","fetch_graph":"https://pith.science/api/pith-number/OUMQUPCTAJBVUNO6JLEXLXW44B/graph.json","fetch_events":"https://pith.science/api/pith-number/OUMQUPCTAJBVUNO6JLEXLXW44B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B/action/storage_attestation","attest_author":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B/action/author_attestation","sign_citation":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B/action/citation_signature","submit_replication":"https://pith.science/pith/OUMQUPCTAJBVUNO6JLEXLXW44B/action/replication_record"}},"created_at":"2026-05-18T00:15:10.556833+00:00","updated_at":"2026-05-18T00:15:10.556833+00:00"}