{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z33VGTCOU3H7BD4WY6KRU2OA42","short_pith_number":"pith:Z33VGTCO","canonical_record":{"source":{"id":"1412.5330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-17T10:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"408f4013b4a07bec96237b312f1989e70b5cf32a41d09270e627c1c7b6ae2a0b","abstract_canon_sha256":"a360f61162a83c69ff56825da8aaff0a79d3b646939bf5b409a40b3f8029738b"},"schema_version":"1.0"},"canonical_sha256":"cef7534c4ea6cff08f96c7951a69c0e6956599fc790dadf55009949ab53fbada","source":{"kind":"arxiv","id":"1412.5330","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5330","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5330v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5330","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"Z33VGTCOU3H7","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z33VGTCOU3H7BD4W","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z33VGTCO","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z33VGTCOU3H7BD4WY6KRU2OA42","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-17T10:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"408f4013b4a07bec96237b312f1989e70b5cf32a41d09270e627c1c7b6ae2a0b","abstract_canon_sha256":"a360f61162a83c69ff56825da8aaff0a79d3b646939bf5b409a40b3f8029738b"},"schema_version":"1.0"},"canonical_sha256":"cef7534c4ea6cff08f96c7951a69c0e6956599fc790dadf55009949ab53fbada","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:47.873521Z","signature_b64":"wD0EWySP9Z/sP/zt+Ao61uTot9A3YIWlTsCsumJ2HK/ZCIdAizs2KWOixrluRliJ8tMvDg5kQGLrUm/F6rxxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cef7534c4ea6cff08f96c7951a69c0e6956599fc790dadf55009949ab53fbada","last_reissued_at":"2026-05-18T01:42:47.872776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:47.872776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5330","source_version":2,"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-18T01:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMaZw94mjiKkT5uFRzJHaSoy7LqHAnogLBYdr642f944KqMKScaX0fRxEflauXblMo3bHJihwAQvquSV6jp5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:24:59.203995Z"},"content_sha256":"1411d994b7345f98a3cb524f328b5104ab7bb0652bcc39d240a3ddca3f60c361","schema_version":"1.0","event_id":"sha256:1411d994b7345f98a3cb524f328b5104ab7bb0652bcc39d240a3ddca3f60c361"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z33VGTCOU3H7BD4WY6KRU2OA42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rotor-routing on Galton-Watson trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ecaterina Sava-Huss, Sebastian Mueller, Wilfried Huss","submitted_at":"2014-12-17T10:54:04Z","abstract_excerpt":"A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor-router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees, i.e. on a family tree arising from a Galton-Watson process, and give a classification in recurrence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5330","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"},"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-18T01:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LbW1qUfi+s2gvBN2VRuXYNO+MAlxO05AwtWR+O1q2tGGTB/WxO4PQC/bm4eXfjV0EDluYTz8WoII05s6GE7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:24:59.204351Z"},"content_sha256":"230539d4e2b6edccd2e8e177924f4d8678e79f414b9746782cca75b6ecc6806a","schema_version":"1.0","event_id":"sha256:230539d4e2b6edccd2e8e177924f4d8678e79f414b9746782cca75b6ecc6806a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z33VGTCOU3H7BD4WY6KRU2OA42/bundle.json","state_url":"https://pith.science/pith/Z33VGTCOU3H7BD4WY6KRU2OA42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z33VGTCOU3H7BD4WY6KRU2OA42/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-31T21:24:59Z","links":{"resolver":"https://pith.science/pith/Z33VGTCOU3H7BD4WY6KRU2OA42","bundle":"https://pith.science/pith/Z33VGTCOU3H7BD4WY6KRU2OA42/bundle.json","state":"https://pith.science/pith/Z33VGTCOU3H7BD4WY6KRU2OA42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z33VGTCOU3H7BD4WY6KRU2OA42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z33VGTCOU3H7BD4WY6KRU2OA42","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":"a360f61162a83c69ff56825da8aaff0a79d3b646939bf5b409a40b3f8029738b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-17T10:54:04Z","title_canon_sha256":"408f4013b4a07bec96237b312f1989e70b5cf32a41d09270e627c1c7b6ae2a0b"},"schema_version":"1.0","source":{"id":"1412.5330","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5330","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5330v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5330","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"Z33VGTCOU3H7","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z33VGTCOU3H7BD4W","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z33VGTCO","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:230539d4e2b6edccd2e8e177924f4d8678e79f414b9746782cca75b6ecc6806a","target":"graph","created_at":"2026-05-18T01:42:47Z","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":"A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor-router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees, i.e. on a family tree arising from a Galton-Watson process, and give a classification in recurrence ","authors_text":"Ecaterina Sava-Huss, Sebastian Mueller, Wilfried Huss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-17T10:54:04Z","title":"Rotor-routing on Galton-Watson trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5330","kind":"arxiv","version":2},"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:1411d994b7345f98a3cb524f328b5104ab7bb0652bcc39d240a3ddca3f60c361","target":"record","created_at":"2026-05-18T01:42:47Z","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":"a360f61162a83c69ff56825da8aaff0a79d3b646939bf5b409a40b3f8029738b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-17T10:54:04Z","title_canon_sha256":"408f4013b4a07bec96237b312f1989e70b5cf32a41d09270e627c1c7b6ae2a0b"},"schema_version":"1.0","source":{"id":"1412.5330","kind":"arxiv","version":2}},"canonical_sha256":"cef7534c4ea6cff08f96c7951a69c0e6956599fc790dadf55009949ab53fbada","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cef7534c4ea6cff08f96c7951a69c0e6956599fc790dadf55009949ab53fbada","first_computed_at":"2026-05-18T01:42:47.872776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:47.872776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wD0EWySP9Z/sP/zt+Ao61uTot9A3YIWlTsCsumJ2HK/ZCIdAizs2KWOixrluRliJ8tMvDg5kQGLrUm/F6rxxBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:47.873521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5330","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1411d994b7345f98a3cb524f328b5104ab7bb0652bcc39d240a3ddca3f60c361","sha256:230539d4e2b6edccd2e8e177924f4d8678e79f414b9746782cca75b6ecc6806a"],"state_sha256":"d2d6ab1037b662cb4417e93772968efc44f17411dd8d170f44fb8baebb098586"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moJBGR4DhHmwKcfjC1OmeXUXCSymIrCyfyRvfUpki649G7OdemQqx2Xmt7IkcvVw7QlMbclcUJAAw1u4PVPaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:24:59.206268Z","bundle_sha256":"7c74b86e6fd7248f37e0156169c67b1edbcdaf2eef2498b5073d39a64b3ae136"}}