{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MVFYDH6UN7UU6S3UT542KMWRWG","short_pith_number":"pith:MVFYDH6U","canonical_record":{"source":{"id":"1605.03502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"11a7d84e4dcb70c62a130d27c9d212d54a9b132f4840a7e7095f41452ecfaac8","abstract_canon_sha256":"8340c9f372c27aadc3ffb86842326c57429102c9d6db1e99e21cf4a645909cb8"},"schema_version":"1.0"},"canonical_sha256":"654b819fd46fe94f4b749f79a532d1b19312a258080fe3c80f426e57e805af29","source":{"kind":"arxiv","id":"1605.03502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03502","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03502v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03502","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"MVFYDH6UN7UU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVFYDH6UN7UU6S3U","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVFYDH6U","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MVFYDH6UN7UU6S3UT542KMWRWG","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"11a7d84e4dcb70c62a130d27c9d212d54a9b132f4840a7e7095f41452ecfaac8","abstract_canon_sha256":"8340c9f372c27aadc3ffb86842326c57429102c9d6db1e99e21cf4a645909cb8"},"schema_version":"1.0"},"canonical_sha256":"654b819fd46fe94f4b749f79a532d1b19312a258080fe3c80f426e57e805af29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:05.257741Z","signature_b64":"ktMVmcRGpJUFWYGuu9ZLcF2FEZapV4+p0q1wAmobdAW3CLVzoq3a1gWRzoUYNRdqvF7xF5TEFyG0NsBugJWdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654b819fd46fe94f4b749f79a532d1b19312a258080fe3c80f426e57e805af29","last_reissued_at":"2026-05-18T01:15:05.257133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:05.257133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03502","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-18T01:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12ti6uVR/zayCbvqb6EpG1vwA/iAlwzTrVKI//yym3SGFrcjkWMDvIv8nF6vNki0qnCzqGtstvPUW0je+rLUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:55:00.615166Z"},"content_sha256":"114584314be90541bbb89acbc1accf5f35738c2c78f3fd31adfba5686234adc4","schema_version":"1.0","event_id":"sha256:114584314be90541bbb89acbc1accf5f35738c2c78f3fd31adfba5686234adc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MVFYDH6UN7UU6S3UT542KMWRWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A solution to the reversible embedding problem for finite Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Chen Jia","submitted_at":"2016-05-11T16:32:10Z","abstract_excerpt":"The embedding problem for Markov chains is a famous problem in probability theory and only partial results are available up till now. In this paper, we propose a variant of the embedding problem called the reversible embedding problem which has a deep physical and biochemical background and provide a complete solution to this new problem. We prove that the reversible embedding of a stochastic matrix, if it exists, must be unique. Moreover, we obtain the sufficient and necessary conditions for the existence of the reversible embedding and provide an effective method to compute the reversible em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03502","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-18T01:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MakRm6/bACusaHNBEomivPKwc5/SYrBRitONGfS8FD6GusTVfVVdb8I6Ef6SZrQI+RwAzBHzNCzhMtiqD9+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:55:00.615541Z"},"content_sha256":"097dddbecab0bd3517d659453f0e8be4c907dd48826d138ae4067fb334b995e1","schema_version":"1.0","event_id":"sha256:097dddbecab0bd3517d659453f0e8be4c907dd48826d138ae4067fb334b995e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVFYDH6UN7UU6S3UT542KMWRWG/bundle.json","state_url":"https://pith.science/pith/MVFYDH6UN7UU6S3UT542KMWRWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVFYDH6UN7UU6S3UT542KMWRWG/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-06-02T09:55:00Z","links":{"resolver":"https://pith.science/pith/MVFYDH6UN7UU6S3UT542KMWRWG","bundle":"https://pith.science/pith/MVFYDH6UN7UU6S3UT542KMWRWG/bundle.json","state":"https://pith.science/pith/MVFYDH6UN7UU6S3UT542KMWRWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVFYDH6UN7UU6S3UT542KMWRWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MVFYDH6UN7UU6S3UT542KMWRWG","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":"8340c9f372c27aadc3ffb86842326c57429102c9d6db1e99e21cf4a645909cb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:32:10Z","title_canon_sha256":"11a7d84e4dcb70c62a130d27c9d212d54a9b132f4840a7e7095f41452ecfaac8"},"schema_version":"1.0","source":{"id":"1605.03502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03502","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03502v1","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03502","created_at":"2026-05-18T01:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"MVFYDH6UN7UU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVFYDH6UN7UU6S3U","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVFYDH6U","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:097dddbecab0bd3517d659453f0e8be4c907dd48826d138ae4067fb334b995e1","target":"graph","created_at":"2026-05-18T01:15:05Z","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":"The embedding problem for Markov chains is a famous problem in probability theory and only partial results are available up till now. In this paper, we propose a variant of the embedding problem called the reversible embedding problem which has a deep physical and biochemical background and provide a complete solution to this new problem. We prove that the reversible embedding of a stochastic matrix, if it exists, must be unique. Moreover, we obtain the sufficient and necessary conditions for the existence of the reversible embedding and provide an effective method to compute the reversible em","authors_text":"Chen Jia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:32:10Z","title":"A solution to the reversible embedding problem for finite Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03502","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:114584314be90541bbb89acbc1accf5f35738c2c78f3fd31adfba5686234adc4","target":"record","created_at":"2026-05-18T01:15:05Z","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":"8340c9f372c27aadc3ffb86842326c57429102c9d6db1e99e21cf4a645909cb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:32:10Z","title_canon_sha256":"11a7d84e4dcb70c62a130d27c9d212d54a9b132f4840a7e7095f41452ecfaac8"},"schema_version":"1.0","source":{"id":"1605.03502","kind":"arxiv","version":1}},"canonical_sha256":"654b819fd46fe94f4b749f79a532d1b19312a258080fe3c80f426e57e805af29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654b819fd46fe94f4b749f79a532d1b19312a258080fe3c80f426e57e805af29","first_computed_at":"2026-05-18T01:15:05.257133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:05.257133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ktMVmcRGpJUFWYGuu9ZLcF2FEZapV4+p0q1wAmobdAW3CLVzoq3a1gWRzoUYNRdqvF7xF5TEFyG0NsBugJWdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:05.257741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:114584314be90541bbb89acbc1accf5f35738c2c78f3fd31adfba5686234adc4","sha256:097dddbecab0bd3517d659453f0e8be4c907dd48826d138ae4067fb334b995e1"],"state_sha256":"653e3e1e9c57ab72ac92c333ffa5ae7ffdf1530a6b4adeb28189a3407721436e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3fGqcGlm1uKy+4B1zp5cfl6UDoVTmKkcyZ3P6oZjA/vfWOUWHV305A+ft+B3Zu1C3HRO+ILCZRG1lT8uhSMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:55:00.617592Z","bundle_sha256":"f8a6c65b0ec6fc04bb47b7ad49284ccedff984467477cead9765503c53c2b934"}}