{"as_of":"2026-08-08T08:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f6d59cbc48a421a91fadf63fb8f08decc14cd98050c1f250fe7e232e7ad921b1","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:31:20.896037Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.02801/citation-record","integrity":"/paper/2506.02801/integrity","json":"/paper/2506.02801/citation-record.json","paper":"/paper/2506.02801"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.293518Z","title":"The maximum size of an induced forest in the binomial random graph","venue":null,"work_id":"ef121314-17db-460f-aab8-85f974869570","year":2024},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:19.639315Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:6be4cd9b2a0487b4edfea7575f0d476be089f2fc65f486c56be20cbad892b4be","observation_id":"4d0099c7-59d7-48c7-8555-d893979b216e","resolution":{"observed_at":"2026-08-07T11:31:21.298930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15215","last_updated":"2024-08-27T17:23:58Z","snapshot_observed_at":"2026-07-06T19:06:41.697671Z","submitted_at":"2024-08-27T17:23:58Z","title":"Maximum induced trees and forests of bounded degree in random graphs","version":1},"cited_work":{"arxiv_id":"2408.15215","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.15215","snapshot_observed_at":"2026-08-07T11:31:20.975308Z","title":"Maximum induced trees and forests of bounded degree in random graphs","venue":"math.CO","work_id":"52363cba-0639-467a-a55d-000717886a01","year":2024},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:19.729096Z"},"links":{"cited_paper":"/paper/2408.15215","citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:a4b038b8c50574e28b2836778202031d7982fba9cf0caf118fff350dd5636cef","observation_id":"9e07370a-412c-49df-91d9-3f548eb006fa","resolution":{"observed_at":"2026-08-07T11:31:20.979924Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.277532Z","title":"On the sizes of large subgraphs of the binomial random graph","venue":null,"work_id":"d3297059-b782-493b-a24c-058f8cb44be4","year":2022},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:19.837939Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:7a4a6507d9f7ef8e2e0bf4083c152f26346405d5cda9ab398e408b01a0288a54","observation_id":"aff0fb4c-cc5d-4570-96aa-ebacfbdda594","resolution":{"observed_at":"2026-08-07T11:31:21.283352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.262575Z","title":"Two-Point Concentration of the Independence Number of the Ran- dom Graph","venue":null,"work_id":"fa3e3160-c3d5-4615-b002-d890361791c9","year":2022},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:19.945848Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:d98a9f4bf8adb86747103d646f6066ddea12bf90269d34572c3f433bd23fb762","observation_id":"67ca9982-b907-46de-80ba-f11cac8db1ad","resolution":{"observed_at":"2026-08-07T11:31:21.267580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.248410Z","title":"Two-point concentration of the domination number of random graphs","venue":null,"work_id":"163d6f5f-765b-4d65-a49a-3ad4b6787875","year":2024},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.032718Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:887833f7ce59830f7b17444292a3c7d257bc4cb63dff06d7f950ee7f294e72b9","observation_id":"e2419f33-a6fd-44bb-9715-6af7b64cd122","resolution":{"observed_at":"2026-08-07T11:31:21.253136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.233607Z","title":"Random Graphs","venue":null,"work_id":"52a5cf57-566c-498d-8bc1-351de2a7fedf","year":2001},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.120919Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:a30f44abb6cf7826be976339bbd081693031a79fd48a4b27a31627feb05e9bf4","observation_id":"57a27882-e704-4e02-b20b-c128e3dca0ed","resolution":{"observed_at":"2026-08-07T11:31:21.238711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.218838Z","title":"Cliques in random graphs","venue":null,"work_id":"dff04afd-641b-46d6-8040-7474cd0f0245","year":1976},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.277412Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:610f739c5a9af9700fed76ff9f21078b2a35ad0326cacef3640368a060beb82f","observation_id":"52be6ad3-3d81-4cc9-bdb2-573434b6bf66","resolution":{"observed_at":"2026-08-07T11:31:21.223191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.204894Z","title":"Maximum Induced Trees in Sparse Random Graphs","venue":null,"work_id":"ca4f2220-5855-44a4-b532-26b29cd39408","year":2024},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.381317Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:8288b05023572ad7cb99e724338f09892d87a8b28594b2222a40058ae2da9e61","observation_id":"c3610393-151c-4f84-b03c-9f39cc00fcc9","resolution":{"observed_at":"2026-08-07T11:31:21.209490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.191874Z","title":"Large induced matchings in random graphs","venue":null,"work_id":"fee737d7-3e99-47bb-a154-bda67959fc67","year":2021},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.434077Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:d0204af8d184eb556b531271606054bf3f5409aff90e32b47cf7961eb45e4b6f","observation_id":"f56d3083-741f-4144-9ea0-3690e2db0251","resolution":{"observed_at":"2026-08-07T11:31:21.195953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.179209Z","title":"Independence Numbers of Random Subgraphs of Some Distance Graph","venue":null,"work_id":"f6299056-ba28-48b6-8433-304b5048ab47","year":2017},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.523444Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:80f741547465febf06e080c85113f9d13553d506cc27741aae2ec831ea955a46","observation_id":"38a9ad23-8ebe-4b9f-b013-05be05b6d204","resolution":{"observed_at":"2026-08-07T11:31:21.182957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.166110Z","title":"The largest hole in sparse random graphs","venue":null,"work_id":"660acdbf-bf41-4978-8600-5455f003f2cd","year":2022},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.596508Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:e2a7039e640c98c0112282127b107627139debd87b0bcd0683d7a8887536a57e","observation_id":"538ced12-7096-4fc8-825f-e6549b6c428a","resolution":{"observed_at":"2026-08-07T11:31:21.170328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.02800","last_updated":"2020-04-06T16:45:40Z","snapshot_observed_at":"2026-08-02T19:34:56.783738Z","submitted_at":"2020-04-06T16:45:40Z","title":"Large induced trees in dense random graphs","version":1},"cited_work":{"arxiv_id":"2004.02800","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.02800","snapshot_observed_at":"2026-08-07T11:31:20.955514Z","title":"Large induced trees in dense random graphs","venue":"math.CO","work_id":"6d0118a7-7030-4166-94f9-7781725d5350","year":2020},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.707478Z"},"links":{"cited_paper":"/paper/2004.02800","citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:a9ba5e938d00fd97339df2985b7bd71f5240f1e271c5a8a97188bdc5bf3e12ec","observation_id":"d6ad43af-1a67-4f33-a8a4-6242cc9beac5","resolution":{"observed_at":"2026-08-07T11:31:20.959886Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.152831Z","title":"On Induced Paths, Holes and Trees in Random Graphs","venue":null,"work_id":"e4d5a672-e07e-49e8-a58f-15a5df84e09a","year":2018},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.827516Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:c673f528c29207fd50c4ff90a32901faec4d37a892894a95ae8295f72c871c49","observation_id":"f1903309-e0f6-45a6-ad6c-ed7836d1013a","resolution":{"observed_at":"2026-08-07T11:31:21.156932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.139812Z","title":"Trees in random graphs","venue":null,"work_id":"17865437-209b-4fcb-b2da-8ee08be7463c","year":1983},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.845558Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:d9d5a7371ce84d591da437b6f1b6587789a2f44894167fa2165c42f5f353d3d1","observation_id":"993cfe85-91f7-4a5e-9f74-83cd83a0e0e2","resolution":{"observed_at":"2026-08-07T11:31:21.143650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.126212Z","title":"Induced trees in sparse random graphs","venue":null,"work_id":"a6dadce1-384b-40c9-ba74-d5efd962900e","year":1986},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.850240Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:6cc69aedb5a55267b59d106b4f56d65968bbecb8d854084eed1345791410be28","observation_id":"fcbcdafd-acc7-4f23-857f-976989c27824","resolution":{"observed_at":"2026-08-07T11:31:21.130631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.113569Z","title":"The largest induced tree in a sparse random graph","venue":null,"work_id":"466691bb-0e0d-45f0-a07a-2060c8baa72a","year":1996},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.854558Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:5fa7ace224be6c59b8ffeb0683a016ca4c276d985ff30493c4461c5b51f4d9e3","observation_id":"2d6f3238-7486-4fea-b1cf-559f71009988","resolution":{"observed_at":"2026-08-07T11:31:21.117331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.100340Z","title":"Large induced trees in sparse random graphs","venue":null,"work_id":"7a821ec0-1281-46a2-9f31-bd4395d631c9","year":1987},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.858918Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:7c1e3f3c2c948db53ef65be6a8626bb10f3c70519ffcadef1d57d9d6dd33a23f","observation_id":"dc0f2c25-25ca-48af-bf3f-68dff097319e","resolution":{"observed_at":"2026-08-07T11:31:21.104430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.086687Z","title":"Largest sparse subgraphs of random graphs","venue":null,"work_id":"ebffcf0e-8e4a-4334-9e36-9853b36c8bc4","year":2014},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.862775Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:1ca44414be6e6fbfdb4ce335250564a56203374f70911c4a510aae456b3c304d","observation_id":"5497f185-92c6-4691-bf05-45e2376d32ef","resolution":{"observed_at":"2026-08-07T11:31:21.091143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.09289","last_updated":"2021-02-18T12:06:15Z","snapshot_observed_at":"2026-07-06T10:42:28.724054Z","submitted_at":"2021-02-18T12:06:15Z","title":"Note on induced paths in sparse random graphs","version":1},"cited_work":{"arxiv_id":"2102.09289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.09289","snapshot_observed_at":"2026-08-07T11:31:20.932767Z","title":"Note on induced paths in sparse random graphs","venue":"math.CO","work_id":"d06cd2bf-d657-46a0-93d9-898d256b8f6b","year":2021},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.866763Z"},"links":{"cited_paper":"/paper/2102.09289","citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:27e9e1440033286693f0a2f07e10de0619f385b4db8261c50725cfad28eb0569","observation_id":"d3e1723c-c7c0-41c8-bf3b-22dc0b63cf13","resolution":{"observed_at":"2026-08-07T11:31:20.939792Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.073783Z","title":"Random Graphs","venue":null,"work_id":"5964316a-45a3-413c-a710-3ca3b25556ab","year":2000},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.871272Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:f67ee476ba6af2c8b894d75d82802775482e70518ef5878917f5dedd0e5fbda8","observation_id":"d2b13038-742b-4408-bc22-b71a7719bc5b","resolution":{"observed_at":"2026-08-07T11:31:21.077626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.060514Z","title":"Maximum sparse induced subgraphs of the binomial random graph with given number of edges","venue":null,"work_id":"3065dc24-3d7b-4b65-83cf-243868a9a583","year":2021},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.875121Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:ccf5b6053d8ce19ee24aaf27fc44a714530c1dec2a2e7d9dc802d44983f945ab","observation_id":"bb2ecfee-fa7c-4d4d-98d6-0a1d092ad2d5","resolution":{"observed_at":"2026-08-07T11:31:21.064534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.046944Z","title":"Maximum induced forests in random graphs","venue":null,"work_id":"3e5bc322-ae40-4a48-b7a2-20a9247c44c1","year":2021},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.879438Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:6a678468b088beda336565514bcf68b37840c60567f0009ef75030848c9d039a","observation_id":"5dac3cea-6669-4a84-aa0f-37a9504951b4","resolution":{"observed_at":"2026-08-07T11:31:21.050952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.033596Z","title":"On the probability of independent sets in random graphs","venue":null,"work_id":"5f035fb1-f17a-48a8-a2dc-4c4c8ab819e2","year":2003},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.883472Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:e898d4137c22bd3638a8deb92ce5273503a77b505d0518c49be4df329f1206bb","observation_id":"9295b8e5-298d-472d-9fc1-b9cb1feb8ecf","resolution":{"observed_at":"2026-08-07T11:31:21.037769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.018711Z","title":"The largest clique size in a random graph","venue":null,"work_id":"e81951ab-d9ab-4011-8945-08f3c21652c9","year":1976},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.887781Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:9eb47dfb065c7219ee71b629fdd0e4cfe23614e6852eb82c1e71fddfb95fb0af","observation_id":"3657d7dc-4b1d-4156-bea2-1f975783ea73","resolution":{"observed_at":"2026-08-07T11:31:21.023464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:21.005136Z","title":"Counting Labelled Trees","venue":null,"work_id":"faa00663-08c5-4e60-bf49-44d9e2549c51","year":1970},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.892365Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:cdf6489ce4efcc1ea517dca6f3d5f6fba8e354ee9c1fdf6e10d32dd357114779","observation_id":"f1c05d4f-3cfa-4461-8047-44c6bb08fa2c","resolution":{"observed_at":"2026-08-07T11:31:21.009233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:31:20.990074Z","title":"Random graphs: models and asymptotic characteris- tics","venue":null,"work_id":"5531100a-fe28-4ab6-b6a7-d216c355ad78","year":2015},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:20.896037Z"},"links":{"citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:881f461c9d3108f3339b34b39d3e03d5d23e8cc64be5b41ed5aa8bc6b7b30978","observation_id":"e9afe6a4-fb78-4340-8b91-b3803dc3febf","resolution":{"observed_at":"2026-08-07T11:31:20.994753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":23},"total_outbound_references":26},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2506.02801."}