{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MQ4LXYMK636GBPD44PTWJNFTDR","short_pith_number":"pith:MQ4LXYMK","schema_version":"1.0","canonical_sha256":"6438bbe18af6fc60bc7ce3e764b4b31c4b26fc171ddddb00f3fcefd2cec96fe0","source":{"kind":"arxiv","id":"2308.09214","version":2},"attestation_state":"computed","paper":{"title":"Path convergence of Markov chains on large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.PR","authors_text":"Raghavendra Tripathi, Raghav Somani, Siva Athreya, Soumik Pal","submitted_at":"2023-08-18T00:13:59Z","abstract_excerpt":"We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graphs and a modified version of the Metropolis MCMC algorithm on stochastic block models over unweighted graphs. In both cases we show that, as the size of the graph goes to infinity, the random trajectories of the stochastic processes converge to deterministic curves on the space of measure-valued graphons. Measure-valued graphons, introduced by Lov\\'{a}sz and Szegedy in \\cite{lovasz2010decorated}, are a refinement of t"},"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":"2308.09214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-08-18T00:13:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4bbdf2ef80f9b5d977149d4510a7c076bfeb48868aecdc7ae88a0cf776a4bfae","abstract_canon_sha256":"e6aabfe2413ac9d8fdc35b77cfbbd9bd773d234391c036d61b1fee91349a6d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:04.584509Z","signature_b64":"v06MSUr2EfwyRr7aUVPqwtd9+EdEXdDP40sbLLRqBSjM0SYbKtTEY1XageweXkDqxIGd7kk0D8AJgmkSS6AgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6438bbe18af6fc60bc7ce3e764b4b31c4b26fc171ddddb00f3fcefd2cec96fe0","last_reissued_at":"2026-07-05T07:01:04.584013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:04.584013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path convergence of Markov chains on large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.PR","authors_text":"Raghavendra Tripathi, Raghav Somani, Siva Athreya, Soumik Pal","submitted_at":"2023-08-18T00:13:59Z","abstract_excerpt":"We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graphs and a modified version of the Metropolis MCMC algorithm on stochastic block models over unweighted graphs. In both cases we show that, as the size of the graph goes to infinity, the random trajectories of the stochastic processes converge to deterministic curves on the space of measure-valued graphons. Measure-valued graphons, introduced by Lov\\'{a}sz and Szegedy in \\cite{lovasz2010decorated}, are a refinement of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09214","kind":"arxiv","version":2},"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/2308.09214/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":"2308.09214","created_at":"2026-07-05T07:01:04.584072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.09214v2","created_at":"2026-07-05T07:01:04.584072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09214","created_at":"2026-07-05T07:01:04.584072+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQ4LXYMK636G","created_at":"2026-07-05T07:01:04.584072+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQ4LXYMK636GBPD4","created_at":"2026-07-05T07:01:04.584072+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQ4LXYMK","created_at":"2026-07-05T07:01:04.584072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21556","citing_title":"Mean field limit of non-exchangeable interacting diffusions on co-evolutionary networks","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR","json":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR.json","graph_json":"https://pith.science/api/pith-number/MQ4LXYMK636GBPD44PTWJNFTDR/graph.json","events_json":"https://pith.science/api/pith-number/MQ4LXYMK636GBPD44PTWJNFTDR/events.json","paper":"https://pith.science/paper/MQ4LXYMK"},"agent_actions":{"view_html":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR","download_json":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR.json","view_paper":"https://pith.science/paper/MQ4LXYMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.09214&json=true","fetch_graph":"https://pith.science/api/pith-number/MQ4LXYMK636GBPD44PTWJNFTDR/graph.json","fetch_events":"https://pith.science/api/pith-number/MQ4LXYMK636GBPD44PTWJNFTDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR/action/storage_attestation","attest_author":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR/action/author_attestation","sign_citation":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR/action/citation_signature","submit_replication":"https://pith.science/pith/MQ4LXYMK636GBPD44PTWJNFTDR/action/replication_record"}},"created_at":"2026-07-05T07:01:04.584072+00:00","updated_at":"2026-07-05T07:01:04.584072+00:00"}