{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GCMUAJPQHXDJEXLB5D733LG43R","short_pith_number":"pith:GCMUAJPQ","schema_version":"1.0","canonical_sha256":"30994025f03dc6925d61e8ffbdacdcdc66386ed332f32e6639e7616986958cec","source":{"kind":"arxiv","id":"1311.3749","version":3},"attestation_state":"computed","paper":{"title":"Deterministic Random Walks for Rapidly Mixing Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Masafumi Yamashita, Shuji Kijima, Takeharu Shiraga, Yukiko Yamauchi","submitted_at":"2013-11-15T07:22:51Z","abstract_excerpt":"The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational transition probabilities. We investigate the discrepancy of the number of tokens at a single vertex between the functional-router model and its corresponding Markov chain, and give an upper bound in terms of the mixing time of the Markov chain."},"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":"1311.3749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-15T07:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"845da484a3e7230407514d22970204f6e60e7aa6edd30bde5b28f91b6754def0","abstract_canon_sha256":"284a0911cd619d0b9ceaeaf07685fb52dfe853ccc37e5616f78cf009855a7735"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:33.093281Z","signature_b64":"c6zvbPuEHSo9DNzT0SLd+p1O2XNUoBA0j/N6pNl/v+LeHgFelW19iUyvoqJomL9Y8PpuRVGSkP1DrkAba8d1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30994025f03dc6925d61e8ffbdacdcdc66386ed332f32e6639e7616986958cec","last_reissued_at":"2026-05-18T01:35:33.092820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:33.092820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Random Walks for Rapidly Mixing Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Masafumi Yamashita, Shuji Kijima, Takeharu Shiraga, Yukiko Yamauchi","submitted_at":"2013-11-15T07:22:51Z","abstract_excerpt":"The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational transition probabilities. We investigate the discrepancy of the number of tokens at a single vertex between the functional-router model and its corresponding Markov chain, and give an upper bound in terms of the mixing time of the Markov chain."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3749","kind":"arxiv","version":3},"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":"1311.3749","created_at":"2026-05-18T01:35:33.092891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3749v3","created_at":"2026-05-18T01:35:33.092891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3749","created_at":"2026-05-18T01:35:33.092891+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCMUAJPQHXDJ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCMUAJPQHXDJEXLB","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCMUAJPQ","created_at":"2026-05-18T12:27:45.050594+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/GCMUAJPQHXDJEXLB5D733LG43R","json":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R.json","graph_json":"https://pith.science/api/pith-number/GCMUAJPQHXDJEXLB5D733LG43R/graph.json","events_json":"https://pith.science/api/pith-number/GCMUAJPQHXDJEXLB5D733LG43R/events.json","paper":"https://pith.science/paper/GCMUAJPQ"},"agent_actions":{"view_html":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R","download_json":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R.json","view_paper":"https://pith.science/paper/GCMUAJPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3749&json=true","fetch_graph":"https://pith.science/api/pith-number/GCMUAJPQHXDJEXLB5D733LG43R/graph.json","fetch_events":"https://pith.science/api/pith-number/GCMUAJPQHXDJEXLB5D733LG43R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R/action/storage_attestation","attest_author":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R/action/author_attestation","sign_citation":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R/action/citation_signature","submit_replication":"https://pith.science/pith/GCMUAJPQHXDJEXLB5D733LG43R/action/replication_record"}},"created_at":"2026-05-18T01:35:33.092891+00:00","updated_at":"2026-05-18T01:35:33.092891+00:00"}