{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:IF7373AD5URJXYF7TWE7LXDLHA","short_pith_number":"pith:IF7373AD","schema_version":"1.0","canonical_sha256":"417fbfec03ed229be0bf9d89f5dc6b383b896d180066e4a9df5fd1a63d5cea77","source":{"kind":"arxiv","id":"math/0701390","version":1},"attestation_state":"computed","paper":{"title":"The birthday problem and Markov chain Monte Carlo","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Ben Morris, Itai Benjamini","submitted_at":"2007-01-14T19:14:02Z","abstract_excerpt":"We study the problem of generating a sample from the stationary distribution of a Markov chain, given a method to simulate the chain. We give an approximation algorithm for the case of a random walk on a regular graph with n vertices that runs in expected time O^*(\\sqrt{n} x L^2-mixing time). This is close to the best possible, since \\sqrt{n} is a lower bound on the worst-case expected running time of any algorithm."},"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":"math/0701390","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2007-01-14T19:14:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"546fe5bddb3401db17d4048c8f8bd0954d42db6768817ad4754d7dc9f45f6485","abstract_canon_sha256":"e832f452909ad2589b99a10caf4cf50e2c02d75160f9ecd9a7470b5bd463bbc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:58:44.472299Z","signature_b64":"RvSkwpPqyyvPxY8wNPzN//E6C+ShmKuET683NhQN+RK93zeS0EAKbumW+jYddN5KgZn1c6pMIU6/Yq0NxTLYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"417fbfec03ed229be0bf9d89f5dc6b383b896d180066e4a9df5fd1a63d5cea77","last_reissued_at":"2026-07-04T14:58:44.471951Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:58:44.471951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The birthday problem and Markov chain Monte Carlo","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Ben Morris, Itai Benjamini","submitted_at":"2007-01-14T19:14:02Z","abstract_excerpt":"We study the problem of generating a sample from the stationary distribution of a Markov chain, given a method to simulate the chain. We give an approximation algorithm for the case of a random walk on a regular graph with n vertices that runs in expected time O^*(\\sqrt{n} x L^2-mixing time). This is close to the best possible, since \\sqrt{n} is a lower bound on the worst-case expected running time of any algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701390","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0701390/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0701390","created_at":"2026-07-04T14:58:44.472020+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0701390v1","created_at":"2026-07-04T14:58:44.472020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701390","created_at":"2026-07-04T14:58:44.472020+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF7373AD5URJ","created_at":"2026-07-04T14:58:44.472020+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF7373AD5URJXYF7","created_at":"2026-07-04T14:58:44.472020+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF7373AD","created_at":"2026-07-04T14:58:44.472020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08671","citing_title":"Counting birthday collisions using partitions","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA","json":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA.json","graph_json":"https://pith.science/api/pith-number/IF7373AD5URJXYF7TWE7LXDLHA/graph.json","events_json":"https://pith.science/api/pith-number/IF7373AD5URJXYF7TWE7LXDLHA/events.json","paper":"https://pith.science/paper/IF7373AD"},"agent_actions":{"view_html":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA","download_json":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA.json","view_paper":"https://pith.science/paper/IF7373AD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0701390&json=true","fetch_graph":"https://pith.science/api/pith-number/IF7373AD5URJXYF7TWE7LXDLHA/graph.json","fetch_events":"https://pith.science/api/pith-number/IF7373AD5URJXYF7TWE7LXDLHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA/action/storage_attestation","attest_author":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA/action/author_attestation","sign_citation":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA/action/citation_signature","submit_replication":"https://pith.science/pith/IF7373AD5URJXYF7TWE7LXDLHA/action/replication_record"}},"created_at":"2026-07-04T14:58:44.472020+00:00","updated_at":"2026-07-04T14:58:44.472020+00:00"}