{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OCKMFIGJU4ADKJHLKJBXUQE3JE","short_pith_number":"pith:OCKMFIGJ","schema_version":"1.0","canonical_sha256":"7094c2a0c9a7003524eb52437a409b491e3870888b3ff88b2b9bf6535239ab14","source":{"kind":"arxiv","id":"1811.10058","version":1},"attestation_state":"computed","paper":{"title":"Doeblin Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Fran\\c{c}ois Baccelli, James T. Murphy III, Mir-Omid Haji-Mirsadeghi","submitted_at":"2018-11-25T17:26:59Z","abstract_excerpt":"This paper is centered on the random graph generated by a Doeblin-type coupling of discrete time processes on a countable state space whereby when two paths meet, they merge. This random graph is studied through a novel subgraph, called a bridge graph, generated by paths started in a fixed state at any time. The bridge graph is made into a unimodular network by marking it and selecting a root in a specified fashion. The unimodularity of this network is leveraged to discern global properties of the larger Doeblin graph. Bi-recurrence, i.e., recurrence both forwards and backwards in time, is int"},"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":"1811.10058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-11-25T17:26:59Z","cross_cats_sorted":[],"title_canon_sha256":"f83a4eb21461391a80cd80794a7bf21efcc43eadb805354bdc72256db0b0eed6","abstract_canon_sha256":"5d6be8f519b88675139465445312604b5171d25729d2ea27b10cee5c2ab31fca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:58.789149Z","signature_b64":"WrcowoKTTWQA7Fm4s56RW3DkSbNUxZIbs+K9+VjUOZ+HeIkBgQQs4NXFd9QjxUWApM+2UPAxHZf/Vhz4POFhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7094c2a0c9a7003524eb52437a409b491e3870888b3ff88b2b9bf6535239ab14","last_reissued_at":"2026-05-17T23:59:58.788743Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:58.788743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doeblin Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Fran\\c{c}ois Baccelli, James T. Murphy III, Mir-Omid Haji-Mirsadeghi","submitted_at":"2018-11-25T17:26:59Z","abstract_excerpt":"This paper is centered on the random graph generated by a Doeblin-type coupling of discrete time processes on a countable state space whereby when two paths meet, they merge. This random graph is studied through a novel subgraph, called a bridge graph, generated by paths started in a fixed state at any time. The bridge graph is made into a unimodular network by marking it and selecting a root in a specified fashion. The unimodularity of this network is leveraged to discern global properties of the larger Doeblin graph. Bi-recurrence, i.e., recurrence both forwards and backwards in time, is int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10058","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":"1811.10058","created_at":"2026-05-17T23:59:58.788801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10058v1","created_at":"2026-05-17T23:59:58.788801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10058","created_at":"2026-05-17T23:59:58.788801+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCKMFIGJU4AD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCKMFIGJU4ADKJHL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCKMFIGJ","created_at":"2026-05-18T12:32:43.782077+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/OCKMFIGJU4ADKJHLKJBXUQE3JE","json":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE.json","graph_json":"https://pith.science/api/pith-number/OCKMFIGJU4ADKJHLKJBXUQE3JE/graph.json","events_json":"https://pith.science/api/pith-number/OCKMFIGJU4ADKJHLKJBXUQE3JE/events.json","paper":"https://pith.science/paper/OCKMFIGJ"},"agent_actions":{"view_html":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE","download_json":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE.json","view_paper":"https://pith.science/paper/OCKMFIGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10058&json=true","fetch_graph":"https://pith.science/api/pith-number/OCKMFIGJU4ADKJHLKJBXUQE3JE/graph.json","fetch_events":"https://pith.science/api/pith-number/OCKMFIGJU4ADKJHLKJBXUQE3JE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE/action/storage_attestation","attest_author":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE/action/author_attestation","sign_citation":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE/action/citation_signature","submit_replication":"https://pith.science/pith/OCKMFIGJU4ADKJHLKJBXUQE3JE/action/replication_record"}},"created_at":"2026-05-17T23:59:58.788801+00:00","updated_at":"2026-05-17T23:59:58.788801+00:00"}