{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:PYPLMOK64AK7BDSLAMGTPE2MDC","short_pith_number":"pith:PYPLMOK6","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"},"canonical_sha256":"7e1eb6395ee015f08e4b030d37934c188b36292b9489a56d78f097452c2ec52f","source":{"kind":"arxiv","id":"2004.02800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02800","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02800v1","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02800","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"PYPLMOK64AK7","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"pith_short_16","alias_value":"PYPLMOK64AK7BDSL","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"pith_short_8","alias_value":"PYPLMOK6","created_at":"2026-07-05T00:53:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:PYPLMOK64AK7BDSLAMGTPE2MDC","target":"record","payload":{"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"},"canonical_sha256":"7e1eb6395ee015f08e4b030d37934c188b36292b9489a56d78f097452c2ec52f","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"},"source_kind":"arxiv","source_id":"2004.02800","source_version":1,"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-07-05T00:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+ihpeFbVI7qGuUlvL6QyVzszrB9sOZ4GM8x6UY6KeChsR3sTbbpMamodcX8Qm3OifmFXqyTojM9GbFEPI++Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:12:06.975202Z"},"content_sha256":"76ab4779f4f2ba05dfa5655d0524574f744cf3f9224d20eb3a3c1b584012786e","schema_version":"1.0","event_id":"sha256:76ab4779f4f2ba05dfa5655d0524574f744cf3f9224d20eb3a3c1b584012786e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:PYPLMOK64AK7BDSLAMGTPE2MDC","target":"graph","payload":{"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"},"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-07-05T00:53:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYhQPYxK844wdJQcFzKVyYCc8R2N6wHSnXHguMcAgAY0oNXlUnii0htNuYUQnr5fevTg69FZ8m+n74bZ8G3wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:12:06.975776Z"},"content_sha256":"cee90e835173c6305f89d2336db99dba30f96f10367c962c8a3289a7f38acf06","schema_version":"1.0","event_id":"sha256:cee90e835173c6305f89d2336db99dba30f96f10367c962c8a3289a7f38acf06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/bundle.json","state_url":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/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-08-08T16:12:06Z","links":{"resolver":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC","bundle":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/bundle.json","state":"https://pith.science/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYPLMOK64AK7BDSLAMGTPE2MDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PYPLMOK64AK7BDSLAMGTPE2MDC","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":"b6efa889152a6a99a83cf97717837a038c95fd838258cbabbc43b5e1afd1da8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-06T16:45:40Z","title_canon_sha256":"5d09537d5193a9945f65cd67c3449065ec71fff80f0262437956cd41bffa986c"},"schema_version":"1.0","source":{"id":"2004.02800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02800","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02800v1","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02800","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"pith_short_12","alias_value":"PYPLMOK64AK7","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"pith_short_16","alias_value":"PYPLMOK64AK7BDSL","created_at":"2026-07-05T00:53:02Z"},{"alias_kind":"pith_short_8","alias_value":"PYPLMOK6","created_at":"2026-07-05T00:53:02Z"}],"graph_snapshots":[{"event_id":"sha256:cee90e835173c6305f89d2336db99dba30f96f10367c962c8a3289a7f38acf06","target":"graph","created_at":"2026-07-05T00:53:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.02800/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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/","authors_text":"Nemanja Dragani\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-06T16:45:40Z","title":"Large induced trees in dense random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02800","kind":"arxiv","version":1},"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:76ab4779f4f2ba05dfa5655d0524574f744cf3f9224d20eb3a3c1b584012786e","target":"record","created_at":"2026-07-05T00:53:02Z","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":"b6efa889152a6a99a83cf97717837a038c95fd838258cbabbc43b5e1afd1da8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-06T16:45:40Z","title_canon_sha256":"5d09537d5193a9945f65cd67c3449065ec71fff80f0262437956cd41bffa986c"},"schema_version":"1.0","source":{"id":"2004.02800","kind":"arxiv","version":1}},"canonical_sha256":"7e1eb6395ee015f08e4b030d37934c188b36292b9489a56d78f097452c2ec52f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e1eb6395ee015f08e4b030d37934c188b36292b9489a56d78f097452c2ec52f","first_computed_at":"2026-07-05T00:53:02.911554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:53:02.911554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"POn38EZafIigeDO/b82PD2IWObdUv7xm5ch+f1yQubhDYpt7rXfp6GjDkWjTmSRXb1SWeWnTPZ/7gAiUFOq4Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T00:53:02.911928Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.02800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ab4779f4f2ba05dfa5655d0524574f744cf3f9224d20eb3a3c1b584012786e","sha256:cee90e835173c6305f89d2336db99dba30f96f10367c962c8a3289a7f38acf06"],"state_sha256":"2f4515e7439e81393d39329b1be7284482cf18cf345dfb16a39164eb38a6978e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XANDjJR9KaDk3rd/+wt4hA9Ifv7tU7Gof4Y9xj7QI6k2Ql629AS6IjPEh3Lh3JgoQW8eYD6xUwiWqBtvL9BsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:12:06.979882Z","bundle_sha256":"0b29a5dbb21933ad4b1c54ff79bfd1e4329cc20d0f0ec928b7b17661b334ac84"}}