{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PURNGSHVH2WRDZWUSBNH6MSHHO","short_pith_number":"pith:PURNGSHV","schema_version":"1.0","canonical_sha256":"7d22d348f53ead11e6d4905a7f32473ba696937aa01a54700532e289dae89090","source":{"kind":"arxiv","id":"1602.07729","version":2},"attestation_state":"computed","paper":{"title":"The Cover Time of Deterministic Random Walks for General Transition Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Takeharu Shiraga","submitted_at":"2016-02-24T22:15:58Z","abstract_excerpt":"The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known about the cover time of deterministic random walks emulating general transition probabilities. This paper is concerned with the SRT-router model with multiple tokens, which is a deterministic process coping with general transition probabilities possibly containing irrational numbers. For the model, we give an upper bound of the cover time, which "},"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":"1602.07729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-24T22:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"f5f570dd639676e68eb5372308831e9c0d6466d4b9ab2c0a5d8e135399bb073a","abstract_canon_sha256":"8b2c1249493fac05178954665357b45ac1d99b72bb3a27b2caed835c51a89e9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.521269Z","signature_b64":"LgVi9wp8PMW9LV8OtQNqvxdXVT6XaTMPL3DxBIk/RxhLhIRECbGbR/X3b1071V2dGn77prLBTpWnzzYAUZDEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d22d348f53ead11e6d4905a7f32473ba696937aa01a54700532e289dae89090","last_reissued_at":"2026-05-18T01:14:58.520873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.520873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Cover Time of Deterministic Random Walks for General Transition Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Takeharu Shiraga","submitted_at":"2016-02-24T22:15:58Z","abstract_excerpt":"The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known about the cover time of deterministic random walks emulating general transition probabilities. This paper is concerned with the SRT-router model with multiple tokens, which is a deterministic process coping with general transition probabilities possibly containing irrational numbers. For the model, we give an upper bound of the cover time, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07729","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":""},"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":"1602.07729","created_at":"2026-05-18T01:14:58.520933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07729v2","created_at":"2026-05-18T01:14:58.520933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07729","created_at":"2026-05-18T01:14:58.520933+00:00"},{"alias_kind":"pith_short_12","alias_value":"PURNGSHVH2WR","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PURNGSHVH2WRDZWU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PURNGSHV","created_at":"2026-05-18T12:30:39.010887+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/PURNGSHVH2WRDZWUSBNH6MSHHO","json":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO.json","graph_json":"https://pith.science/api/pith-number/PURNGSHVH2WRDZWUSBNH6MSHHO/graph.json","events_json":"https://pith.science/api/pith-number/PURNGSHVH2WRDZWUSBNH6MSHHO/events.json","paper":"https://pith.science/paper/PURNGSHV"},"agent_actions":{"view_html":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO","download_json":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO.json","view_paper":"https://pith.science/paper/PURNGSHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07729&json=true","fetch_graph":"https://pith.science/api/pith-number/PURNGSHVH2WRDZWUSBNH6MSHHO/graph.json","fetch_events":"https://pith.science/api/pith-number/PURNGSHVH2WRDZWUSBNH6MSHHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO/action/storage_attestation","attest_author":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO/action/author_attestation","sign_citation":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO/action/citation_signature","submit_replication":"https://pith.science/pith/PURNGSHVH2WRDZWUSBNH6MSHHO/action/replication_record"}},"created_at":"2026-05-18T01:14:58.520933+00:00","updated_at":"2026-05-18T01:14:58.520933+00:00"}