{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:P6SQNPPOWP6RQMYIM5OYYVMZTM","short_pith_number":"pith:P6SQNPPO","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"},"canonical_sha256":"7fa506bdeeb3fd183308675d8c55999b3787e0ab43c7fdba92703451263bfc4e","source":{"kind":"arxiv","id":"2506.02801","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02801","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02801v2","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02801","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"P6SQNPPOWP6R","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"pith_short_16","alias_value":"P6SQNPPOWP6RQMYI","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"pith_short_8","alias_value":"P6SQNPPO","created_at":"2026-07-05T11:31:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:P6SQNPPOWP6RQMYIM5OYYVMZTM","target":"record","payload":{"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"},"canonical_sha256":"7fa506bdeeb3fd183308675d8c55999b3787e0ab43c7fdba92703451263bfc4e","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"},"source_kind":"arxiv","source_id":"2506.02801","source_version":2,"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-05T11:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlHgc3MDEAvjYRo3SbXnjLuR7G2FDmnLaxgNv9GPCkw7w+8CqJsWLPabZMdtlkXFUhzqUL+Q3iOjtQAgtBfGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:58:20.454902Z"},"content_sha256":"46ff61e8e432ffd20b2ea31ee6bed050a06a8104018979f2f98a9f31d4205c10","schema_version":"1.0","event_id":"sha256:46ff61e8e432ffd20b2ea31ee6bed050a06a8104018979f2f98a9f31d4205c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:P6SQNPPOWP6RQMYIM5OYYVMZTM","target":"graph","payload":{"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"},"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-05T11:31:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftiXQpBB3ub5heWdyzM6AIfl5oyBuLslComjjS66tY2q87CRnIcE+uBuVWJQC6HgY8pNyUIq4Hf35z21ZHk+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:58:20.455412Z"},"content_sha256":"b6be913edc0fab449ae36f7a046665c0e2fa6d5752cd38b356619928be3b30c4","schema_version":"1.0","event_id":"sha256:b6be913edc0fab449ae36f7a046665c0e2fa6d5752cd38b356619928be3b30c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/bundle.json","state_url":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/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-08T09:58:20Z","links":{"resolver":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM","bundle":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/bundle.json","state":"https://pith.science/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6SQNPPOWP6RQMYIM5OYYVMZTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P6SQNPPOWP6RQMYIM5OYYVMZTM","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":"01ef2d535e57b1a8459caae965dd77796f2ffdf5cd3cbae6b0c933ed825e73ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T12:32:26Z","title_canon_sha256":"305827962e7209525ab160c0929a69c009a24f171cf9862517e1c169555a2aa1"},"schema_version":"1.0","source":{"id":"2506.02801","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02801","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02801v2","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02801","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"pith_short_12","alias_value":"P6SQNPPOWP6R","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"pith_short_16","alias_value":"P6SQNPPOWP6RQMYI","created_at":"2026-07-05T11:31:07Z"},{"alias_kind":"pith_short_8","alias_value":"P6SQNPPO","created_at":"2026-07-05T11:31:07Z"}],"graph_snapshots":[{"event_id":"sha256:b6be913edc0fab449ae36f7a046665c0e2fa6d5752cd38b356619928be3b30c4","target":"graph","created_at":"2026-07-05T11:31:07Z","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/2506.02801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)$.","authors_text":"Juan Carlos Buitrago Oropeza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02801","kind":"arxiv","version":2},"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:46ff61e8e432ffd20b2ea31ee6bed050a06a8104018979f2f98a9f31d4205c10","target":"record","created_at":"2026-07-05T11:31:07Z","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":"01ef2d535e57b1a8459caae965dd77796f2ffdf5cd3cbae6b0c933ed825e73ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T12:32:26Z","title_canon_sha256":"305827962e7209525ab160c0929a69c009a24f171cf9862517e1c169555a2aa1"},"schema_version":"1.0","source":{"id":"2506.02801","kind":"arxiv","version":2}},"canonical_sha256":"7fa506bdeeb3fd183308675d8c55999b3787e0ab43c7fdba92703451263bfc4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fa506bdeeb3fd183308675d8c55999b3787e0ab43c7fdba92703451263bfc4e","first_computed_at":"2026-07-05T11:31:07.400079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:31:07.400079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qgA2hAz1mErru0Im8LdsiVqJ5dzmkxjUlbktUjmtADfPqwdB1YNEI5USFsXcAdGHRqDitNhXWtYqVI3IzMBTAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:31:07.400572Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02801","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46ff61e8e432ffd20b2ea31ee6bed050a06a8104018979f2f98a9f31d4205c10","sha256:b6be913edc0fab449ae36f7a046665c0e2fa6d5752cd38b356619928be3b30c4"],"state_sha256":"be1b06df36bcea3ed9e90008f3cb3bafe0df44765967710d79a0ba5b62d6db39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwmV3/poEX2Psjxt3zRYQ4PKJrP7pIxbwvlzroSC++W8ufVkOYiPUavX+ip1lQUa5/cRWwv9FWmsfVFMiXQVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:58:20.460222Z","bundle_sha256":"6c59f226721644d3b623530f2a2feea06208616ed994576d5c5ff50da77ecef4"}}