{"as_of":"2026-08-08T04:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a37ad9db89785d185cd06fc2ce0cb47be314f863fddb69abbf94e646625f509f","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T23:58:35.733203Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2406.06380/citation-record","integrity":"/paper/2406.06380/integrity","json":"/paper/2406.06380/citation-record.json","paper":"/paper/2406.06380"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Aldous and V","venue":null,"work_id":"b6366b6d-a2f4-4958-b1c0-25c983689c60","year":1998},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:193215a93bd23a0e8a9d678d85d6a39c55c136b837acf767d3e6b003b07cbd5e","observation_id":"481b7247-32be-4f99-b513-e0b3d333c3ca","resolution":{"observed_at":"2026-05-23T23:58:39.679873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann","venue":null,"work_id":"a79425a4-034c-4573-9681-b4abc1205404","year":1997},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:819a5ca0826f2eaa4f69d64b6ba519b3e349f04732899e69f2b368936bec7690","observation_id":"8764ddfa-5d0d-4031-b56d-2156491db077","resolution":{"observed_at":"2026-05-23T23:58:39.675854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Billingsley, Convergence of probability measures, New York - London - Sydney - Toronto : John Wiley and Sons , Inc","venue":null,"work_id":"d62a72ed-b0b0-46bf-8224-a08dbf8f22ad","year":1968},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:21833ece8608fd03a99c24e98d23731070431f11b8be7f0d09f5d58622487f51","observation_id":"fcb09d92-067b-4dac-b35a-fa6c4bc5e2ad","resolution":{"observed_at":"2026-05-23T23:58:39.670963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"ed., Wiley Ser","venue":null,"work_id":"f2512526-20bf-49a6-bacb-39c977e08e43","year":1999},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:c2c444aebc5d03c4801d34bc8c292ee153717f533ca5f36672543f1f8f40c467","observation_id":"24e7d1a3-54da-4136-916b-2c857931f868","resolution":{"observed_at":"2026-05-23T23:58:39.666993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04716","last_updated":"2026-07-09T12:26:14Z","snapshot_observed_at":"2026-08-05T03:21:02.623665Z","submitted_at":"2023-05-08T14:02:06Z","title":"A dynamical approach to spanning and surplus edges of random graphs","version":3},"cited_work":{"arxiv_id":"2305.04716","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04716","snapshot_observed_at":"2026-07-10T01:19:36.643126Z","title":null,"venue":null,"work_id":"0a0edc45-fb7a-4dd9-8fa4-b1a90abb0163","year":2023},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"cited_paper":"/paper/2305.04716","citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:119e6a596341115604ba645687d6c1c8f3dddabd75c0c0fea225c8a9f7847e07","observation_id":"074bb0d5-2efa-40c8-882e-1f8fb20616a4","resolution":{"observed_at":"2026-07-10T01:19:36.643126Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Del Moral and S","venue":null,"work_id":"6e97c3dc-b3e3-4645-83b1-0dfda982383f","year":2017},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:88ef5827e344872e706d5f46b6cfa79f6b980b83216802bf4ea4cc90b3c672e2","observation_id":"d6c93d7b-0e32-43db-bb91-c96c509c0b02","resolution":{"observed_at":"2026-05-23T23:58:39.663376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07701","last_updated":"2024-01-12T18:54:18Z","snapshot_observed_at":"2026-07-06T16:47:01.374736Z","submitted_at":"2023-11-13T19:38:46Z","title":"The process of fluctuations of the giant component of an Erd\\H{o}s-R\\'enyi graph","version":2},"cited_work":{"arxiv_id":"2311.07701","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.07701","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"306293b5-a5ec-4fda-a58d-dba95024c678","year":2023},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"cited_paper":"/paper/2311.07701","citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:36f83a117c119b979c7bc0a1ba99a3858d7d9b2eff4d659c9910d8265aa679ab","observation_id":"faa3e844-86fc-45b7-847a-4aca605b39d3","resolution":{"observed_at":"2026-05-23T23:58:38.205123Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"780da447-67d9-404c-a666-4c0af5c4b37f","year":1986},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:7b796f6aad73a87d168cd7d16cb8bfa361f00b157204a3edddd92e4079e3e202","observation_id":"0806aa79-7568-4d3a-8ef6-6561fbec3c84","resolution":{"observed_at":"2026-05-23T23:58:39.659725Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Erd o s and A","venue":null,"work_id":"1c7467b2-79d3-434f-88c9-ee1dea4d2f77","year":1960},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:29a177188bccb4acb1b639e9603e1089d475a00fe26b279654d2950fa7d30ce8","observation_id":"87bebbdd-8b88-4953-8d16-55765ddbbdd0","resolution":{"observed_at":"2026-05-23T23:58:39.655966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.11799","last_updated":"2022-01-19T11:21:48Z","snapshot_observed_at":"2026-08-03T19:28:17.135604Z","submitted_at":"2021-08-26T14:02:23Z","title":"On Moments of Multiplicative Coalescents","version":2},"cited_work":{"arxiv_id":"2108.11799","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2108.11799","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Konarovskyi and V","venue":null,"work_id":"f91acf05-8a46-4e06-a7e8-e2141f980d41","year":2021},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"cited_paper":"/paper/2108.11799","citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:795292488b8db0687136fca8bde69054f7ad0b3b482530010d2c78c1414b49e1","observation_id":"5fbbf2b5-46b5-4379-a8b6-bfd4be6ed4b7","resolution":{"observed_at":"2026-05-23T23:58:38.197714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Limic, Properties of the multiplicative coalescent, Ph.D","venue":null,"work_id":"285c3bd9-3da7-4f24-8ee3-3b2f6ec016fd","year":1998},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:e872960fc66a340795fad06de3557b51f0be38497a5b801d79490e4c8695defe","observation_id":"1cef18c5-a4f1-485d-8cad-07a64883b2e7","resolution":{"observed_at":"2026-05-23T23:58:39.652338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Limic, The eternal multiplicative coalescent encoding via excursions of L \\'e vy -type processes , Bernoulli 25 (2019), no","venue":null,"work_id":"5dc23335-afce-4d8f-8550-800d02fd8543","year":2019},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:74c5fcfd4aade559d7474f2621b4b8e23bceb55877f89179c8e88fe768c407b3","observation_id":"90548998-9f41-40c5-8675-deca12d86efe","resolution":{"observed_at":"2026-05-23T23:58:39.641155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Norros and H","venue":null,"work_id":"6d2837ac-a0c5-4e54-9b71-c5e03367fd44","year":2006},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:adc1805898c2be5a3c944702ae2a34877ce4b45b28e49a97f4fe97dcd23850b6","observation_id":"ab19af1a-84e5-4ddc-ba02-2f9bce1a368c","resolution":{"observed_at":"2026-05-23T23:58:39.636308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b0848966-00f1-4a6b-b5ed-f6c0d7c83eb9","year":2005},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:a291e9d02f65ce9172fd9cfb0c0b28d21f9dcbdafbec3a994c326badafe9bb8d","observation_id":"b96a0491-634b-41e0-b74e-2a09110a130a","resolution":{"observed_at":"2026-05-23T23:58:39.630766Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a68316d5-b59d-440c-a911-9a7833c59af5","year":1956},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:8507bf5a1ec5c3b1c9207e5f08a823e00c82d3db2f27cc1e8c0892b7e4c67478","observation_id":"afc82dfc-3022-46c0-8794-05e4c5b05714","resolution":{"observed_at":"2026-05-23T23:58:39.687444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"van der Hofstad, Random graphs and complex networks","venue":null,"work_id":"148bc0fa-f856-4575-9320-30c92fdf8234","year":2017},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:3f37a9d78e7c181a25c5417722eb34325f1161b890fd907786e90b04006ba3ce","observation_id":"a50901b9-2d46-4ab6-8a83-c3c57fc1c147","resolution":{"observed_at":"2026-05-23T23:58:39.647916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Whitt, Proofs of the martingale FCLT , Probability Surveys 4 (2007), no","venue":null,"work_id":"4a139810-0223-4aba-8a32-435485d4d435","year":2007},"citing_paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-23T23:58:35.733203Z"},"links":{"citing_paper":"/paper/2406.06380"},"observation_digest":"sha256:ac611809e2848f7c7ad400ea3cc3a244e4023a65e2cb9b2d8ee8696c9903345d","observation_id":"2acb87df-aabb-4bbb-bc46-4836613b4742","resolution":{"observed_at":"2026-05-23T23:58:39.684092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2406.06380","last_updated":"2026-05-16T09:23:21Z","latest_version":2,"primary_category":"math.PR","snapshot_observed_at":"2026-08-02T07:48:02.116273Z","submitted_at":"2024-06-10T15:40:25Z","title":"The number of connected components in sub-critical random graph processes"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":11},"total_outbound_references":17},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2406.06380."}