{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PYPLMOK64AK7BDSLAMGTPE2MDC","short_pith_number":"pith:PYPLMOK6","schema_version":"1.0","canonical_sha256":"7e1eb6395ee015f08e4b030d37934c188b36292b9489a56d78f097452c2ec52f","source":{"kind":"arxiv","id":"2004.02800","version":1},"attestation_state":"computed","paper":{"title":"Large induced trees in dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nemanja Dragani\\'c","submitted_at":"2020-04-06T16:45:40Z","abstract_excerpt":"Erd\\H{o}s and Palka initiated the study of the maximal size of induced trees in random graphs in 1983. They proved that for every fixed $0<p<1$ the size of a largest induced tree in $G_{n,p}$ is concentrated around $2\\log_q (np)$ with high probability, where $q=(1-p)^{-1}$. De la Vega showed concentration around the same value for $p=C/n$ where $C$ is a large constant, and his proof also works for all larger $p$. We show that for any given tree $T$ with bounded maximum degree and of size $(2-o(1))\\log_q(np)$, $G_{n,p}$ contains an induced copy of $T$ with high probability for $n^{-1/2}\\ln^{10/"},"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":"2004.02800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-06T16:45:40Z","cross_cats_sorted":[],"title_canon_sha256":"5d09537d5193a9945f65cd67c3449065ec71fff80f0262437956cd41bffa986c","abstract_canon_sha256":"b6efa889152a6a99a83cf97717837a038c95fd838258cbabbc43b5e1afd1da8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:02.911928Z","signature_b64":"POn38EZafIigeDO/b82PD2IWObdUv7xm5ch+f1yQubhDYpt7rXfp6GjDkWjTmSRXb1SWeWnTPZ/7gAiUFOq4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e1eb6395ee015f08e4b030d37934c188b36292b9489a56d78f097452c2ec52f","last_reissued_at":"2026-07-05T00:53:02.911554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:02.911554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large induced trees in dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nemanja Dragani\\'c","submitted_at":"2020-04-06T16:45:40Z","abstract_excerpt":"Erd\\H{o}s and Palka initiated the study of the maximal size of induced trees in random graphs in 1983. They proved that for every fixed $0<p<1$ the size of a largest induced tree in $G_{n,p}$ is concentrated around $2\\log_q (np)$ with high probability, where $q=(1-p)^{-1}$. De la Vega showed concentration around the same value for $p=C/n$ where $C$ is a large constant, and his proof also works for all larger $p$. We show that for any given tree $T$ with bounded maximum degree and of size $(2-o(1))\\log_q(np)$, $G_{n,p}$ contains an induced copy of $T$ with high probability for $n^{-1/2}\\ln^{10/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02800","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/2004.02800/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":"2004.02800","created_at":"2026-07-05T00:53:02.911615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.02800v1","created_at":"2026-07-05T00:53:02.911615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02800","created_at":"2026-07-05T00:53:02.911615+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYPLMOK64AK7","created_at":"2026-07-05T00:53:02.911615+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYPLMOK64AK7BDSL","created_at":"2026-07-05T00:53:02.911615+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYPLMOK6","created_at":"2026-07-05T00:53:02.911615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02801","citing_title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC","json":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC.json","graph_json":"https://pith.science/api/pith-number/PYPLMOK64AK7BDSLAMGTPE2MDC/graph.json","events_json":"https://pith.science/api/pith-number/PYPLMOK64AK7BDSLAMGTPE2MDC/events.json","paper":"https://pith.science/paper/PYPLMOK6"},"agent_actions":{"view_html":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC","download_json":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC.json","view_paper":"https://pith.science/paper/PYPLMOK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.02800&json=true","fetch_graph":"https://pith.science/api/pith-number/PYPLMOK64AK7BDSLAMGTPE2MDC/graph.json","fetch_events":"https://pith.science/api/pith-number/PYPLMOK64AK7BDSLAMGTPE2MDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/action/storage_attestation","attest_author":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/action/author_attestation","sign_citation":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/action/citation_signature","submit_replication":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/action/replication_record"}},"created_at":"2026-07-05T00:53:02.911615+00:00","updated_at":"2026-07-05T00:53:02.911615+00:00"}