{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/0-1-laws-for-pattern-occurrences-in","title":"0-1 laws for pattern occurrences in phylogenetic trees and networks","arxiv_id":"2402.04499","date":"2024-02-07","proceeding":null,"authors":["François Bienvenu","Mike Steel"],"abstract":"In a recent paper, the question of determining the fraction of binary trees that contain a fixed pattern known as the snowflake was posed. We show that this fraction goes to 1, providing two very different proofs: a purely combinatorial one that is quantitative and specific to this problem; and a proof using branching process techniques that is less explicit, but also much more general, as it applies to any fixed patterns and can be extended to other trees and networks. In particular, it follows immediately from our second proof that the fraction of $d$-ary trees (resp. level-$k$ networks) that contain a fixed $d$-ary tree (resp. level-$k$ network) tends to $1$ as the number of leaves grows.","url_abs":"https://arxiv.org/abs/2402.04499v2","url_pdf":"https://arxiv.org/pdf/2402.04499v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"10-shot-image-generation","task_name":"10-shot image generation"},{"task_slug":"3d-anomaly-detection-and-segmentation","task_name":"3D Anomaly Detection and Segmentation"},{"task_slug":"3d-face-reconstruction","task_name":"3D Face Reconstruction"},{"task_slug":"articles","task_name":"Articles"},{"task_slug":"automated-theorem-proving","task_name":"Automated Theorem Proving"},{"task_slug":"deepfake-detection","task_name":"DeepFake Detection"},{"task_slug":"face-swapping","task_name":"Face Swapping"},{"task_slug":"informativeness","task_name":"Informativeness"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"object-tracking","task_name":"Object Tracking"},{"task_slug":"shadow-removal","task_name":"Shadow Removal"},{"task_slug":"style-transfer","task_name":"Style Transfer"},{"task_slug":"text-to-image-generation","task_name":"Text-to-Image Generation"},{"task_slug":"unconditional-video-generation","task_name":"Unconditional Video Generation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"},{"task_slug":"video-object-detection","task_name":"Video Object Detection"},{"task_slug":"weakly-supervised-semantic-segmentation","task_name":"Weakly-Supervised Semantic Segmentation"},{"task_slug":"zero-shot-3d-point-cloud-classification","task_name":"Zero-shot 3D Point Cloud Classification"}],"methods":[{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"20 Easy Tricks to Reach Frontier Support Instantly"},{"method_slug":null,"method_name":"20 Quick and Simple Ways to Contact Frontier Support Anytime"},{"method_slug":null,"method_name":"20 Rapid Contact Options for Direct Assistance from Frontier"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"5 Ways to Pay Your Spectrum Bill Fast&Free by Phone Call: 5 Quick and Easy"},{"method_slug":null,"method_name":"6 Fast Methods to Access Skyscanner Support"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Comment annuler un billet Etihad sans stress"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Don’t Get Stuck"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Exp.com"},{"method_slug":null,"method_name":"Fast, Live Support"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Human in Seconds"},{"method_slug":null,"method_name":"James David"},{"method_slug":null,"method_name":"Live Support Now"},{"method_slug":null,"method_name":"Liya56"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Props 3D Model"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Quickbooks"},{"method_slug":null,"method_name":"Real Person"},{"method_slug":null,"method_name":"Roobinhood"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"STOP the Frustration"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"Skip the Bots"},{"method_slug":null,"method_name":"Sp5derHoodiecom"},{"method_slug":null,"method_name":"TAP Air Portugal Support By Phone and Email: Your Complete Guide to Hassle-Free Contact"},{"method_slug":null,"method_name":"TRON"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"TrimIQ Dragons Den UK"},{"method_slug":null,"method_name":"TrimIQ UK Review - TrimIQ Customer Reviews | TrimIQ Testimonials."},{"method_slug":null,"method_name":"Trust Wallet"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":"[[booked on Expedia]]What is a fully refundable ticket on Expedia"},{"method_slug":null,"method_name":"asdcfv"},{"method_slug":null,"method_name":"asfsfs"},{"method_slug":null,"method_name":"contactar con el servicio de atención al cliente de Expedia"},{"method_slug":null,"method_name":"de contactar con el servicio de atención al cliente de Delta"},{"method_slug":null,"method_name":"el servicio de atención al cliente de Aeroméxico"},{"method_slug":null,"method_name":"for Immediate Human"},{"method_slug":null,"method_name":"for Instant Human"},{"method_slug":null,"method_name":"hammondindustries"},{"method_slug":null,"method_name":"https://paperswithcode.com/method/8-easy-options-to-connect-with-booking-com"},{"method_slug":null,"method_name":"official Expedia"},{"method_slug":null,"method_name":"qswdefg"},{"method_slug":null,"method_name":"sdgdgzsd"},{"method_slug":null,"method_name":"test\">"},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null},{"method_slug":null,"method_name":null}],"datasets_introduced":[{"slug":"squad","name":"SQuAD","full_name":"Stanford Question Answering Dataset"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a2c72d9f158b8cb38f4220710335f45d3264d6e539203451aded3ca91cf329f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}