{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PY2QCHKI4LZGFWLRTPT3BD3ARR","short_pith_number":"pith:PY2QCHKI","schema_version":"1.0","canonical_sha256":"7e35011d48e2f262d9719be7b08f608c4bf25c4df0366d782571f16689807ba4","source":{"kind":"arxiv","id":"1806.00528","version":1},"attestation_state":"computed","paper":{"title":"On the Metric-based Approximate Minimization of Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare","submitted_at":"2018-05-30T13:09:33Z","abstract_excerpt":"In this paper, we address the approximate minimization problem of Markov Chains (MCs) from a behavioral metric-based perspective. Specifically, given a finite MC and a positive integer k, we are looking for an MC with at most k states having minimal distance to the original. The metric considered in this work is the bisimilarity distance of Desharnais et al.. For this metric we show that (1) optimal approximations always exist; (2) the problem has a bilinear program characterization; and (3) prove that its threshold problem is in PSPACE and NP-hard. In addition to the bilinear program solution"},"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":"1806.00528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-30T13:09:33Z","cross_cats_sorted":[],"title_canon_sha256":"aab719d0bc36d64c091a12cf31d630bf2150d6459f48f8056a76f4d023394fc3","abstract_canon_sha256":"0ee7a489daedec9b4647f789e670475b6101dfe2370ccb8a9a088d1caf41e584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:03.718708Z","signature_b64":"X2tNi9b3+hja0N3edYBvIhyZ31+4BvWfPSNQEQPNcGPhubbkxTAZAIE8lxVbHVXqlCMmZ+Nb/ohR8NbfWSBcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e35011d48e2f262d9719be7b08f608c4bf25c4df0366d782571f16689807ba4","last_reissued_at":"2026-05-18T00:14:03.717998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:03.717998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Metric-based Approximate Minimization of Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare","submitted_at":"2018-05-30T13:09:33Z","abstract_excerpt":"In this paper, we address the approximate minimization problem of Markov Chains (MCs) from a behavioral metric-based perspective. Specifically, given a finite MC and a positive integer k, we are looking for an MC with at most k states having minimal distance to the original. The metric considered in this work is the bisimilarity distance of Desharnais et al.. For this metric we show that (1) optimal approximations always exist; (2) the problem has a bilinear program characterization; and (3) prove that its threshold problem is in PSPACE and NP-hard. In addition to the bilinear program solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00528","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":"1806.00528","created_at":"2026-05-18T00:14:03.718116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00528v1","created_at":"2026-05-18T00:14:03.718116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00528","created_at":"2026-05-18T00:14:03.718116+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY2QCHKI4LZG","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY2QCHKI4LZGFWLR","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY2QCHKI","created_at":"2026-05-18T12:32:46.962924+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/PY2QCHKI4LZGFWLRTPT3BD3ARR","json":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR.json","graph_json":"https://pith.science/api/pith-number/PY2QCHKI4LZGFWLRTPT3BD3ARR/graph.json","events_json":"https://pith.science/api/pith-number/PY2QCHKI4LZGFWLRTPT3BD3ARR/events.json","paper":"https://pith.science/paper/PY2QCHKI"},"agent_actions":{"view_html":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR","download_json":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR.json","view_paper":"https://pith.science/paper/PY2QCHKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00528&json=true","fetch_graph":"https://pith.science/api/pith-number/PY2QCHKI4LZGFWLRTPT3BD3ARR/graph.json","fetch_events":"https://pith.science/api/pith-number/PY2QCHKI4LZGFWLRTPT3BD3ARR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR/action/storage_attestation","attest_author":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR/action/author_attestation","sign_citation":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR/action/citation_signature","submit_replication":"https://pith.science/pith/PY2QCHKI4LZGFWLRTPT3BD3ARR/action/replication_record"}},"created_at":"2026-05-18T00:14:03.718116+00:00","updated_at":"2026-05-18T00:14:03.718116+00:00"}