{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:5AYUH5L7EIM5CSNVG6ZCFY537J","short_pith_number":"pith:5AYUH5L7","canonical_record":{"source":{"id":"0907.1113","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-07-06T21:52:35Z","cross_cats_sorted":[],"title_canon_sha256":"270e0931f074ae99aab3b681fafd63eff82b6ddeec8dd36efc27acd7722014a4","abstract_canon_sha256":"1f19712c32c1bef6a3967df7242f114c3aa6251fd61d53004f253a25d3530083"},"schema_version":"1.0"},"canonical_sha256":"e83143f57f2219d149b537b222e3bbfa438acafb53dfd1ca202dd0fe047aaafe","source":{"kind":"arxiv","id":"0907.1113","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.1113","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"0907.1113v5","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.1113","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"5AYUH5L7EIM5","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5AYUH5L7EIM5CSNV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5AYUH5L7","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:5AYUH5L7EIM5CSNVG6ZCFY537J","target":"record","payload":{"canonical_record":{"source":{"id":"0907.1113","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-07-06T21:52:35Z","cross_cats_sorted":[],"title_canon_sha256":"270e0931f074ae99aab3b681fafd63eff82b6ddeec8dd36efc27acd7722014a4","abstract_canon_sha256":"1f19712c32c1bef6a3967df7242f114c3aa6251fd61d53004f253a25d3530083"},"schema_version":"1.0"},"canonical_sha256":"e83143f57f2219d149b537b222e3bbfa438acafb53dfd1ca202dd0fe047aaafe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.427984Z","signature_b64":"I3njuc4z9VgXwjucNYq4W2/TVW3IAAt+JbRJSKGNQ1n2wDRkeQx+UpejVsPB9UkwHK1+JtCwxP73dFteS8fCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83143f57f2219d149b537b222e3bbfa438acafb53dfd1ca202dd0fe047aaafe","last_reissued_at":"2026-05-18T04:39:50.427370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.427370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.1113","source_version":5,"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-18T04:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svL5SnSrX618zx4cab6Ork/WyuL6IJsIk+PSjeqpmGg58YHV2vznl5WkZ2SC5WoGYykgPfz1vxcgdzWWCVT7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:05:44.571944Z"},"content_sha256":"c66e3b9194339b6c8f541a77a8f67d757a0f344b5c2f1c6c83ef1006768a5336","schema_version":"1.0","event_id":"sha256:c66e3b9194339b6c8f541a77a8f67d757a0f344b5c2f1c6c83ef1006768a5336"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:5AYUH5L7EIM5CSNVG6ZCFY537J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfect simulation of a coupling achieving the $\\bar{d}$-distance between ordered pairs of binary chains of infinite order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antonio Galves, Clementine Prieur, Nancy L. Garcia","submitted_at":"2009-07-06T21:52:35Z","abstract_excerpt":"We explicitly construct a coupling attaining Ornstein's $\\bar{d}$-distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of iid sequence of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.1113","kind":"arxiv","version":5},"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-18T04:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/wmiAE/SNNH/i5pcSyez2+UnGA1YKvw81LXoc+0sZIk6wNuNKI2H2cQTK20Y27mVKBLNVucQpLW/k3cUmPPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:05:44.572624Z"},"content_sha256":"4852e58ff661e8cfff3d59af12c8454a94ed41fc85d83e1735cc3bcbafccc8bd","schema_version":"1.0","event_id":"sha256:4852e58ff661e8cfff3d59af12c8454a94ed41fc85d83e1735cc3bcbafccc8bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AYUH5L7EIM5CSNVG6ZCFY537J/bundle.json","state_url":"https://pith.science/pith/5AYUH5L7EIM5CSNVG6ZCFY537J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AYUH5L7EIM5CSNVG6ZCFY537J/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-05T23:05:44Z","links":{"resolver":"https://pith.science/pith/5AYUH5L7EIM5CSNVG6ZCFY537J","bundle":"https://pith.science/pith/5AYUH5L7EIM5CSNVG6ZCFY537J/bundle.json","state":"https://pith.science/pith/5AYUH5L7EIM5CSNVG6ZCFY537J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AYUH5L7EIM5CSNVG6ZCFY537J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:5AYUH5L7EIM5CSNVG6ZCFY537J","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":"1f19712c32c1bef6a3967df7242f114c3aa6251fd61d53004f253a25d3530083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-07-06T21:52:35Z","title_canon_sha256":"270e0931f074ae99aab3b681fafd63eff82b6ddeec8dd36efc27acd7722014a4"},"schema_version":"1.0","source":{"id":"0907.1113","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.1113","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"0907.1113v5","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.1113","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"5AYUH5L7EIM5","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5AYUH5L7EIM5CSNV","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5AYUH5L7","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:4852e58ff661e8cfff3d59af12c8454a94ed41fc85d83e1735cc3bcbafccc8bd","target":"graph","created_at":"2026-05-18T04:39:50Z","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 explicitly construct a coupling attaining Ornstein's $\\bar{d}$-distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of iid sequence of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that","authors_text":"Antonio Galves, Clementine Prieur, Nancy L. Garcia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-07-06T21:52:35Z","title":"Perfect simulation of a coupling achieving the $\\bar{d}$-distance between ordered pairs of binary chains of infinite order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.1113","kind":"arxiv","version":5},"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:c66e3b9194339b6c8f541a77a8f67d757a0f344b5c2f1c6c83ef1006768a5336","target":"record","created_at":"2026-05-18T04:39:50Z","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":"1f19712c32c1bef6a3967df7242f114c3aa6251fd61d53004f253a25d3530083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-07-06T21:52:35Z","title_canon_sha256":"270e0931f074ae99aab3b681fafd63eff82b6ddeec8dd36efc27acd7722014a4"},"schema_version":"1.0","source":{"id":"0907.1113","kind":"arxiv","version":5}},"canonical_sha256":"e83143f57f2219d149b537b222e3bbfa438acafb53dfd1ca202dd0fe047aaafe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e83143f57f2219d149b537b222e3bbfa438acafb53dfd1ca202dd0fe047aaafe","first_computed_at":"2026-05-18T04:39:50.427370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:50.427370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3njuc4z9VgXwjucNYq4W2/TVW3IAAt+JbRJSKGNQ1n2wDRkeQx+UpejVsPB9UkwHK1+JtCwxP73dFteS8fCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:50.427984Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.1113","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c66e3b9194339b6c8f541a77a8f67d757a0f344b5c2f1c6c83ef1006768a5336","sha256:4852e58ff661e8cfff3d59af12c8454a94ed41fc85d83e1735cc3bcbafccc8bd"],"state_sha256":"ff0872702b78045c1f43d0d3f166be06394a8102ac6ef6f616e57d59ff3b9b82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWywSnSfsndawrqJwm9+lo4nrmpNIYY/9Xo0NTNW9cAlDNO5v8AVzqDLXEpExYTt0SuGddBFQImfDzu0Yg6NCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:05:44.576922Z","bundle_sha256":"1e0ef879e24e5f4728627a718042c3db0030d66f62a77c8ec3a98856a0bfa8f4"}}