{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UXU32P3RWM4EBACNTR6MRATLVW","short_pith_number":"pith:UXU32P3R","canonical_record":{"source":{"id":"1302.6289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-26T01:26:53Z","cross_cats_sorted":[],"title_canon_sha256":"da9fbd298253c740a6d54028ef53153b9ffdb48d0c0bdb42ba1609b2a02d42e4","abstract_canon_sha256":"a145c090ee3cc2ebfc436811db12afa21f97c2dd744993b453a535314c1bd308"},"schema_version":"1.0"},"canonical_sha256":"a5e9bd3f71b33840804d9c7cc8826bad81fe87e0ac0df9011fc91c59da9e9f6a","source":{"kind":"arxiv","id":"1302.6289","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6289","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6289v2","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6289","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"UXU32P3RWM4E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UXU32P3RWM4EBACN","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UXU32P3R","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UXU32P3RWM4EBACNTR6MRATLVW","target":"record","payload":{"canonical_record":{"source":{"id":"1302.6289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-26T01:26:53Z","cross_cats_sorted":[],"title_canon_sha256":"da9fbd298253c740a6d54028ef53153b9ffdb48d0c0bdb42ba1609b2a02d42e4","abstract_canon_sha256":"a145c090ee3cc2ebfc436811db12afa21f97c2dd744993b453a535314c1bd308"},"schema_version":"1.0"},"canonical_sha256":"a5e9bd3f71b33840804d9c7cc8826bad81fe87e0ac0df9011fc91c59da9e9f6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:57.378569Z","signature_b64":"AJ3TMoz+QkT5y19Ih3i9vLf8cl7anGvmMYvPBN9Ezentmdy+dO7F6jyOz3QJwbUOhHjQSfTgcph7xpvGc+e4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5e9bd3f71b33840804d9c7cc8826bad81fe87e0ac0df9011fc91c59da9e9f6a","last_reissued_at":"2026-05-18T02:58:57.377767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:57.377767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.6289","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-05-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXxb0Q1fLC9Hl2xbGjcOMOIiJd1gJFSjrjU+1QKp5rXaHhFCHvij+6U8P/zFziWpznC+qZFTanKJzH7CDaObCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:38:03.684827Z"},"content_sha256":"809c7c6db19eb5423318a507be0137cd324a6bcb26e4cd6e11218c3da72c81db","schema_version":"1.0","event_id":"sha256:809c7c6db19eb5423318a507be0137cd324a6bcb26e4cd6e11218c3da72c81db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UXU32P3RWM4EBACNTR6MRATLVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Input-Output Construction of Finite State $\\rho/\\mu$ Approximations for Control Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Danielle C. Tarraf","submitted_at":"2013-02-26T01:26:53Z","abstract_excerpt":"We consider discrete-time plants that interact with their controllers via fixed discrete alphabets. For this class of systems, and in the absence of exogenous inputs, we propose a general, conceptual procedure for constructing a sequence of finite state approximate models starting from finite length sequences of input and output signal pairs. We explicitly derive conditions under which the proposed construct, used in conjunction with a particular generalized structure, satisfies desirable properties of $\\rho/\\mu$ approximations thereby leading to nominal deterministic finite state machine mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6289","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"},"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-05-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJbx/he+mm4OBuy5Bp3eqvBRu71SUHe+wiJA2yRUCAIylQS/B1Y9FBLVMDQw3skCneHuYpHpyG2t96hQKPlWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:38:03.685444Z"},"content_sha256":"b29ef3f49f48066a3852e5d8da75425b4485567a3418b953adf1bd6fcbc4415e","schema_version":"1.0","event_id":"sha256:b29ef3f49f48066a3852e5d8da75425b4485567a3418b953adf1bd6fcbc4415e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXU32P3RWM4EBACNTR6MRATLVW/bundle.json","state_url":"https://pith.science/pith/UXU32P3RWM4EBACNTR6MRATLVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXU32P3RWM4EBACNTR6MRATLVW/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-05-29T14:38:03Z","links":{"resolver":"https://pith.science/pith/UXU32P3RWM4EBACNTR6MRATLVW","bundle":"https://pith.science/pith/UXU32P3RWM4EBACNTR6MRATLVW/bundle.json","state":"https://pith.science/pith/UXU32P3RWM4EBACNTR6MRATLVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXU32P3RWM4EBACNTR6MRATLVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UXU32P3RWM4EBACNTR6MRATLVW","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":"a145c090ee3cc2ebfc436811db12afa21f97c2dd744993b453a535314c1bd308","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-26T01:26:53Z","title_canon_sha256":"da9fbd298253c740a6d54028ef53153b9ffdb48d0c0bdb42ba1609b2a02d42e4"},"schema_version":"1.0","source":{"id":"1302.6289","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6289","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6289v2","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6289","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"UXU32P3RWM4E","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UXU32P3RWM4EBACN","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UXU32P3R","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:b29ef3f49f48066a3852e5d8da75425b4485567a3418b953adf1bd6fcbc4415e","target":"graph","created_at":"2026-05-18T02:58:57Z","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"},"paper":{"abstract_excerpt":"We consider discrete-time plants that interact with their controllers via fixed discrete alphabets. For this class of systems, and in the absence of exogenous inputs, we propose a general, conceptual procedure for constructing a sequence of finite state approximate models starting from finite length sequences of input and output signal pairs. We explicitly derive conditions under which the proposed construct, used in conjunction with a particular generalized structure, satisfies desirable properties of $\\rho/\\mu$ approximations thereby leading to nominal deterministic finite state machine mode","authors_text":"Danielle C. Tarraf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-26T01:26:53Z","title":"An Input-Output Construction of Finite State $\\rho/\\mu$ Approximations for Control Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6289","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:809c7c6db19eb5423318a507be0137cd324a6bcb26e4cd6e11218c3da72c81db","target":"record","created_at":"2026-05-18T02:58:57Z","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":"a145c090ee3cc2ebfc436811db12afa21f97c2dd744993b453a535314c1bd308","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-26T01:26:53Z","title_canon_sha256":"da9fbd298253c740a6d54028ef53153b9ffdb48d0c0bdb42ba1609b2a02d42e4"},"schema_version":"1.0","source":{"id":"1302.6289","kind":"arxiv","version":2}},"canonical_sha256":"a5e9bd3f71b33840804d9c7cc8826bad81fe87e0ac0df9011fc91c59da9e9f6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5e9bd3f71b33840804d9c7cc8826bad81fe87e0ac0df9011fc91c59da9e9f6a","first_computed_at":"2026-05-18T02:58:57.377767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:57.377767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJ3TMoz+QkT5y19Ih3i9vLf8cl7anGvmMYvPBN9Ezentmdy+dO7F6jyOz3QJwbUOhHjQSfTgcph7xpvGc+e4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:57.378569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6289","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:809c7c6db19eb5423318a507be0137cd324a6bcb26e4cd6e11218c3da72c81db","sha256:b29ef3f49f48066a3852e5d8da75425b4485567a3418b953adf1bd6fcbc4415e"],"state_sha256":"6fcb97f77dd813fe45f57b1c31a502c1a216c169a31e76806baa1112830b38d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWbWV41D6c1nPzGGQjRstfBvouDcp9Cek2e2s3/+CpFQ588aKeGhX4CN+GwhhDrINNYPbhWaAHKCjMreMfALDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:38:03.688992Z","bundle_sha256":"769ca16980af8c975f90966df565cf344fd153c7b3020429337f8a1f545b7748"}}