{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PHR4DMBT2ZNJ6FW2UP2AGAGOMD","short_pith_number":"pith:PHR4DMBT","schema_version":"1.0","canonical_sha256":"79e3c1b033d65a9f16daa3f40300ce60c641e0b7da30b00cc44f88b9691939a5","source":{"kind":"arxiv","id":"1701.02813","version":2},"attestation_state":"computed","paper":{"title":"Recurrence of the frog model on the 3,2-alternating tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Josh Rosenberg","submitted_at":"2017-01-10T23:52:26Z","abstract_excerpt":"Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is activated at that node, and begins its own random walk. The model described belongs to a class of problems that are collectively referred to as the frog model. Building on a recent proof of recurrence (meaning infinitely many frogs hit the root with probability one) on the regular binary tree, this paper establishes recurrence for the 3,2-alternating case."},"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":"1701.02813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-01-10T23:52:26Z","cross_cats_sorted":[],"title_canon_sha256":"2b1d24f4bb2affa75aee759b2120e8986baa8cfa76ea225b44186f30871082e6","abstract_canon_sha256":"ed71daeb6c28df896886ad9f7d3db5c4364f1c6b17f12cdcfbfa161dfb5cdf27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:24.025272Z","signature_b64":"o3ZxqJZohbf1rDs4g2ARG1mDuZDf82ezpuR9RN1JNG88AXPj/9x8RoUWRK8DwnM5iK5B4jAfON0LS7bltpWSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e3c1b033d65a9f16daa3f40300ce60c641e0b7da30b00cc44f88b9691939a5","last_reissued_at":"2026-05-18T00:40:24.024665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:24.024665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrence of the frog model on the 3,2-alternating tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Josh Rosenberg","submitted_at":"2017-01-10T23:52:26Z","abstract_excerpt":"Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is activated at that node, and begins its own random walk. The model described belongs to a class of problems that are collectively referred to as the frog model. Building on a recent proof of recurrence (meaning infinitely many frogs hit the root with probability one) on the regular binary tree, this paper establishes recurrence for the 3,2-alternating case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02813","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.02813","created_at":"2026-05-18T00:40:24.024763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02813v2","created_at":"2026-05-18T00:40:24.024763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02813","created_at":"2026-05-18T00:40:24.024763+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHR4DMBT2ZNJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHR4DMBT2ZNJ6FW2","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHR4DMBT","created_at":"2026-05-18T12:31:37.085036+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/PHR4DMBT2ZNJ6FW2UP2AGAGOMD","json":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD.json","graph_json":"https://pith.science/api/pith-number/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/graph.json","events_json":"https://pith.science/api/pith-number/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/events.json","paper":"https://pith.science/paper/PHR4DMBT"},"agent_actions":{"view_html":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD","download_json":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD.json","view_paper":"https://pith.science/paper/PHR4DMBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02813&json=true","fetch_graph":"https://pith.science/api/pith-number/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/graph.json","fetch_events":"https://pith.science/api/pith-number/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/action/storage_attestation","attest_author":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/action/author_attestation","sign_citation":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/action/citation_signature","submit_replication":"https://pith.science/pith/PHR4DMBT2ZNJ6FW2UP2AGAGOMD/action/replication_record"}},"created_at":"2026-05-18T00:40:24.024763+00:00","updated_at":"2026-05-18T00:40:24.024763+00:00"}