{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VPXK375CQN4HQMDQV2352Q7C2G","short_pith_number":"pith:VPXK375C","canonical_record":{"source":{"id":"1405.2852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-12T17:47:36Z","cross_cats_sorted":[],"title_canon_sha256":"45aad7ace6a1eef5d5e1ff5e01f9e1e52708c230312e7b421df862e6dcb399af","abstract_canon_sha256":"ae303d65cedb820c59d3c134bd6e9d2f3ce34bf7dd06b710aedf7d1a79b83c13"},"schema_version":"1.0"},"canonical_sha256":"abeeadffa28378783070aeb7dd43e2d1b4ab511c812f4c82685991fa6df17373","source":{"kind":"arxiv","id":"1405.2852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2852","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2852v1","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2852","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"VPXK375CQN4H","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VPXK375CQN4HQMDQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VPXK375C","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VPXK375CQN4HQMDQV2352Q7C2G","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-12T17:47:36Z","cross_cats_sorted":[],"title_canon_sha256":"45aad7ace6a1eef5d5e1ff5e01f9e1e52708c230312e7b421df862e6dcb399af","abstract_canon_sha256":"ae303d65cedb820c59d3c134bd6e9d2f3ce34bf7dd06b710aedf7d1a79b83c13"},"schema_version":"1.0"},"canonical_sha256":"abeeadffa28378783070aeb7dd43e2d1b4ab511c812f4c82685991fa6df17373","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:49.360984Z","signature_b64":"Qj1PCNbb5XYXOhB+rfBeJ+KXW7ghUJIh8n1/gkkIZAvZF3XJeLxtD5XnQjBSjweJRQDKyEYuMM45mB0KHuwkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abeeadffa28378783070aeb7dd43e2d1b4ab511c812f4c82685991fa6df17373","last_reissued_at":"2026-05-18T02:51:49.360625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:49.360625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2852","source_version":1,"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:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LX1IMxhRzbYBjeG/yYX6zt8xTenZcJUwpPDD5jm6QA2hj9ACjKdjlPncTzw/pS6qz29rwDOHBlDRKW/90vAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:23:21.651196Z"},"content_sha256":"ad6ea71846da27e479ea93e535b3fdbb2f0501fe74d35ff2033d22abd40644b5","schema_version":"1.0","event_id":"sha256:ad6ea71846da27e479ea93e535b3fdbb2f0501fe74d35ff2033d22abd40644b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VPXK375CQN4HQMDQV2352Q7C2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Total Variation Distance of Labelled Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Stefan Kiefer, Taolue Chen","submitted_at":"2014-05-12T17:47:36Z","abstract_excerpt":"Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the total variation distance provides a natural measure for the \"inequivalence\" of two LMCs: it is the maximum difference between probabilities that the LMCs assign to the same event.\n  In this paper we develop a theory of the total variation distance between two LMCs, with emphasis on the algorithmic aspects: (1) we provide a polynomial-time algorithm for deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2852","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"},"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:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EA7btx9cZOp0cwzhHEvVG5T6JLokk7PHgSyVTnddV/SfjIv+hlLukBPtXasYqjP/w5XG+zCnzWqMBWJzTIqkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:23:21.651861Z"},"content_sha256":"bb63ddf6239092c2acd837f3f437559750fa1a6dfa1424d50d18bad2854f5b4b","schema_version":"1.0","event_id":"sha256:bb63ddf6239092c2acd837f3f437559750fa1a6dfa1424d50d18bad2854f5b4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPXK375CQN4HQMDQV2352Q7C2G/bundle.json","state_url":"https://pith.science/pith/VPXK375CQN4HQMDQV2352Q7C2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPXK375CQN4HQMDQV2352Q7C2G/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-25T04:23:21Z","links":{"resolver":"https://pith.science/pith/VPXK375CQN4HQMDQV2352Q7C2G","bundle":"https://pith.science/pith/VPXK375CQN4HQMDQV2352Q7C2G/bundle.json","state":"https://pith.science/pith/VPXK375CQN4HQMDQV2352Q7C2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPXK375CQN4HQMDQV2352Q7C2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VPXK375CQN4HQMDQV2352Q7C2G","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":"ae303d65cedb820c59d3c134bd6e9d2f3ce34bf7dd06b710aedf7d1a79b83c13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-12T17:47:36Z","title_canon_sha256":"45aad7ace6a1eef5d5e1ff5e01f9e1e52708c230312e7b421df862e6dcb399af"},"schema_version":"1.0","source":{"id":"1405.2852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2852","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2852v1","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2852","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"VPXK375CQN4H","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VPXK375CQN4HQMDQ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VPXK375C","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:bb63ddf6239092c2acd837f3f437559750fa1a6dfa1424d50d18bad2854f5b4b","target":"graph","created_at":"2026-05-18T02:51:49Z","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":"Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the total variation distance provides a natural measure for the \"inequivalence\" of two LMCs: it is the maximum difference between probabilities that the LMCs assign to the same event.\n  In this paper we develop a theory of the total variation distance between two LMCs, with emphasis on the algorithmic aspects: (1) we provide a polynomial-time algorithm for deter","authors_text":"Stefan Kiefer, Taolue Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-12T17:47:36Z","title":"On the Total Variation Distance of Labelled Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2852","kind":"arxiv","version":1},"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:ad6ea71846da27e479ea93e535b3fdbb2f0501fe74d35ff2033d22abd40644b5","target":"record","created_at":"2026-05-18T02:51:49Z","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":"ae303d65cedb820c59d3c134bd6e9d2f3ce34bf7dd06b710aedf7d1a79b83c13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-12T17:47:36Z","title_canon_sha256":"45aad7ace6a1eef5d5e1ff5e01f9e1e52708c230312e7b421df862e6dcb399af"},"schema_version":"1.0","source":{"id":"1405.2852","kind":"arxiv","version":1}},"canonical_sha256":"abeeadffa28378783070aeb7dd43e2d1b4ab511c812f4c82685991fa6df17373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abeeadffa28378783070aeb7dd43e2d1b4ab511c812f4c82685991fa6df17373","first_computed_at":"2026-05-18T02:51:49.360625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:49.360625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qj1PCNbb5XYXOhB+rfBeJ+KXW7ghUJIh8n1/gkkIZAvZF3XJeLxtD5XnQjBSjweJRQDKyEYuMM45mB0KHuwkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:49.360984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6ea71846da27e479ea93e535b3fdbb2f0501fe74d35ff2033d22abd40644b5","sha256:bb63ddf6239092c2acd837f3f437559750fa1a6dfa1424d50d18bad2854f5b4b"],"state_sha256":"e7d95c56907973e64def930371d01c410a1d8e1db6619a046207aeece62af5b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5vSgm4x0KUNSL2kn/nD83FklpfYUGMMJGdNR1LVWvg6u2YKqLvfDcPHaMQTCwmwUoreswr+P4NMG05U1vHiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:23:21.655958Z","bundle_sha256":"a8620ce883dc45eb0eaa49816be978b5efa5e7732b3efb35816a0044c5f6c659"}}