{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MVQDLRMSIEMDHB3RPJRER7FESC","short_pith_number":"pith:MVQDLRMS","schema_version":"1.0","canonical_sha256":"656035c59241183387717a6248fca490911a1b9b72b6211c3fa20c85e001a141","source":{"kind":"arxiv","id":"1111.1459","version":1},"attestation_state":"computed","paper":{"title":"On the Classification of Universal Rotor-Routers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu He","submitted_at":"2011-11-06T23:05:17Z","abstract_excerpt":"The combinatorial theory of rotor-routers has connections with problems of statistical mechanics, graph theory, chaos theory, and computer science. A rotor-router network defines a deterministic walk on a digraph G in which a particle walks from a source vertex until it reaches one of several target vertices. Motivated by recent results due to Giacaglia et al., we study rotor-router networks in which all non-target vertices have the same type. A rotor type r is universal if every hitting sequence can be achieved by a homogeneous rotor-router network consisting entirely of rotors of type r. We "},"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":"1111.1459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-06T23:05:17Z","cross_cats_sorted":[],"title_canon_sha256":"91c3fba9129d465d618996a4d3382386728630d6ef2e900b076626c827d94281","abstract_canon_sha256":"231a5871298e614694fed8d2164d6eb3ef18a5dc1d8147850bc6c5c4dbe1cde7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:26.096044Z","signature_b64":"kuvAk1B5qjxk42pWkMHBP5VOxc8GJu1ZkPHT/ZVDUUwyhoCn540olUWNe8mn/SBY2lxKZ2SUrv1N0JXtnwz8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656035c59241183387717a6248fca490911a1b9b72b6211c3fa20c85e001a141","last_reissued_at":"2026-05-18T04:09:26.095505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:26.095505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Classification of Universal Rotor-Routers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu He","submitted_at":"2011-11-06T23:05:17Z","abstract_excerpt":"The combinatorial theory of rotor-routers has connections with problems of statistical mechanics, graph theory, chaos theory, and computer science. A rotor-router network defines a deterministic walk on a digraph G in which a particle walks from a source vertex until it reaches one of several target vertices. Motivated by recent results due to Giacaglia et al., we study rotor-router networks in which all non-target vertices have the same type. A rotor type r is universal if every hitting sequence can be achieved by a homogeneous rotor-router network consisting entirely of rotors of type r. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1459","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":""},"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":"1111.1459","created_at":"2026-05-18T04:09:26.095574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1459v1","created_at":"2026-05-18T04:09:26.095574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1459","created_at":"2026-05-18T04:09:26.095574+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVQDLRMSIEMD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVQDLRMSIEMDHB3R","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVQDLRMS","created_at":"2026-05-18T12:26:37.096874+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/MVQDLRMSIEMDHB3RPJRER7FESC","json":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC.json","graph_json":"https://pith.science/api/pith-number/MVQDLRMSIEMDHB3RPJRER7FESC/graph.json","events_json":"https://pith.science/api/pith-number/MVQDLRMSIEMDHB3RPJRER7FESC/events.json","paper":"https://pith.science/paper/MVQDLRMS"},"agent_actions":{"view_html":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC","download_json":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC.json","view_paper":"https://pith.science/paper/MVQDLRMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1459&json=true","fetch_graph":"https://pith.science/api/pith-number/MVQDLRMSIEMDHB3RPJRER7FESC/graph.json","fetch_events":"https://pith.science/api/pith-number/MVQDLRMSIEMDHB3RPJRER7FESC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/action/storage_attestation","attest_author":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/action/author_attestation","sign_citation":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/action/citation_signature","submit_replication":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/action/replication_record"}},"created_at":"2026-05-18T04:09:26.095574+00:00","updated_at":"2026-05-18T04:09:26.095574+00:00"}