{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:H5K272Q67KTTR5FLO7SXQZ3RUA","short_pith_number":"pith:H5K272Q6","schema_version":"1.0","canonical_sha256":"3f55afea1efaa738f4ab77e5786771a006ae202288cb7781526e52ae25ac4fdd","source":{"kind":"arxiv","id":"math/0410298","version":1},"attestation_state":"computed","paper":{"title":"Continuous Time Markov Processes on Graphs","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Jianjun Tian, Xiao-Song Lin","submitted_at":"2004-10-12T21:05:40Z","abstract_excerpt":"We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we study ``multi-person simple random walks'' on a graph G with n vertices. There are n persons distributed randomly at the vertices of G. In each step of this discrete time Markov process, we randomly pick up a person and move it to a random adjacent vertex. We give estimate on the expected number of steps for these $n$ persons to meet all together at a specif"},"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/0410298","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2004-10-12T21:05:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"989b231d15f4076ac66a13c5367945ac30dd684d1dec9644e982edb2877db4cd","abstract_canon_sha256":"f9f4fa1baac89ca929d65fcba223605f82975e915c382163143559e9ad2fec60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:39:10.121212Z","signature_b64":"G4ndOF9NVCZslaTBZOYBrB9a0zkvp7jpHQqH1aGp63WzYkX1uvW5a7hVoAL85fbOi7rX+k1baAllSnMUNRYtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f55afea1efaa738f4ab77e5786771a006ae202288cb7781526e52ae25ac4fdd","last_reissued_at":"2026-07-04T14:39:10.120835Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:39:10.120835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Time Markov Processes on Graphs","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Jianjun Tian, Xiao-Song Lin","submitted_at":"2004-10-12T21:05:40Z","abstract_excerpt":"We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we study ``multi-person simple random walks'' on a graph G with n vertices. There are n persons distributed randomly at the vertices of G. In each step of this discrete time Markov process, we randomly pick up a person and move it to a random adjacent vertex. We give estimate on the expected number of steps for these $n$ persons to meet all together at a specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0410298","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/0410298/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/0410298","created_at":"2026-07-04T14:39:10.120894+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0410298v1","created_at":"2026-07-04T14:39:10.120894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0410298","created_at":"2026-07-04T14:39:10.120894+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5K272Q67KTT","created_at":"2026-07-04T14:39:10.120894+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5K272Q67KTTR5FL","created_at":"2026-07-04T14:39:10.120894+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5K272Q6","created_at":"2026-07-04T14:39:10.120894+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/H5K272Q67KTTR5FLO7SXQZ3RUA","json":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA.json","graph_json":"https://pith.science/api/pith-number/H5K272Q67KTTR5FLO7SXQZ3RUA/graph.json","events_json":"https://pith.science/api/pith-number/H5K272Q67KTTR5FLO7SXQZ3RUA/events.json","paper":"https://pith.science/paper/H5K272Q6"},"agent_actions":{"view_html":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA","download_json":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA.json","view_paper":"https://pith.science/paper/H5K272Q6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0410298&json=true","fetch_graph":"https://pith.science/api/pith-number/H5K272Q67KTTR5FLO7SXQZ3RUA/graph.json","fetch_events":"https://pith.science/api/pith-number/H5K272Q67KTTR5FLO7SXQZ3RUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA/action/storage_attestation","attest_author":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA/action/author_attestation","sign_citation":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA/action/citation_signature","submit_replication":"https://pith.science/pith/H5K272Q67KTTR5FLO7SXQZ3RUA/action/replication_record"}},"created_at":"2026-07-04T14:39:10.120894+00:00","updated_at":"2026-07-04T14:39:10.120894+00:00"}