{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ULYYL2A4HEE3EI4EVKSUB2N7R3","short_pith_number":"pith:ULYYL2A4","canonical_record":{"source":{"id":"1404.6238","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-24T19:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"e0a0a59bb6f1e61eb21c7f018a0a75d485e1272bc4de78db782776cd473d5124","abstract_canon_sha256":"8c0c6aadb942f1e98f0cae7e610a98647da2ee9e41f7ebd6721a9cdd27431dbe"},"schema_version":"1.0"},"canonical_sha256":"a2f185e81c3909b22384aaa540e9bf8ecd63d10e269a1c0f276671f6d6270321","source":{"kind":"arxiv","id":"1404.6238","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6238","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6238v6","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6238","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"ULYYL2A4HEE3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"ULYYL2A4HEE3EI4E","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"ULYYL2A4","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ULYYL2A4HEE3EI4EVKSUB2N7R3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6238","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-24T19:34:45Z","cross_cats_sorted":[],"title_canon_sha256":"e0a0a59bb6f1e61eb21c7f018a0a75d485e1272bc4de78db782776cd473d5124","abstract_canon_sha256":"8c0c6aadb942f1e98f0cae7e610a98647da2ee9e41f7ebd6721a9cdd27431dbe"},"schema_version":"1.0"},"canonical_sha256":"a2f185e81c3909b22384aaa540e9bf8ecd63d10e269a1c0f276671f6d6270321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:10.675554Z","signature_b64":"bezcfpidqo6m4pN05ky1n7EvZl/zXCTkbCwF2IMUIHPu6JAwonm6FNbixXv+YV5YDJLphPvKSCXLZ17d/ONtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2f185e81c3909b22384aaa540e9bf8ecd63d10e269a1c0f276671f6d6270321","last_reissued_at":"2026-05-18T00:24:10.674648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:10.674648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6238","source_version":6,"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-18T00:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWe6utBUjpI54uq51P2bJueDTZoXKB6LG1OOjoNPytf9pZXO96XWqMY+0BDLGXE86hZCvE/BRF22dFPAyL/gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:37:50.971771Z"},"content_sha256":"8c90e8336aa927f7ea9ff0d36d8845344356640bbc9367ca8e48826743be1d1b","schema_version":"1.0","event_id":"sha256:8c90e8336aa927f7ea9ff0d36d8845344356640bbc9367ca8e48826743be1d1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ULYYL2A4HEE3EI4EVKSUB2N7R3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrence and transience for the frog model on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christopher Hoffman, Matthew Junge, Tobias Johnson","submitted_at":"2014-04-24T19:34:45Z","abstract_excerpt":"The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase transition, finding it recurrent for $d=2$ and transient for $d\\geq 5$. Simulations suggest strong recurrence for $d=2$, weak recurrence for $d=3$, and transience for $d\\geq 4$. Additionally, we prove a 0-1 law for all $d$-ary trees, and we exhibit a graph on which a 0-1 law does not hold.\n  To prove recurrence when $d=2$, we construct a recursive distribution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6238","kind":"arxiv","version":6},"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-18T00:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvB7u/cByZMR57E26kHWxtRKwQNTurybJrRe7GMlAf/Z4EAqH8DRQesL1RJX73ljXgcb0iuNah1Fb4+/RplZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:37:50.972468Z"},"content_sha256":"a8a4eb4a651d13d93ef4c7fefac0b251e765187d31b4443f8052089687b3f6f7","schema_version":"1.0","event_id":"sha256:a8a4eb4a651d13d93ef4c7fefac0b251e765187d31b4443f8052089687b3f6f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3/bundle.json","state_url":"https://pith.science/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3/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-24T12:37:50Z","links":{"resolver":"https://pith.science/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3","bundle":"https://pith.science/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3/bundle.json","state":"https://pith.science/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULYYL2A4HEE3EI4EVKSUB2N7R3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ULYYL2A4HEE3EI4EVKSUB2N7R3","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":"8c0c6aadb942f1e98f0cae7e610a98647da2ee9e41f7ebd6721a9cdd27431dbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-24T19:34:45Z","title_canon_sha256":"e0a0a59bb6f1e61eb21c7f018a0a75d485e1272bc4de78db782776cd473d5124"},"schema_version":"1.0","source":{"id":"1404.6238","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6238","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6238v6","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6238","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"ULYYL2A4HEE3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"ULYYL2A4HEE3EI4E","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"ULYYL2A4","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:a8a4eb4a651d13d93ef4c7fefac0b251e765187d31b4443f8052089687b3f6f7","target":"graph","created_at":"2026-05-18T00:24:10Z","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 frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase transition, finding it recurrent for $d=2$ and transient for $d\\geq 5$. Simulations suggest strong recurrence for $d=2$, weak recurrence for $d=3$, and transience for $d\\geq 4$. Additionally, we prove a 0-1 law for all $d$-ary trees, and we exhibit a graph on which a 0-1 law does not hold.\n  To prove recurrence when $d=2$, we construct a recursive distribution","authors_text":"Christopher Hoffman, Matthew Junge, Tobias Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-24T19:34:45Z","title":"Recurrence and transience for the frog model on trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6238","kind":"arxiv","version":6},"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:8c90e8336aa927f7ea9ff0d36d8845344356640bbc9367ca8e48826743be1d1b","target":"record","created_at":"2026-05-18T00:24:10Z","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":"8c0c6aadb942f1e98f0cae7e610a98647da2ee9e41f7ebd6721a9cdd27431dbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-24T19:34:45Z","title_canon_sha256":"e0a0a59bb6f1e61eb21c7f018a0a75d485e1272bc4de78db782776cd473d5124"},"schema_version":"1.0","source":{"id":"1404.6238","kind":"arxiv","version":6}},"canonical_sha256":"a2f185e81c3909b22384aaa540e9bf8ecd63d10e269a1c0f276671f6d6270321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2f185e81c3909b22384aaa540e9bf8ecd63d10e269a1c0f276671f6d6270321","first_computed_at":"2026-05-18T00:24:10.674648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:10.674648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bezcfpidqo6m4pN05ky1n7EvZl/zXCTkbCwF2IMUIHPu6JAwonm6FNbixXv+YV5YDJLphPvKSCXLZ17d/ONtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:10.675554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6238","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c90e8336aa927f7ea9ff0d36d8845344356640bbc9367ca8e48826743be1d1b","sha256:a8a4eb4a651d13d93ef4c7fefac0b251e765187d31b4443f8052089687b3f6f7"],"state_sha256":"2eba81c23a32c3ee24adcf9d99fc38e26f5398ff6e392da41e1260845403744e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCZWE9Y8iIElWKtw/LgUla12Jq050fIa1Ptyk4sF+aUtO0mJKPBveWhUB1265J12l4dMcEL70U3ZesJ7OcM1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T12:37:50.976254Z","bundle_sha256":"05f49687cfbe5a3b7e4a7ea42dc6651d5c7f7ff0d6f28c67465c67e28ff3eb4f"}}