{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HW6J5NGATBVP5UZVUYXCX7Z2EW","short_pith_number":"pith:HW6J5NGA","schema_version":"1.0","canonical_sha256":"3dbc9eb4c0986afed335a62e2bff3a25a3d6d0c1613b8c546034a7aecdefba6c","source":{"kind":"arxiv","id":"2408.15215","version":1},"attestation_state":"computed","paper":{"title":"Maximum induced trees and forests of bounded degree in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Margarita Akhmejanova, Vladislav Kozhevnikov","submitted_at":"2024-08-27T17:23:58Z","abstract_excerpt":"Asymptotic behaviour of maximum sizes of induced trees and forests has been studied extensively in last decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: 1) We prove $2$-point concentration of the maximum sizes of an induced forest and an induced tree with maximum degree at most $\\Delta$ in dense binomial random graphs $G(n,p)$ with constant probability $p$. 2) We show concentration in an explicit interval of size $o(1/p)$ for the maximum size of an induced forest with maximum degree at most $\\Delta$ for $1/n\\ll p=o(1)$. Our proof"},"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":"2408.15215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-08-27T17:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"0a780a14e860de59fd4b7d151ffd88c7d75e33ca6d0c73534360be1e0cd41676","abstract_canon_sha256":"81f2cd69075b8f9792ddf5e4ce0a48a48c9eee30468863b85abe227c99cfd7cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:55.951043Z","signature_b64":"LsBY+ycVCs21PZE4MRYELFDaVg8tTz+6NEP1XJp+qBA/L4zJ01bgJky6gxzSMxE0p+I4u27xyvDuFx6byffZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dbc9eb4c0986afed335a62e2bff3a25a3d6d0c1613b8c546034a7aecdefba6c","last_reissued_at":"2026-07-05T08:59:55.950593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:55.950593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum induced trees and forests of bounded degree in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maksim Zhukovskii, Margarita Akhmejanova, Vladislav Kozhevnikov","submitted_at":"2024-08-27T17:23:58Z","abstract_excerpt":"Asymptotic behaviour of maximum sizes of induced trees and forests has been studied extensively in last decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: 1) We prove $2$-point concentration of the maximum sizes of an induced forest and an induced tree with maximum degree at most $\\Delta$ in dense binomial random graphs $G(n,p)$ with constant probability $p$. 2) We show concentration in an explicit interval of size $o(1/p)$ for the maximum size of an induced forest with maximum degree at most $\\Delta$ for $1/n\\ll p=o(1)$. Our proof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15215","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/2408.15215/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":"2408.15215","created_at":"2026-07-05T08:59:55.950653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.15215v1","created_at":"2026-07-05T08:59:55.950653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15215","created_at":"2026-07-05T08:59:55.950653+00:00"},{"alias_kind":"pith_short_12","alias_value":"HW6J5NGATBVP","created_at":"2026-07-05T08:59:55.950653+00:00"},{"alias_kind":"pith_short_16","alias_value":"HW6J5NGATBVP5UZV","created_at":"2026-07-05T08:59:55.950653+00:00"},{"alias_kind":"pith_short_8","alias_value":"HW6J5NGA","created_at":"2026-07-05T08:59:55.950653+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":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW","json":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW.json","graph_json":"https://pith.science/api/pith-number/HW6J5NGATBVP5UZVUYXCX7Z2EW/graph.json","events_json":"https://pith.science/api/pith-number/HW6J5NGATBVP5UZVUYXCX7Z2EW/events.json","paper":"https://pith.science/paper/HW6J5NGA"},"agent_actions":{"view_html":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW","download_json":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW.json","view_paper":"https://pith.science/paper/HW6J5NGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.15215&json=true","fetch_graph":"https://pith.science/api/pith-number/HW6J5NGATBVP5UZVUYXCX7Z2EW/graph.json","fetch_events":"https://pith.science/api/pith-number/HW6J5NGATBVP5UZVUYXCX7Z2EW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW/action/storage_attestation","attest_author":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW/action/author_attestation","sign_citation":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW/action/citation_signature","submit_replication":"https://pith.science/pith/HW6J5NGATBVP5UZVUYXCX7Z2EW/action/replication_record"}},"created_at":"2026-07-05T08:59:55.950653+00:00","updated_at":"2026-07-05T08:59:55.950653+00:00"}