{"as_of":"2026-08-10T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7446dcfe470fd08c3a961acca9f9c68a4a9905d28496f516a9821c51259b58f","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-07T15:42:22.743053Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:03:50.440849Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T13:03:50.759780Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"cited_work":{"arxiv_id":"2505.14623","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.14623","snapshot_observed_at":"2026-08-07T13:03:50.759780Z","title":"Non-isomorphic subgraphs in random graphs","venue":"math.CO","work_id":"1f49f8e7-b19c-42ab-a587-4c06e6142fb7","year":2025},"citing_paper":{"arxiv_id":"2505.23384","last_updated":"2025-05-29T12:06:32Z","snapshot_observed_at":"2026-08-07T12:44:30.766441Z","submitted_at":"2025-05-29T12:06:32Z","title":"A large hole in pseudo-random graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:03:50.440849Z"},"links":{"cited_paper":"/paper/2505.14623","citing_paper":"/paper/2505.23384"},"observation_digest":"sha256:61aa2c923369774788aa89bacedfcdf0ef9d6ead359e2cf8c9915b7c90001c68","observation_id":"6bef1412-5dc6-4b0f-92dd-d6a6d8b13a87","resolution":{"observed_at":"2026-08-07T13:03:50.838705Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14623/citation-record","integrity":"/paper/2505.14623/integrity","json":"/paper/2505.14623/citation-record.json","paper":"/paper/2505.14623"},"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-07T15:42:27.529819Z","title":null,"venue":null,"work_id":"141cc94c-7daa-43ac-ab87-8b68ab40aa57","year":1989},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.339595Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:f21ddfb24415e8e5ce33d166c82e03f2d26386d2b2c321825cd87a6cb0f5cf43","observation_id":"d229f845-f2a7-45e4-bd84-821951261f08","resolution":{"observed_at":"2026-08-07T15:42:27.624938Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:27.239467Z","title":null,"venue":null,"work_id":"39b35788-a152-4ece-8526-22c35b4f62c6","year":1991},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.515935Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:3829fb57b83dee74aa49ebf0f0e94a68c491addafc34190516072181f9d73e3f","observation_id":"3093cd4e-e063-4d36-be95-a7329929f6b3","resolution":{"observed_at":"2026-08-07T15:42:27.400267Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:26.916188Z","title":null,"venue":null,"work_id":"89824d58-fb2e-4e97-ae8a-ffa5b7d0c44c","year":2016},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.601378Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:ef64b073bb8e83f28d336cae0395093afa676ebe7b06baa90c41b6480a5807fc","observation_id":"752d87fc-636d-4436-b7d6-d031b50f83e7","resolution":{"observed_at":"2026-08-07T15:42:27.077073Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:26.499616Z","title":"Bollobás,Almost every graph has reconstruction number three, J","venue":null,"work_id":"1e2d2640-9f72-44d5-92ca-f9f5191039ec","year":1990},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.703257Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:92230984579fc2fde77ad66de564689339dfc9bdd6b274c795abd2c9a6d018f0","observation_id":"9d0ec394-c635-44f1-a448-9d8c05d1c826","resolution":{"observed_at":"2026-08-07T15:42:26.704460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:26.232187Z","title":"Bollobás,Random graphs, 2nd edition, Cambridge University Press, 2001","venue":null,"work_id":"03b49b87-6ccd-4663-8427-9056474a24d3","year":2001},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.792521Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:c73f8d1e176c35cbd1e2c0e90ba319e605554e4886d8b2e7c5701535c918d4ff","observation_id":"f836c03e-ac03-4d37-a379-f4c09de5e645","resolution":{"observed_at":"2026-08-07T15:42:26.331250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:26.101175Z","title":"Bollobas, P","venue":null,"work_id":"4428435b-2b8a-4f58-9dff-61ab9880eac5","year":1976},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.896819Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:605bc77cf58bcf649c50e375c5f6cd08d1238a3bdb464d66e33f0de4753dc1a1","observation_id":"54628027-f8db-4046-aeb7-7251a92621bd","resolution":{"observed_at":"2026-08-07T15:42:26.153437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.978296Z","title":"Bonnet, J","venue":null,"work_id":"64c550be-9ca4-4e19-bcc9-20653d358ff9","year":2024},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:20.986364Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:43a7fb617908844e9f2ce822d2bf5aea1b7fdab02d02a63539034ea1f3baffa2","observation_id":"92c61929-75e9-4385-9cde-3106b99a33dd","resolution":{"observed_at":"2026-08-07T15:42:26.036049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.843021Z","title":"Bordenave,A new proof of Friedman’s second eigenvalue theorem and its extension to random lifts, Annales Scientifiques de l’École Normale Supérieure53:6 (2020) 1393–1439","venue":null,"work_id":"359b4f16-fb06-46a2-aeeb-27e66718601e","year":2020},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.068902Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:a8d270a06e7858321c2ee7feb450bea129bc70defed86d19f4ed4984f1f70daf","observation_id":"ad4c2a8f-fbf1-4248-959b-39ae81dc6150","resolution":{"observed_at":"2026-08-07T15:42:25.899019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.701759Z","title":null,"venue":null,"work_id":"8e876d74-9ebd-4375-95f7-c0c9831bebd5","year":2014},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.170439Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:0c3882ef652347d1f687e7c4796a37d3049cddb8b5c1d2d8adc45b07cc2f607e","observation_id":"0e8d267f-1b34-4247-b582-f5a4587fb727","resolution":{"observed_at":"2026-08-07T15:42:25.770185Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.11130","last_updated":"2021-06-21T14:09:30Z","snapshot_observed_at":"2026-07-06T11:21:20.409208Z","submitted_at":"2021-06-21T14:09:30Z","title":"Long induced paths in a configuration model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.11130","snapshot_observed_at":"2026-08-07T15:42:21.283657Z","title":"Enriquez, G","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.283657Z"},"links":{"cited_paper":"/paper/2106.11130","citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:d19329f95ba894180a2e9d6bf90c695b0ca332791f225f2c1bc4339178562e09","observation_id":"d2459f14-a541-402e-8f94-5afb684c66cc","resolution":{"observed_at":"2026-08-07T15:42:21.283657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:42:25.564313Z","title":"Erdős, A","venue":null,"work_id":"577e7733-05cf-4402-9b97-8deaee109e7b","year":1989},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.413551Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:1a33cc6d5481a1a15beab3dd776f8715be689236917902212555aa15fa23f808","observation_id":"12344281-59a6-4d41-ac9c-2c297626471b","resolution":{"observed_at":"2026-08-07T15:42:25.615401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.432078Z","title":"Erdős, A","venue":null,"work_id":"39bf6780-3ffd-455c-a333-b16697fc8fa9","year":1960},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.520791Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:220327be0553c2ac6cb799d67ce6c36b490ec25047899626095a303c89a63c8d","observation_id":"c32309a9-6c99-4ac6-9453-61437e366969","resolution":{"observed_at":"2026-08-07T15:42:25.493655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.300691Z","title":"Friedman,A proof of Alon’s second eigenvalue conjecture and related problems, Memoirs of the American Mathematical Society,195:910 (2008) 100pp","venue":null,"work_id":"2d69b196-e233-4aa6-ab48-68e5c48e1934","year":2008},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.635122Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:1c0bd3cf1d1030c767b461e406a332c87dd78b04f5dd3333b7695d57b7b80933","observation_id":"de4345b1-d4e6-4c18-ba6d-2e5c8de15e10","resolution":{"observed_at":"2026-08-07T15:42:25.349994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.158005Z","title":null,"venue":null,"work_id":"867b2e04-df4b-4199-bed0-e76a46a4594a","year":1990},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.748829Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:13af3bca5b36177555d631e53b69fbd9087e1bd0fa6fd99123b3e29cea49a4ad","observation_id":"466dff15-1377-4518-a35d-98360e0bae94","resolution":{"observed_at":"2026-08-07T15:42:25.217128Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:25.013336Z","title":null,"venue":null,"work_id":"1f6b86a1-3242-4256-b168-5a10ec0319dc","year":1987},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.827765Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:36212f396b6b578ebfe86a222967f533fb7961fffba251b0f3fbda26ce1b2ae4","observation_id":"9948bb19-83c2-4eb3-8f0c-dfe2f459d251","resolution":{"observed_at":"2026-08-07T15:42:25.067269Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:24.868723Z","title":"Janson, T","venue":null,"work_id":"b7ac3d3c-5c0d-47ac-938d-a2ef7d2d5207","year":2000},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.905053Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:7f99823412c63815c1a802633db85b16b007737d83a5152325880efdf32b2dc5","observation_id":"4629dd2c-9458-4168-a23d-159c924e218b","resolution":{"observed_at":"2026-08-07T15:42:24.950712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:24.708869Z","title":null,"venue":null,"work_id":"cfaea103-03d6-4c38-bf1d-e0865360a287","year":1981},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:21.968122Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:b3273af20b1743ee792d90dd75b4860bfd187b8b31d53601c24d7bffbc4931f5","observation_id":"d1a77b1a-7dba-4b81-8921-2bbee3a3e0f9","resolution":{"observed_at":"2026-08-07T15:42:24.783595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:24.519059Z","title":"Müller,Probabilistic reconstruction from subgraphs, Commentationes Mathematicae Uni- versitatis Carolinae,17:4 (1976) 709–719","venue":null,"work_id":"8d34ba7a-bb15-41d4-9c13-e861dda8e524","year":1976},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.045860Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:86cd565cfd9eab0ac1796946cf5fc3eae97a672d998420027d6f202438c4317f","observation_id":"6c873f32-9fd3-4e86-92fd-f6b49142f9a3","resolution":{"observed_at":"2026-08-07T15:42:24.594462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:24.287894Z","title":"Nadarajah, K","venue":null,"work_id":"1abddc00-548d-482b-8c16-4459dff46f04","year":2002},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.168992Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:f516d43c77635111d7502e9032ed1362d519577bdf2cdea30e73dceacc626057","observation_id":"7852de85-43d5-4db1-a13c-7e370631356f","resolution":{"observed_at":"2026-08-07T15:42:24.438951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:24.123366Z","title":"Otter,The number of trees, Annals of Mathematics,2:49 (1948) 583–599","venue":null,"work_id":"7b9b4065-e396-488e-a23c-dab16b77cdc9","year":1948},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.246813Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:de17211a098c4271d549756a8e493189dda2bc1d068be8cb0ff2f266786b13a8","observation_id":"f9968e49-3692-4d0e-a6db-86b1971c2a3e","resolution":{"observed_at":"2026-08-07T15:42:24.192523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:23.930923Z","title":"Pittel,On trees census and the giant component in a sparse random graph, Random Structures & Algorithms,1(1990) 311–342","venue":null,"work_id":"f9f3a106-9ea5-4c30-b181-ad974eea6f45","year":1990},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.321556Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:89b97e7a04008a249cf209667fc71471292e2f63056e6a78df129efed246eebd","observation_id":"cd18d798-85d3-4e11-91c6-f30b8f4faa4a","resolution":{"observed_at":"2026-08-07T15:42:24.012917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:23.743532Z","title":"Puder,Expansion of random graphs: New proofs, new results, Inventiones Mathematicae, 201:3 (2015) 845–908","venue":null,"work_id":"69e777a7-df28-4a68-a93b-841e69b06618","year":2015},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.418427Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:72be479919ca23dcf3ed8f4ed9316bb8ea85a441434d498fe87a9a571b0f70a6","observation_id":"bd374e06-9715-42af-9284-2c44ae5ef36b","resolution":{"observed_at":"2026-08-07T15:42:23.827044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:23.552609Z","title":"Rodionov, M","venue":null,"work_id":"c411a8ac-e175-41dd-a5be-d0d8b3c97cf9","year":2023},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.511920Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:af8f50724edcf06910d3a1f34d322b776c6c19520713f5bd1608aa21629b1176","observation_id":"f497c6a0-cd8b-4986-95f1-5cba5b8e5d13","resolution":{"observed_at":"2026-08-07T15:42:23.636956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:23.352110Z","title":null,"venue":null,"work_id":"b8ef87de-305f-4d2d-898f-2ae99cb69bec","year":1957},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.585917Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:511f732e9c1aded48e0fdc948474c08b2e6e91dc61410a72bd6ccedcc926efe4","observation_id":"9fa62c76-2929-4c5d-8150-9a54272643fa","resolution":{"observed_at":"2026-08-07T15:42:23.425618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:23.157507Z","title":"Shelah,Erdős and Rényi conjecture, Journal of Combinatorial Theory, Ser A,82(1998) 179–185","venue":null,"work_id":"c321149b-cfc9-4160-9299-3922a67c5c4d","year":1998},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.660999Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:0e99bc1c5d3a7956fb8392cdd00ecc81004464bc4294b9f05c9e4947379414a3","observation_id":"0194c459-8cf8-4269-bd74-9b8f0d9a32fd","resolution":{"observed_at":"2026-08-07T15:42:23.213165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:42:22.928905Z","title":"Verbitsky, M","venue":null,"work_id":"e408d5e6-e035-4fbe-8b47-eeb92bdfeea9","year":2025},"citing_paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:22.743053Z"},"links":{"citing_paper":"/paper/2505.14623"},"observation_digest":"sha256:21b8e193f948d3d9dfb7dd1bd1869f6a63a456e1e7ce5267145983a2ec6dc1be","observation_id":"86db79a3-a535-4131-9ec8-660a0b02a556","resolution":{"observed_at":"2026-08-07T15:42:23.015003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14623","last_updated":"2025-05-20T17:14:16Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-09T17:44:06.667629Z","submitted_at":"2025-05-20T17:14:16Z","title":"Non-isomorphic subgraphs in random graphs"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":17},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2505.14623."}