{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7QS2NI6RZM2FNBHGSGU2Q4YC6G","short_pith_number":"pith:7QS2NI6R","schema_version":"1.0","canonical_sha256":"fc25a6a3d1cb345684e691a9a87302f1bab726e1726a5c625ef635b6037366ce","source":{"kind":"arxiv","id":"2606.01881","version":1},"attestation_state":"computed","paper":{"title":"Can the root cluster remain largest forever in random recursive tree percolation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yushu Zheng","submitted_at":"2026-06-01T08:27:52Z","abstract_excerpt":"We consider Bernoulli bond percolation with fixed retention parameter $p$ on the random recursive tree, coupled through the natural growth process. We prove that the root cluster has a strictly positive probability of remaining a largest cluster at every time. Equivalently, in the associated Simon-type Chinese restaurant process, the first table has a positive probability of remaining a largest table forever. We further show that two associated quantities, the limit as $n\\to\\infty$ of the probability that the root cluster is a largest cluster at time $n$ and the probability that it remains a l"},"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":"2606.01881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-06-01T08:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"52432ee4c5119049c40f92d7a80f5a656c957de56ae08d53425438acf1cf039b","abstract_canon_sha256":"830c68534a3783625de96c5ea930a9275400bd7498f43a6479e3401c4b53ce41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:59.439548Z","signature_b64":"2Aq1EVPCjCGSnCSJAR47PcOGoLzTFedxwgYs2/rMwt+sZJZISguX/99WGO3x5FL5ax3sW8Iz0WQh7G6rwihbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc25a6a3d1cb345684e691a9a87302f1bab726e1726a5c625ef635b6037366ce","last_reissued_at":"2026-06-02T02:04:59.439186Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:59.439186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can the root cluster remain largest forever in random recursive tree percolation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yushu Zheng","submitted_at":"2026-06-01T08:27:52Z","abstract_excerpt":"We consider Bernoulli bond percolation with fixed retention parameter $p$ on the random recursive tree, coupled through the natural growth process. We prove that the root cluster has a strictly positive probability of remaining a largest cluster at every time. Equivalently, in the associated Simon-type Chinese restaurant process, the first table has a positive probability of remaining a largest table forever. We further show that two associated quantities, the limit as $n\\to\\infty$ of the probability that the root cluster is a largest cluster at time $n$ and the probability that it remains a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01881","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01881/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.01881","created_at":"2026-06-02T02:04:59.439245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01881v1","created_at":"2026-06-02T02:04:59.439245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01881","created_at":"2026-06-02T02:04:59.439245+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QS2NI6RZM2F","created_at":"2026-06-02T02:04:59.439245+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QS2NI6RZM2FNBHG","created_at":"2026-06-02T02:04:59.439245+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QS2NI6R","created_at":"2026-06-02T02:04:59.439245+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/7QS2NI6RZM2FNBHGSGU2Q4YC6G","json":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G.json","graph_json":"https://pith.science/api/pith-number/7QS2NI6RZM2FNBHGSGU2Q4YC6G/graph.json","events_json":"https://pith.science/api/pith-number/7QS2NI6RZM2FNBHGSGU2Q4YC6G/events.json","paper":"https://pith.science/paper/7QS2NI6R"},"agent_actions":{"view_html":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G","download_json":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G.json","view_paper":"https://pith.science/paper/7QS2NI6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01881&json=true","fetch_graph":"https://pith.science/api/pith-number/7QS2NI6RZM2FNBHGSGU2Q4YC6G/graph.json","fetch_events":"https://pith.science/api/pith-number/7QS2NI6RZM2FNBHGSGU2Q4YC6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G/action/storage_attestation","attest_author":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G/action/author_attestation","sign_citation":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G/action/citation_signature","submit_replication":"https://pith.science/pith/7QS2NI6RZM2FNBHGSGU2Q4YC6G/action/replication_record"}},"created_at":"2026-06-02T02:04:59.439245+00:00","updated_at":"2026-06-02T02:04:59.439245+00:00"}