{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P6SQNPPOWP6RQMYIM5OYYVMZTM","short_pith_number":"pith:P6SQNPPO","schema_version":"1.0","canonical_sha256":"7fa506bdeeb3fd183308675d8c55999b3787e0ab43c7fdba92703451263bfc4e","source":{"kind":"arxiv","id":"2506.02801","version":2},"attestation_state":"computed","paper":{"title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Juan Carlos Buitrago Oropeza","submitted_at":"2025-06-03T12:32:26Z","abstract_excerpt":"Kamaldinov, Skorkin, and Zhukovskii proved that the maximum size of an induced subtree in the binomial random graph $G(n,p)$ is concentrated at two consecutive points, whenever $p\\in(0,1)$ is a constant. Using improved bounds on the second moment of the number of induced subtrees, we show that the same result holds when $n^{-\\frac{e-2}{3e-2}+\\varepsilon}\\leq p=o(1)$."},"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":"2506.02801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T12:32:26Z","cross_cats_sorted":[],"title_canon_sha256":"305827962e7209525ab160c0929a69c009a24f171cf9862517e1c169555a2aa1","abstract_canon_sha256":"01ef2d535e57b1a8459caae965dd77796f2ffdf5cd3cbae6b0c933ed825e73ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:07.400572Z","signature_b64":"qgA2hAz1mErru0Im8LdsiVqJ5dzmkxjUlbktUjmtADfPqwdB1YNEI5USFsXcAdGHRqDitNhXWtYqVI3IzMBTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fa506bdeeb3fd183308675d8c55999b3787e0ab43c7fdba92703451263bfc4e","last_reissued_at":"2026-07-05T11:31:07.400079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:07.400079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Juan Carlos Buitrago Oropeza","submitted_at":"2025-06-03T12:32:26Z","abstract_excerpt":"Kamaldinov, Skorkin, and Zhukovskii proved that the maximum size of an induced subtree in the binomial random graph $G(n,p)$ is concentrated at two consecutive points, whenever $p\\in(0,1)$ is a constant. Using improved bounds on the second moment of the number of induced subtrees, we show that the same result holds when $n^{-\\frac{e-2}{3e-2}+\\varepsilon}\\leq p=o(1)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02801","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.02801/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":"2506.02801","created_at":"2026-07-05T11:31:07.400130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02801v2","created_at":"2026-07-05T11:31:07.400130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02801","created_at":"2026-07-05T11:31:07.400130+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6SQNPPOWP6R","created_at":"2026-07-05T11:31:07.400130+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6SQNPPOWP6RQMYI","created_at":"2026-07-05T11:31:07.400130+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6SQNPPO","created_at":"2026-07-05T11:31:07.400130+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/P6SQNPPOWP6RQMYIM5OYYVMZTM","json":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM.json","graph_json":"https://pith.science/api/pith-number/P6SQNPPOWP6RQMYIM5OYYVMZTM/graph.json","events_json":"https://pith.science/api/pith-number/P6SQNPPOWP6RQMYIM5OYYVMZTM/events.json","paper":"https://pith.science/paper/P6SQNPPO"},"agent_actions":{"view_html":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM","download_json":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM.json","view_paper":"https://pith.science/paper/P6SQNPPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02801&json=true","fetch_graph":"https://pith.science/api/pith-number/P6SQNPPOWP6RQMYIM5OYYVMZTM/graph.json","fetch_events":"https://pith.science/api/pith-number/P6SQNPPOWP6RQMYIM5OYYVMZTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/action/storage_attestation","attest_author":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/action/author_attestation","sign_citation":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/action/citation_signature","submit_replication":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/action/replication_record"}},"created_at":"2026-07-05T11:31:07.400130+00:00","updated_at":"2026-07-05T11:31:07.400130+00:00"}