{"as_of":"2026-08-19T03:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93b6aef814ef5f1d809dd6ff9b4194109ff1b1ccdf66df941942021773635384","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:38:52.763493Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2608.06358/citation-record","integrity":"/paper/2608.06358/integrity","json":"/paper/2608.06358/citation-record.json","paper":"/paper/2608.06358"},"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-07T04:39:10.336332Z","title":"Ajtai, J","venue":null,"work_id":"f58e0384-e6d0-4a9d-8adc-b28f86be0b48","year":1983},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.069851Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:7563c840ad8ec6c9d10ca8fa1d4f90550189402dda94a834ecd72d980b860ee0","observation_id":"8765c925-2ba8-47b7-abdb-bfb06c41a4dc","resolution":{"observed_at":"2026-08-07T04:39:10.465843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:10.069542Z","title":"Ajtai, J","venue":null,"work_id":"dc86d030-cdf0-44fa-99cc-e1452fea6101","year":1985},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.132256Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:f5a6f6f60f448f7744df6c4c90ebd52eb3e5e13f867f4eb23b1036f59c302361","observation_id":"c57d429e-93eb-4b58-8210-f170a3ca4fff","resolution":{"observed_at":"2026-08-07T04:39:10.190197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:09.885991Z","title":null,"venue":null,"work_id":"0e2255c6-94f6-4058-b488-85436d857fe4","year":2010},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.241715Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:4ca192018cdf3367115c9203285cb8490212e06477ec8cd156687914dbccbf4a","observation_id":"ee8ccfb6-16d4-4a6c-82cf-200b6dbf5af4","resolution":{"observed_at":"2026-08-07T04:39:09.982271Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:09.637979Z","title":null,"venue":null,"work_id":"db917bf4-c5e3-417c-bf64-8b77a22fd3e2","year":2023},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.368531Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:cbc11868e70b9cb085be234a4fbddb95756af5fea309e5f88a6013cc1624a7c6","observation_id":"dd0f3b36-b76a-412e-a82a-585f68b019e0","resolution":{"observed_at":"2026-08-07T04:39:09.724995Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.01138","last_updated":"2025-07-31T20:47:00Z","snapshot_observed_at":"2026-08-07T15:40:44.460094Z","submitted_at":"2025-07-01T18:56:07Z","title":"Sums along the edges of bounded degree graphs","version":2},"cited_work":{"arxiv_id":"2507.01138","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.01138","snapshot_observed_at":"2026-08-07T04:38:54.310727Z","title":"Sums along the edges of bounded degree graphs","venue":"math.CO","work_id":"3cbe4d69-4503-4ab4-909e-a54d80aaee62","year":2025},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.501998Z"},"links":{"cited_paper":"/paper/2507.01138","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:d48b4d4bda7d9cb0a000bde51e1c27e3338374c8672fe17c9c9d452cbb84a570","observation_id":"bb8cdc5c-39b6-465b-b71b-57de2b10ec39","resolution":{"observed_at":"2026-08-07T04:38:54.415307Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:09.349333Z","title":null,"venue":null,"work_id":"237ac370-651c-426b-9ddb-063df5c93ff4","year":2009},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.660256Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:161d77dc141f9d96e4ab37f43dad2f92020fb977015726620b281f636373db99","observation_id":"1c52cd8a-ff85-478c-9a01-43001edeb15f","resolution":{"observed_at":"2026-08-07T04:39:09.505816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:09.138697Z","title":"Alon and M","venue":null,"work_id":"7a4fb16c-4264-455d-95c3-49883788e687","year":2007},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.784400Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:0690b21dbb6a09b35c692479f1b7272ff89812022166d8636f850e97f2ce3841","observation_id":"901abf18-7d68-475b-85dd-d003c770847b","resolution":{"observed_at":"2026-08-07T04:39:09.218470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:08.870405Z","title":null,"venue":null,"work_id":"3d53c487-7385-4a30-ae27-d376825a47ab","year":2007},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:43.892954Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:0e6fb7eb7d605327ed0592b942298658269ab118ec8d83dc155d61075a9e2a85","observation_id":"31753a88-8fe9-4ce5-8006-d4c1ad9b4e8a","resolution":{"observed_at":"2026-08-07T04:39:08.980344Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:08.630260Z","title":"Alon and J","venue":null,"work_id":"c1d52969-c8c0-45b9-9fea-f11d44a3ab53","year":2000},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.013811Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:7f01f96dae6ee3a56c8c5c5ea54366c4ed872ae00d9f4c420099a26c62625ab7","observation_id":"5c2e8090-1a60-4c70-89e2-3fb7e26b31ed","resolution":{"observed_at":"2026-08-07T04:39:08.739154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:08.435766Z","title":"Alon and R","venue":null,"work_id":"e0838df6-c5dc-407e-bbd0-17269b5d82ca","year":1993},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.205988Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:c0f742cc99a0cf392e81443f4a3beaa8bc48cb2fe7fe2297a5949ef461a3c42c","observation_id":"0c5ca2ab-2eff-491d-9f1e-b6e5ecc6f267","resolution":{"observed_at":"2026-08-07T04:39:08.522421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:08.129941Z","title":"Alstrup, S","venue":null,"work_id":"2269937c-63ab-4272-ba34-ea331c943725","year":2017},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.352410Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:8ba87ac69bfd9e3d090e02d97f61eb00c39b82f8dc64b2f0d389f6134f878b1b","observation_id":"0ecad63b-2970-498e-9cb4-e801727db1d9","resolution":{"observed_at":"2026-08-07T04:39:08.295531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16818","last_updated":"2025-05-22T15:54:17Z","snapshot_observed_at":"2026-08-15T06:53:11.144198Z","submitted_at":"2025-05-22T15:54:17Z","title":"Spanning trees of bounded degree in random geometric graphs","version":1},"cited_work":{"arxiv_id":"2505.16818","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.16818","snapshot_observed_at":"2026-08-07T04:38:54.048442Z","title":"Spanning trees of bounded degree in random geometric graphs","venue":"math.CO","work_id":"9672d0ee-75b3-4853-80f7-023016a24940","year":2025},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.482602Z"},"links":{"cited_paper":"/paper/2505.16818","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:05a94b818b6ab03a725916236ad380c00d28f1b4fb49b4835985e919664738c5","observation_id":"fdc9e3c7-5520-45f1-9e8f-bade50291a01","resolution":{"observed_at":"2026-08-07T04:38:54.196295Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:07.779384Z","title":"Balogh, B","venue":null,"work_id":"caee183f-6610-4b01-bc8b-96fbae5e780e","year":2010},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.606571Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:0624e54b38da59a3e664a11b8d632b8123c3032cc0e4ca4014eb3077b3a899d5","observation_id":"0b845389-0413-4ec3-8d58-5cf3f1625740","resolution":{"observed_at":"2026-08-07T04:39:07.990485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03691","last_updated":"2023-05-05T17:29:40Z","snapshot_observed_at":"2026-08-16T16:26:03.534446Z","submitted_at":"2022-10-07T16:52:34Z","title":"The Park-Pham Theorem with Optimal Convergence Rate","version":2},"cited_work":{"arxiv_id":"2210.03691","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.03691","snapshot_observed_at":"2026-08-07T04:38:53.725965Z","title":"The Park-Pham Theorem with Optimal Convergence Rate","venue":"math.CO","work_id":"91878a4e-3c7e-41f1-88fc-7dbb52ac8fd3","year":2022},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.765727Z"},"links":{"cited_paper":"/paper/2210.03691","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:a3b803696d64d7c55b8f5de5f05a9e47a65628270c9c53c5193388556fb5cd59","observation_id":"62269bf7-5dd6-4b24-871f-ebb68f8809f8","resolution":{"observed_at":"2026-08-07T04:38:53.888284Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:07.441843Z","title":null,"venue":null,"work_id":"aea33e5e-0af6-499f-8fa0-cdaa543d1391","year":1989},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:44.901111Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:4239de83456885c343fc2f09a0180e8825df53b23d36fdcc055f41426ab71b39","observation_id":"a7a3ccb1-f314-410d-abdb-541c4c9f836c","resolution":{"observed_at":"2026-08-07T04:39:07.609562Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:07.189118Z","title":null,"venue":null,"work_id":"96f96047-daa7-4d96-af87-a93bae8dc78e","year":1984},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.054200Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:0fdbbaec98bcb4266ddb9cf6b49622f69e056e57cb20d713d31a6c68c4586a3f","observation_id":"f4d3b256-b618-48bb-bd13-d464cb68edc4","resolution":{"observed_at":"2026-08-07T04:39:07.299901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:06.878026Z","title":"Bollobás","venue":null,"work_id":"b56eb7ea-25d1-49c3-ae37-304a6eaae875","year":1984},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.255175Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:2b9e32eb7346ce6219468a2948ec2efabb8673438928fe6e85e974f5c035ec5e","observation_id":"adbcbe6c-75b9-4235-a30b-c9622778e428","resolution":{"observed_at":"2026-08-07T04:39:07.048640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:06.581175Z","title":"Bollobás.Modern graph theory, volume 184","venue":null,"work_id":"f8e05092-36f6-43e7-8f4a-5067fb00b01e","year":1998},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.392531Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:b86816e5a2a810416ffe6768953bfe4244c53335dd91fbe8ae1c186ed657aae9","observation_id":"2117362a-b61f-4645-9f9e-fa96241c5e58","resolution":{"observed_at":"2026-08-07T04:39:06.764246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:06.261679Z","title":"Bonnet, J","venue":null,"work_id":"a306e987-1a62-4154-a7bb-9ba7bb0b0a17","year":2024},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.560201Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:32b352fc88addfae3743873b27328cfd79b4ec2e9c9b2b3e6d17c2ccbd9e96be","observation_id":"d798eb26-414d-411c-9ddf-0acec6a1bc4b","resolution":{"observed_at":"2026-08-07T04:39:06.426748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:06.010013Z","title":"Böttcher, J","venue":null,"work_id":"a3243a3b-c532-4680-8f74-61e692b108ba","year":2019},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.688840Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:dd34e3460a590ffa2e21156653249992553976a9e4ae5063dfad26a3b07c0f9d","observation_id":"1295e523-a375-43e2-9832-92e9dd81d667","resolution":{"observed_at":"2026-08-07T04:39:06.141353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14138","last_updated":"2025-08-12T14:06:15Z","snapshot_observed_at":"2026-08-16T22:38:13.616981Z","submitted_at":"2024-11-21T14:02:22Z","title":"Sharp Thresholds for Factors in Random Graphs","version":2},"cited_work":{"arxiv_id":"2411.14138","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.14138","snapshot_observed_at":"2026-08-07T04:38:53.523863Z","title":"Sharp Thresholds for Factors in Random Graphs","venue":"math.CO","work_id":"8526fc77-4550-4732-91e4-81c82716abbd","year":2024},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.830516Z"},"links":{"cited_paper":"/paper/2411.14138","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:9965a8e200841ff92789fbac09e0bee0e3373dbba07aca02edbbc444eb3e070a","observation_id":"41157b6a-4f76-48e7-b930-d883534d6ba5","resolution":{"observed_at":"2026-08-07T04:38:53.597029Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:05.769441Z","title":"Capalbo and S","venue":null,"work_id":"7ec6dc2f-0398-4f5e-8b62-1079ec9053d8","year":1999},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:45.939684Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:877cebc050ff34bd04a753ad20f4ca0135c3b8af8693062611492f471d76b725","observation_id":"46e58af5-dc7e-4008-90c4-5c4b02c011ec","resolution":{"observed_at":"2026-08-07T04:39:05.895408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:05.495583Z","title":null,"venue":null,"work_id":"3b8a9297-4f9b-4f6f-a31f-9f09708839a1","year":1999},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.139300Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:ef46dd3f61c4ef31169d146349b2b037691b6df55a59b44b32abc5732e8676c4","observation_id":"59269811-242e-4e1a-b9a9-c5f3e3bf3cd9","resolution":{"observed_at":"2026-08-07T04:39:05.639159Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:05.268326Z","title":"Chung and R","venue":null,"work_id":"847c8019-9885-49f9-b7ff-eb4571a07883","year":1998},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.256432Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:b207724433e4881553cc7ad9508ced2fe56ad87c6ae76c87036723b43fc8cfd3","observation_id":"67415793-b458-483d-a526-3adb7f2990b9","resolution":{"observed_at":"2026-08-07T04:39:05.355427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:05.060425Z","title":null,"venue":null,"work_id":"6a568cb9-0b1a-40fd-ae29-cc9f17e2762b","year":1978},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.376482Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:f49dc2ed7c023087c3d5c8cb2a846a2f34f74220a310d985a87d386a78a6d81f","observation_id":"e81dd297-47d8-4c54-855b-8fd5d648af2b","resolution":{"observed_at":"2026-08-07T04:39:05.192619Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:04.803104Z","title":null,"venue":null,"work_id":"fc33e271-5206-4725-9fd2-0946c6dab384","year":1979},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.524597Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:a90f1a707e332db43cd9275ab91f932c469816705ac4a7db01f9bd9395da55fb","observation_id":"8a8e9233-d792-43ff-a81d-00d836db19d6","resolution":{"observed_at":"2026-08-07T04:39:04.907109Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:04.558431Z","title":null,"venue":null,"work_id":"2d6b9176-023e-4c58-8592-8dbbcdb1edc4","year":1983},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.625258Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:96aa73f7f4e545ea8dfc992e9dbebde5604b3e5768ff529a801c3046abbfcfa6","observation_id":"7e7b4c90-7180-43ab-9449-c845bc03e453","resolution":{"observed_at":"2026-08-07T04:39:04.647742Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:04.356396Z","title":null,"venue":null,"work_id":"105a62f6-0395-4379-8a55-ca751b3d83f0","year":1983},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.786310Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:45bd7482b9bfc848fd52d33ceea6a29e1ebbc215532d4931bebac0e66800229b","observation_id":"04210f30-3d20-4ec9-a019-2f961b060da4","resolution":{"observed_at":"2026-08-07T04:39:04.465406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:04.099033Z","title":"Delcourt, T","venue":null,"work_id":"5df029bd-20f6-488b-8381-ede09d327c12","year":2026},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:46.916787Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:041341a6abf0f2cefa23bb48fe32e12db46c218347572e4e43fd48efe530e394","observation_id":"73393a26-74e9-494b-a80d-7c0f92840b73","resolution":{"observed_at":"2026-08-07T04:39:04.248322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:03.897645Z","title":"Dellamonica, Jr","venue":null,"work_id":"d7311a16-27ae-45c1-a732-40e6a11936f8","year":2008},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.015630Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:bd198d5b1138fa06201772000b128d87f39aac949213fe56ffa505af1d61c5ac","observation_id":"e83a7628-12d1-49c8-8508-906568f17ac1","resolution":{"observed_at":"2026-08-07T04:39:03.984167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:03.690485Z","title":"Dellamonica, Jr., Y","venue":null,"work_id":"9e65d3cc-8e91-4e4e-b320-45ef80635440","year":2008},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.192206Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:5c0690a11627aaec3f30961b3623b0f2569e8cb5629de3f1554d4ece44bf982e","observation_id":"22c76168-50da-4f03-9e48-8feaf639bbff","resolution":{"observed_at":"2026-08-07T04:39:03.756635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:03.400253Z","title":"Dellamonica, Jr., Y","venue":null,"work_id":"37a07dad-b49e-42b0-8151-5104b49a1eef","year":2015},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.303001Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:4f907ac47000e3b5a3fb2c7ea9365441b7fe5d52c0ca8c85851f19de99e67bba","observation_id":"d6ac6ab4-e712-479b-a870-ccf6b95a08c7","resolution":{"observed_at":"2026-08-07T04:39:03.523406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:03.125087Z","title":null,"venue":null,"work_id":"0caf87ed-184d-4d25-98bc-b05954803a08","year":2023},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.412730Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:a51306a5e85ec6d5c7d02dfb26e7f27602f390937234c8fd012e063a5dc93e54","observation_id":"61b871a2-0b50-4b6e-9ad6-d4d72a9bfd24","resolution":{"observed_at":"2026-08-07T04:39:03.260650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:02.900776Z","title":"Draganić, M","venue":null,"work_id":"7329cd14-78cb-4571-904a-350dfea8346e","year":2022},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.514286Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:59f85a2ecc1e80ac16bb0a3b4cfcd8cf5e88cc563c2dea9d3bc3cf8ca17af013","observation_id":"9efd53d8-3612-412f-bfbe-4c7a9fafc31a","resolution":{"observed_at":"2026-08-07T04:39:03.017710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06603","last_updated":"2024-04-14T09:20:38Z","snapshot_observed_at":"2026-08-16T14:19:47.893781Z","submitted_at":"2024-02-09T18:29:38Z","title":"Hamiltonicity of expanders: optimal bounds and applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.06603","snapshot_observed_at":"2026-08-07T04:38:47.630851Z","title":"Draganić, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.630851Z"},"links":{"cited_paper":"/paper/2402.06603","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:26e3242808614468f710df36002b4252365016b45c07743852ae8c0e0218d79e","observation_id":"ce4b822c-0ceb-4b89-8939-7b6e49652992","resolution":{"observed_at":"2026-08-07T04:38:47.630851Z","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-07T04:39:02.613238Z","title":"Erdős and A","venue":null,"work_id":"0ec306a6-e176-4ac5-a65b-ec2900e3325d","year":1960},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.762696Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:1c01c26457df8102dfc30009cf9fb82c2be644e64347fe952d42a38edfed8f5a","observation_id":"b4ec41c6-db01-401d-b824-37c2639c493e","resolution":{"observed_at":"2026-08-07T04:39:02.765331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:02.363837Z","title":"Ferber, G","venue":null,"work_id":"ac11aeed-0a60-410d-9df2-461808da0c28","year":2019},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.869265Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:7d0694d7d0c36cd55f95b9c207268b3b4837f0ad269f80704200f589e9905dea","observation_id":"73d27b57-53b2-4e56-85ba-bafbfd9109ad","resolution":{"observed_at":"2026-08-07T04:39:02.505272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:02.169213Z","title":"Spanninguniversalityinrandomgraphs.Random Struct Alg, 53:604–637, 2018","venue":null,"work_id":"3566b30b-f855-4ab3-b684-f4a249c9e885","year":2018},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:47.993300Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:f7e7618f90c3266b4873a3228bc350ed9e5b28526577a9814ce48f5b83689ee2","observation_id":"b80feaff-3010-4256-97ec-d755cd415ff0","resolution":{"observed_at":"2026-08-07T04:39:02.265357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:01.930604Z","title":"Ferber, R","venue":null,"work_id":"3dcbd7c3-ac65-4ba6-a413-36b672d5340f","year":2016},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.092297Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:bc7bddbe045647790f8d87af8297ca66ad587f65d13c2a20a10e00c590257aa7","observation_id":"5d89653e-d330-4d4f-a9d1-b9d1c3e82866","resolution":{"observed_at":"2026-08-07T04:39:02.067238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:01.669864Z","title":"Frankston, J","venue":null,"work_id":"9caafc65-90a2-4529-a5a4-c2d33061bd90","year":2021},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.220790Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:1feb18ae8aeb58af667e3cfea4d19c0f2bf3b0fee09dc4d1be53467ac2cc754d","observation_id":"863007c1-4cb1-4fdd-a02b-85b40addcb81","resolution":{"observed_at":"2026-08-07T04:39:01.791018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:01.432857Z","title":"Friedgut","venue":null,"work_id":"c6964bef-0145-4ad9-8190-9fcc2aa0d68c","year":1999},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.358477Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:722d72bf79cede5230e93b19d5b6f99ce1ae4720b88aaa1781997b744e68a87a","observation_id":"daee9955-dfc4-4602-a6c3-08dbcedd707d","resolution":{"observed_at":"2026-08-07T04:39:01.519651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:38:48.506756Z","title":"Friedman and N","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.506756Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:03805ed508fb0c85738a4495c2a1bdf3b3cde1c79807f0a00970c738059ac906","observation_id":"dd3ffdb0-97d8-4d86-a900-d3ecd59b8fce","resolution":{"observed_at":"2026-08-07T04:38:48.506756Z","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-07T04:39:01.155406Z","title":"Glebov.On Hamilton cycles and other spanning structures","venue":null,"work_id":"ca070b58-0314-4797-b019-34c1c52925db","year":2013},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.640012Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:e39f1b17a19e7082a6c8847fb22dba07ce41e29a0362aebf7ba94b33723e8184","observation_id":"b3e469ed-216f-498d-a3e4-10fc3568fce6","resolution":{"observed_at":"2026-08-07T04:39:01.286493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:00.942472Z","title":"Glebov, D","venue":null,"work_id":"4050caa3-1f30-452d-9fcc-2632f8e5d11e","year":null},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.732304Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:49aea2d567edcd16346e18f87f4a17a9eb8b52709eb0ff5aa20d150656db48d2","observation_id":"aaa524d3-2fb6-429f-bf26-1c74227e2206","resolution":{"observed_at":"2026-08-07T04:39:01.031250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:00.743991Z","title":null,"venue":null,"work_id":"f49f68f3-20a7-4d48-9fea-9743bc206d1c","year":2001},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.830232Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:cd21e75d6bd11e3149794ae7f9a5b4ae27a540c6cafc913836cabc31e74a4b44","observation_id":"70c37663-2953-4f95-972e-b2425897e578","resolution":{"observed_at":"2026-08-07T04:39:00.833013Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:00.424518Z","title":null,"venue":null,"work_id":"d1340aee-1cb5-4920-b606-1d3ef323933a","year":2021},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:48.946966Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:ba3a9425b1957ddcad64589e11c9f0000fa293f50c515b97714b4c393631c6b7","observation_id":"1463ea28-977b-42da-b627-3a1c9b3d464a","resolution":{"observed_at":"2026-08-07T04:39:00.594773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:39:00.179497Z","title":"Heckel, M","venue":null,"work_id":"b9c9bb1a-09a9-4bc6-9f13-b303ba45904f","year":2024},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.113662Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:18ddbe97739aa192a9db02f65e3ceb8139452d046e18c6d417b81b5a42d994e3","observation_id":"aa227488-2f1f-4e74-a971-aa1c0f55c978","resolution":{"observed_at":"2026-08-07T04:39:00.301413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:59.868814Z","title":"Hefetz, M","venue":null,"work_id":"cf72f128-bb10-4eb6-b3a9-1be59732afc6","year":2012},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.224956Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:d6693b8ed80345f461099c73233b9af23ce5c8f744dc19a594da0110c0453022","observation_id":"0d1e858a-e256-40ea-9547-f90f31ac40cd","resolution":{"observed_at":"2026-08-07T04:39:00.029111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:59.606915Z","title":null,"venue":null,"work_id":"b7047640-c99c-4c47-8c4f-77c587adafa6","year":2025},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.324026Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:5bfa66f9cb073970993b078dda5a52a7395bc7846046237cfa3ac8f15ea0cd36","observation_id":"d35a79ce-1a66-4a13-bcc0-53c1877e771a","resolution":{"observed_at":"2026-08-07T04:38:59.692714Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:59.379945Z","title":"Jain and H","venue":null,"work_id":"b735cf3a-73aa-428a-a86c-b02948ea8f78","year":2024},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.443367Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:2212dbaadf669dc42479c1bd6b3b8d2e65d18db85405403c807203d970e5c099","observation_id":"25404605-a2a2-4f81-a7ce-4fb18b1400cf","resolution":{"observed_at":"2026-08-07T04:38:59.506748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:38:49.519894Z","title":"Janson, T","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.519894Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:77e8bdb29827caba384d7a2cdd33fa002d355299ba9368fdcc59efe286e603ab","observation_id":"6084096c-9f2a-48db-9f1e-fe61b12614c5","resolution":{"observed_at":"2026-08-07T04:38:49.519894Z","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-07T04:38:59.132655Z","title":"Johannsen, M","venue":null,"work_id":"d75d5e4a-51c0-43e6-a991-f3a0209d79fb","year":2013},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.629460Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:761cbd107be8d566d4b27ec3a99102251320b96c975a5614036d767f44d40180","observation_id":"20be8728-7d66-4b4e-a206-fbad5d3a3016","resolution":{"observed_at":"2026-08-07T04:38:59.257058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:58.947194Z","title":"Johansson, J","venue":null,"work_id":"ba7927f2-8925-4bd4-a0ec-6b504d024a32","year":2008},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.768138Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:7e473a533c3bb5362c3ca381ad50305a94328fba22fd8e0b417d8a45008d9fff","observation_id":"1650fe25-8c37-46d1-a3da-20f36842cd2c","resolution":{"observed_at":"2026-08-07T04:38:59.036866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:58.673889Z","title":null,"venue":null,"work_id":"ac816a10-d580-4867-9044-eaf1c975c7d2","year":2022},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:49.932761Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:5538d30b60969d1aeadd06614cdd43d2529de7b050ce17ab8cbb54000a8be599","observation_id":"0e0350b9-37c1-4bb5-8f48-f742e963bfe4","resolution":{"observed_at":"2026-08-07T04:38:58.823872Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:58.358556Z","title":null,"venue":null,"work_id":"0d690b26-0242-4478-9295-9654d6f52703","year":2023},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.102600Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:9a2c72a4c8e6307d909a59e57902ac4b271a723479afada93ae30d8af68dd9da","observation_id":"f61d413f-87f5-4327-a225-d470168895ea","resolution":{"observed_at":"2026-08-07T04:38:58.508143Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:58.139737Z","title":null,"venue":null,"work_id":"0c20bab9-cbc9-453e-8f61-d8b6879bd4ab","year":2016},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.238313Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:c16047804150e147d08e61fdb8ddb7ea16a84e59f42a5df0b65eccef20bd2858","observation_id":"d7d388de-b3ae-4580-b72d-0a2f677f8ef6","resolution":{"observed_at":"2026-08-07T04:38:58.265554Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:57.869263Z","title":null,"venue":null,"work_id":"7d0c2cec-5491-4f72-a5a9-2253126e47fa","year":2017},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.347655Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:4cfbc8a174c3b4bf0511e7299efef2bca2b95da86eeb67cecd8a5cdcfcb96eb2","observation_id":"423c42ae-c093-4df1-b4d1-5f066fe6fcc7","resolution":{"observed_at":"2026-08-07T04:38:58.010993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:57.619593Z","title":null,"venue":null,"work_id":"741066eb-fb8d-4c2b-aeb0-a8fb2b718806","year":2021},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.487570Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:c67fc231dab26698809201eae5750d98223172296c59b036ad296141e153c8d2","observation_id":"7279611a-b254-495f-b59d-8dd92423b3b6","resolution":{"observed_at":"2026-08-07T04:38:57.721435Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:57.373472Z","title":"Kannan, M","venue":null,"work_id":"4dcd64fe-7092-4547-8558-f68789940d2c","year":1988},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.600687Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:4805d752d2245bd3089ccaf2d78e435057cd621848bd164f27b5f4ef59cacc97","observation_id":"a65e2752-3e05-43ed-8393-fdf4991664e2","resolution":{"observed_at":"2026-08-07T04:38:57.500465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04397","last_updated":"2022-12-08T16:55:01Z","snapshot_observed_at":"2026-08-16T16:10:00.250648Z","submitted_at":"2022-12-08T16:55:01Z","title":"The optimal edge-colouring threshold","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04397","snapshot_observed_at":"2026-08-07T04:38:50.729532Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.729532Z"},"links":{"cited_paper":"/paper/2212.04397","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:c61dbce4b76e52a2bcdb11d8f1798c6b08a4ca86149f0f3d47b3f211ca27eec2","observation_id":"899a397f-df9d-4ed9-a801-660a40a2d0c1","resolution":{"observed_at":"2026-08-07T04:38:50.729532Z","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":"2511.22358","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:38:53.301739Z","title":"Kim and M","venue":null,"work_id":"6defbe94-ad62-403f-a0fe-e20cc00f53ab","year":2025},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.848469Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:93e022ad48c63921ba43162a6791ff5e624ab00ef734f76d3e3c3ab0c393b8e2","observation_id":"523d9770-94bd-47f8-8a2b-e56537d6aff7","resolution":{"observed_at":"2026-08-07T04:38:53.403560Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:57.124247Z","title":null,"venue":null,"work_id":"7390bfbc-adb0-46aa-8517-bd8b3577ff7b","year":2014},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.968163Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:0ab5ae5c1f7293af6b6370bba685ded8a374d2d96b4b661b1b099a0dc14ebe5e","observation_id":"4786573f-80c0-4137-8dc6-ba17f85462c7","resolution":{"observed_at":"2026-08-07T04:38:57.252859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:56.885889Z","title":null,"venue":null,"work_id":"503b60bd-65f3-4cae-a812-7509792e23e5","year":1998},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.140041Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:b9b5e9db1eeca6e66a45314012b377014bf9d51172851da5081f225280c3cd7c","observation_id":"1856ad38-59e7-417f-8d5c-f7a6c682a2e0","resolution":{"observed_at":"2026-08-07T04:38:57.008517Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:56.644301Z","title":"Komlós and E","venue":null,"work_id":"10310221-a876-41f9-a70f-51cd09f11b74","year":1983},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.244032Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:d500e7ef9744308c222222acf4fe35ea5236c2746d8849ea785321b2e9ac59c7","observation_id":"833e0f85-7333-4822-bdea-890d96eaf84d","resolution":{"observed_at":"2026-08-07T04:38:56.757479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:56.413865Z","title":null,"venue":null,"work_id":"4a8808c6-860a-410c-9f05-3daa2aadceaf","year":1976},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.350806Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:1d65c3b5221d73c160d901350287172e3135effdf93ae480c584022ac5dac5a5","observation_id":"7cdfd4f7-d684-4e01-9148-8cef02ca45d9","resolution":{"observed_at":"2026-08-07T04:38:56.514722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:56.227320Z","title":"Krivelevich","venue":null,"work_id":"3a9ccc4a-2b7b-4426-a545-25420cdc4df2","year":1997},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.463930Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:2e731a949304df80b9335a9edc52a351f4fcbed0ab9686676163e8b605a67e1c","observation_id":"200514f7-52a3-404c-8728-aa37f45c1a90","resolution":{"observed_at":"2026-08-07T04:38:56.341530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:55.926326Z","title":"Krivelevich","venue":null,"work_id":"650849f7-8880-436e-bed2-09a3d8bcb553","year":2010},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.584810Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:be915c0a1f1d2c89b0aab399e91ee20a3678f2aa3392741200ac762b69323852","observation_id":"0d62c1cf-3fce-478d-977b-c248dda7aa55","resolution":{"observed_at":"2026-08-07T04:38:56.090045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:55.693477Z","title":"Krivelevich and R","venue":null,"work_id":"d6ce51cd-b627-426a-9afa-2458b9d7f3a5","year":2026},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.699311Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:d50814705101d809e2b48cad47f8859d39ec740194d97f5d543c23d919d9d639","observation_id":"ef0363d2-0a02-421c-bec5-7eae4549421d","resolution":{"observed_at":"2026-08-07T04:38:55.811372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.6559","last_updated":"2014-06-26T09:41:41Z","snapshot_observed_at":"2026-08-14T23:32:43.995687Z","submitted_at":"2014-05-26T12:59:08Z","title":"Embedding bounded degree spanning trees in random graphs","version":2},"cited_work":{"arxiv_id":"1405.6559","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.6559","snapshot_observed_at":"2026-08-07T04:38:53.097684Z","title":"Embedding bounded degree spanning trees in random graphs","venue":"math.CO","work_id":"56a52b17-6c0a-4f8a-a829-0dec48b4f9d8","year":2014},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.828455Z"},"links":{"cited_paper":"/paper/1405.6559","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:715506a967c3a719f818ec0797df5947a4fb476c54c571dbf3f1138da2b14582","observation_id":"ab4e15f4-d9e8-4205-b457-fee0df872c8f","resolution":{"observed_at":"2026-08-07T04:38:53.163391Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:38:51.956809Z","title":"Montgomery","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.956809Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:572fd014b8ffe9f1e524d70b3da81b3aff06a0d58ed7194a689afcecc4323fbc","observation_id":"d51201f0-7304-4a56-ac1f-956a916e17eb","resolution":{"observed_at":"2026-08-07T04:38:51.956809Z","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-07T04:38:55.468173Z","title":"Park and H","venue":null,"work_id":"5433f524-b905-4d62-8478-801adc6b4ba7","year":2024},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.078878Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:3443a54be1cbb74900a205b2f6b4a66271f3569bdd747498a7e83792e0ca1f1a","observation_id":"71763a37-4b48-4ce4-b24b-56b52f85f6c4","resolution":{"observed_at":"2026-08-07T04:38:55.562158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:55.281388Z","title":null,"venue":null,"work_id":"91b88d49-4539-436f-836c-9594c9b3883b","year":2025},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.212992Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:28213b54306e2372bc828fd748b3366edbefcdeab4ee41c0f3e1f83a50dd8d53","observation_id":"6830dcf5-bb02-497c-b045-3d1933ec7cc9","resolution":{"observed_at":"2026-08-07T04:38:55.373723Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:54.990120Z","title":null,"venue":null,"work_id":"025c42c4-5baf-4cd6-a0e0-281ffbe9ae92","year":1976},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.323928Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:838e88ba1049f6298942b22be7824ca8ad0eb8497a50176f47d726ff70843c52","observation_id":"680b1e4b-dbd1-4200-9679-ddde732703ab","resolution":{"observed_at":"2026-08-07T04:38:55.137106Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:54.754200Z","title":null,"venue":null,"work_id":"e1ae2739-4860-46a2-b2b9-ce273bbba70c","year":1955},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.469938Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:f6aa78dce5facc3686ad480c6478c68916b9751928940f2f4a5941c3a08f1cfd","observation_id":"0915c13a-4783-4540-a6c0-aa393deacd65","resolution":{"observed_at":"2026-08-07T04:38:54.858854Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-07T04:38:54.513411Z","title":"Ruciński","venue":null,"work_id":"c218aadf-4de4-4944-b8d9-e28d5960a84a","year":1992},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.599281Z"},"links":{"citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:44d61daeed05e24bff9cea40dfe07611ae7682a5fefe4ffc09739c73ef14d649","observation_id":"752051c9-96d4-41a1-a421-2d38ccf87dae","resolution":{"observed_at":"2026-08-07T04:38:54.646149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.20361","last_updated":"2026-05-19T18:15:26Z","snapshot_observed_at":"2026-08-16T14:10:28.692674Z","submitted_at":"2026-05-19T18:15:26Z","title":"Spanning triangulations in random graphs","version":1},"cited_work":{"arxiv_id":"2605.20361","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.20361","snapshot_observed_at":"2026-08-07T04:38:52.907735Z","title":"Spanning triangulations in random graphs","venue":"math.CO","work_id":"15d37c23-db9b-41f3-8ddc-d74a8c9e1d45","year":2026},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.665349Z"},"links":{"cited_paper":"/paper/2605.20361","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:ceb025b9127f5c4e9f2b9f021d625d9b3dee7b1b2450cc49aed23fd30e2003c6","observation_id":"5c6b2e4a-20ad-482d-84b2-b9da14de1d23","resolution":{"observed_at":"2026-08-07T04:38:52.959048Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14794","last_updated":"2025-06-25T10:51:52Z","snapshot_observed_at":"2026-08-16T17:15:11.609736Z","submitted_at":"2025-02-20T18:14:47Z","title":"Sharp thresholds for spanning regular subgraphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14794","snapshot_observed_at":"2026-08-07T04:38:52.763493Z","title":"Zhukovskii","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:52.763493Z"},"links":{"cited_paper":"/paper/2502.14794","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:62efcb4aa2d605da32e4ff7ab1845bdef5581d9d5776cab6ffbda66b6fa925ef","observation_id":"4f5a5e5c-653d-4056-aaf7-005d278485fd","resolution":{"observed_at":"2026-08-07T04:38:52.763493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-17T00:31:22.807216Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":7,"verified_fuzzy":38},"total_outbound_references":77},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 0 inbound Pith citation observations for arXiv:2608.06358."}