{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GOORLXQ4XGTWTXBUJIHMSNYP5A","short_pith_number":"pith:GOORLXQ4","schema_version":"1.0","canonical_sha256":"339d15de1cb9a769dc344a0ec9370fe83d75306b4fcd13e77116f4d8838b8fa2","source":{"kind":"arxiv","id":"1407.3200","version":3},"attestation_state":"computed","paper":{"title":"Lock-in Problem for Parallel Rotor-router Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Adrian Kosowski (INRIA Paris-Rocquencourt, Arnaud Labourel (LIF), J\\'er\\'emie Chalopin (LIF), LIAFA), Pawel Gawrychowski (MPII), Przemyslaw Uzna\\'nski, Shantanu Das (LIF)","submitted_at":"2014-07-10T06:12:51Z","abstract_excerpt":"The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially placed at nodes of the graph. Each node maintains a cyclic ordering of the outgoing arcs, and during consecutive turns the tokens are propagated along arcs chosen according to this ordering in round-robin fashion. The behavior of the model is fully deterministic. Yanovski et al.(2003) proved that a single rotor-router walk on any graph with m edges and diameter $D$ stabilizes to a traversal of an Eulerian circuit on th"},"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":"1407.3200","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-10T06:12:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6c488c8db2057409e53858da8c90b8729e62e0324ab290ffe61b045521bcf230","abstract_canon_sha256":"87aa6bfde3769da29a66b9dfe8ce009db6c198fe77314bb345d630fb2ddadd09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:58.988834Z","signature_b64":"BjG/3czCBCoRZaKvSgElopCpaFze+V2V7NxtRu8hthurcQtWC1+V0oxgpz1lDW9kpF5GAwz3ubVv2LYaWMqTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"339d15de1cb9a769dc344a0ec9370fe83d75306b4fcd13e77116f4d8838b8fa2","last_reissued_at":"2026-05-18T02:00:58.988018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:58.988018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lock-in Problem for Parallel Rotor-router Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Adrian Kosowski (INRIA Paris-Rocquencourt, Arnaud Labourel (LIF), J\\'er\\'emie Chalopin (LIF), LIAFA), Pawel Gawrychowski (MPII), Przemyslaw Uzna\\'nski, Shantanu Das (LIF)","submitted_at":"2014-07-10T06:12:51Z","abstract_excerpt":"The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially placed at nodes of the graph. Each node maintains a cyclic ordering of the outgoing arcs, and during consecutive turns the tokens are propagated along arcs chosen according to this ordering in round-robin fashion. The behavior of the model is fully deterministic. Yanovski et al.(2003) proved that a single rotor-router walk on any graph with m edges and diameter $D$ stabilizes to a traversal of an Eulerian circuit on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3200","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":"1407.3200","created_at":"2026-05-18T02:00:58.988153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3200v3","created_at":"2026-05-18T02:00:58.988153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3200","created_at":"2026-05-18T02:00:58.988153+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOORLXQ4XGTW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOORLXQ4XGTWTXBU","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOORLXQ4","created_at":"2026-05-18T12:28:30.664211+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/GOORLXQ4XGTWTXBUJIHMSNYP5A","json":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A.json","graph_json":"https://pith.science/api/pith-number/GOORLXQ4XGTWTXBUJIHMSNYP5A/graph.json","events_json":"https://pith.science/api/pith-number/GOORLXQ4XGTWTXBUJIHMSNYP5A/events.json","paper":"https://pith.science/paper/GOORLXQ4"},"agent_actions":{"view_html":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A","download_json":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A.json","view_paper":"https://pith.science/paper/GOORLXQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3200&json=true","fetch_graph":"https://pith.science/api/pith-number/GOORLXQ4XGTWTXBUJIHMSNYP5A/graph.json","fetch_events":"https://pith.science/api/pith-number/GOORLXQ4XGTWTXBUJIHMSNYP5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A/action/storage_attestation","attest_author":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A/action/author_attestation","sign_citation":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A/action/citation_signature","submit_replication":"https://pith.science/pith/GOORLXQ4XGTWTXBUJIHMSNYP5A/action/replication_record"}},"created_at":"2026-05-18T02:00:58.988153+00:00","updated_at":"2026-05-18T02:00:58.988153+00:00"}