{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HOS3HVHXERKSM6MPENTQNJVQ6W","short_pith_number":"pith:HOS3HVHX","schema_version":"1.0","canonical_sha256":"3ba5b3d4f7245526798f236706a6b0f5a0d6a55291f288301f3157e7167feb65","source":{"kind":"arxiv","id":"1809.07312","version":2},"attestation_state":"computed","paper":{"title":"An Information Matrix Approach for State Secrecy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Anastasios Tsiamis, George Pappas, Konstantinos Gatsis","submitted_at":"2018-09-19T17:42:04Z","abstract_excerpt":"This paper studies the problem of remote state estimation in the presence of a passive eavesdropper. A sensor measures a linear plant's state and transmits it to an authorized user over a packet-dropping channel, which is susceptible to eavesdropping. Our goal is to design a coding scheme such that the eavesdropper cannot infer the plant's current state, while the user successfully decodes the sent messages. We employ a novel class of codes, termed State-Secrecy Codes, which are fast and efficient for dynamical systems. They apply linear time-varying transformations to the current and past sta"},"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":"1809.07312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-09-19T17:42:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bef771b54e4edd83b3af80e5955ba12bf6fd319c5580ad69f7dc928e4e78fd77","abstract_canon_sha256":"331c660f36579d2291db186c2c05c84f85d595c21782f6053863fbbcb2b17e0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:18.787224Z","signature_b64":"cKkkaPBwSM41agiRBRGt88YhZr5Y1Wn/70N8diN+JiaqYR5pK9jMfmSPICZcrXUUdMj9vSLG+uKVV+RvnZ+UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba5b3d4f7245526798f236706a6b0f5a0d6a55291f288301f3157e7167feb65","last_reissued_at":"2026-05-18T00:05:18.786547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:18.786547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Information Matrix Approach for State Secrecy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Anastasios Tsiamis, George Pappas, Konstantinos Gatsis","submitted_at":"2018-09-19T17:42:04Z","abstract_excerpt":"This paper studies the problem of remote state estimation in the presence of a passive eavesdropper. A sensor measures a linear plant's state and transmits it to an authorized user over a packet-dropping channel, which is susceptible to eavesdropping. Our goal is to design a coding scheme such that the eavesdropper cannot infer the plant's current state, while the user successfully decodes the sent messages. We employ a novel class of codes, termed State-Secrecy Codes, which are fast and efficient for dynamical systems. They apply linear time-varying transformations to the current and past sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07312","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.07312","created_at":"2026-05-18T00:05:18.786643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07312v2","created_at":"2026-05-18T00:05:18.786643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07312","created_at":"2026-05-18T00:05:18.786643+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOS3HVHXERKS","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOS3HVHXERKSM6MP","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOS3HVHX","created_at":"2026-05-18T12:32:28.185984+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/HOS3HVHXERKSM6MPENTQNJVQ6W","json":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W.json","graph_json":"https://pith.science/api/pith-number/HOS3HVHXERKSM6MPENTQNJVQ6W/graph.json","events_json":"https://pith.science/api/pith-number/HOS3HVHXERKSM6MPENTQNJVQ6W/events.json","paper":"https://pith.science/paper/HOS3HVHX"},"agent_actions":{"view_html":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W","download_json":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W.json","view_paper":"https://pith.science/paper/HOS3HVHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07312&json=true","fetch_graph":"https://pith.science/api/pith-number/HOS3HVHXERKSM6MPENTQNJVQ6W/graph.json","fetch_events":"https://pith.science/api/pith-number/HOS3HVHXERKSM6MPENTQNJVQ6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W/action/storage_attestation","attest_author":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W/action/author_attestation","sign_citation":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W/action/citation_signature","submit_replication":"https://pith.science/pith/HOS3HVHXERKSM6MPENTQNJVQ6W/action/replication_record"}},"created_at":"2026-05-18T00:05:18.786643+00:00","updated_at":"2026-05-18T00:05:18.786643+00:00"}