{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MVQDLRMSIEMDHB3RPJRER7FESC","short_pith_number":"pith:MVQDLRMS","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"},"canonical_sha256":"656035c59241183387717a6248fca490911a1b9b72b6211c3fa20c85e001a141","source":{"kind":"arxiv","id":"1111.1459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1459","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1459v1","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1459","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"MVQDLRMSIEMD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MVQDLRMSIEMDHB3R","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MVQDLRMS","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MVQDLRMSIEMDHB3RPJRER7FESC","target":"record","payload":{"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"},"canonical_sha256":"656035c59241183387717a6248fca490911a1b9b72b6211c3fa20c85e001a141","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"},"source_kind":"arxiv","source_id":"1111.1459","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBulnEBzTbyLL9yVQOGpmDN5S97OyVaoiLy5Et97zguvaTxHZSY8QaW6sqBKVsCTIdB+4rITAIoMaepbce4sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:56.027933Z"},"content_sha256":"07f687174220a37388e7d75618359bd4868f0a8e22b9b0a18b8369933659cea8","schema_version":"1.0","event_id":"sha256:07f687174220a37388e7d75618359bd4868f0a8e22b9b0a18b8369933659cea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MVQDLRMSIEMDHB3RPJRER7FESC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z01NP2jPWCxJcufSqGxKdcpgb0ercESWpvonfz4AmpDi/6Xo0/rM8Xpdry7dQkQfuOdhFYWpTQrLVt6OBDR1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:43:56.028340Z"},"content_sha256":"fc3d677f2beebcf39acd6b604c61d929fbafec5937684ce4a2adfc7e920ed97b","schema_version":"1.0","event_id":"sha256:fc3d677f2beebcf39acd6b604c61d929fbafec5937684ce4a2adfc7e920ed97b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/bundle.json","state_url":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVQDLRMSIEMDHB3RPJRER7FESC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T20:43:56Z","links":{"resolver":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC","bundle":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/bundle.json","state":"https://pith.science/pith/MVQDLRMSIEMDHB3RPJRER7FESC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVQDLRMSIEMDHB3RPJRER7FESC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MVQDLRMSIEMDHB3RPJRER7FESC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"231a5871298e614694fed8d2164d6eb3ef18a5dc1d8147850bc6c5c4dbe1cde7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-06T23:05:17Z","title_canon_sha256":"91c3fba9129d465d618996a4d3382386728630d6ef2e900b076626c827d94281"},"schema_version":"1.0","source":{"id":"1111.1459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1459","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1459v1","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1459","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"MVQDLRMSIEMD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"MVQDLRMSIEMDHB3R","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"MVQDLRMS","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:fc3d677f2beebcf39acd6b604c61d929fbafec5937684ce4a2adfc7e920ed97b","target":"graph","created_at":"2026-05-18T04:09:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-06T23:05:17Z","title":"On the Classification of Universal Rotor-Routers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1459","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07f687174220a37388e7d75618359bd4868f0a8e22b9b0a18b8369933659cea8","target":"record","created_at":"2026-05-18T04:09:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"231a5871298e614694fed8d2164d6eb3ef18a5dc1d8147850bc6c5c4dbe1cde7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-06T23:05:17Z","title_canon_sha256":"91c3fba9129d465d618996a4d3382386728630d6ef2e900b076626c827d94281"},"schema_version":"1.0","source":{"id":"1111.1459","kind":"arxiv","version":1}},"canonical_sha256":"656035c59241183387717a6248fca490911a1b9b72b6211c3fa20c85e001a141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"656035c59241183387717a6248fca490911a1b9b72b6211c3fa20c85e001a141","first_computed_at":"2026-05-18T04:09:26.095505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:26.095505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kuvAk1B5qjxk42pWkMHBP5VOxc8GJu1ZkPHT/ZVDUUwyhoCn540olUWNe8mn/SBY2lxKZ2SUrv1N0JXtnwz8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:26.096044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07f687174220a37388e7d75618359bd4868f0a8e22b9b0a18b8369933659cea8","sha256:fc3d677f2beebcf39acd6b604c61d929fbafec5937684ce4a2adfc7e920ed97b"],"state_sha256":"bde723f0e815640fabe34b2057a22c8262b6b2de5930145b85fc70d31577148e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzkQiMMdPExwqkaAe+tp05SGK5BzDUh53JEkPt2uz7L/flzNF+ymEi66rmYG6jYYo1v7zZnClBv4g6itvkeBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:43:56.030499Z","bundle_sha256":"33246bf09d29444fcfb47bf66ab2610725b04fccbea5f3c9d20a76d30e6f69d8"}}