{"as_of":"2026-08-08T18:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:368f57e58ff99320e90db9ed6e650c73bac97103eb7e8b0a4335b8989713d844","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:24:40.978643Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:16:45.622042Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T11:38:05.638003Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"cited_work":{"arxiv_id":"2507.22807","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22807","snapshot_observed_at":"2026-07-03T11:38:05.638003Z","title":"Draganić, J","venue":null,"work_id":"c01ec5f8-10c8-4a9c-8cd1-3deb5f439708","year":2025},"citing_paper":{"arxiv_id":"2606.07471","last_updated":"2026-06-05T17:23:50Z","snapshot_observed_at":"2026-08-08T03:33:06.926910Z","submitted_at":"2026-06-05T17:23:50Z","title":"Dirac subgraphs of powers of cycles are Hamiltonian","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T21:37:01.692172Z"},"links":{"cited_paper":"/paper/2507.22807","citing_paper":"/paper/2606.07471"},"observation_digest":"sha256:bcdd4bd1b6e2a8fdebd3ca713eb0753641a954c8e1912279bfb3b6e03aa85103","observation_id":"39101ea4-aedf-4173-887a-350d21c77aee","resolution":{"observed_at":"2026-07-02T19:07:18.531132Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"cited_work":{"arxiv_id":"2507.22807","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22807","snapshot_observed_at":"2026-07-03T11:38:05.638003Z","title":"Draganić, J","venue":null,"work_id":"c01ec5f8-10c8-4a9c-8cd1-3deb5f439708","year":2025},"citing_paper":{"arxiv_id":"2606.11992","last_updated":"2026-06-10T12:18:43Z","snapshot_observed_at":"2026-08-08T03:33:29.503496Z","submitted_at":"2026-06-10T12:18:43Z","title":"On the hitting time of Hamiltonicity in bipartite Dirac graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T09:24:00.214123Z"},"links":{"cited_paper":"/paper/2507.22807","citing_paper":"/paper/2606.11992"},"observation_digest":"sha256:f20fd4f1236e3212f2890378bbb328254b8b51fbed20b8ca151f4d034554100a","observation_id":"a497dd50-3939-485d-9f20-3f91cfc11e57","resolution":{"observed_at":"2026-07-03T11:38:05.639504Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.22807","snapshot_observed_at":"2026-08-02T01:16:45.622042Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions.arXiv preprint arXiv:2507.22807, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-06T08:29:39.157070Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.622042Z"},"links":{"cited_paper":"/paper/2507.22807","citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:8faa55c9ae667112014b92748acec04978bc0df9ed407a69ee39be81fae14813","observation_id":"ed3183ce-9f84-4a96-838e-a260f2a5f29e","resolution":{"observed_at":"2026-08-02T01:16:45.622042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.22807/citation-record","integrity":"/paper/2507.22807/integrity","json":"/paper/2507.22807/citation-record.json","paper":"/paper/2507.22807"},"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-06T11:24:41.771128Z","title":"Ajtai, J","venue":null,"work_id":"a224d942-6372-4fba-af3c-9e125663fb93","year":1985},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.705121Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:20505fab3583306181326489c7a687d708d0757110c351ff1de1cc0099b5b362","observation_id":"9a8b892c-b541-4837-8fbe-e06809c8a3ec","resolution":{"observed_at":"2026-08-06T11:24:41.774978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.759263Z","title":"Allen, J","venue":null,"work_id":"d8d8a492-a641-487c-8a98-9e168fe52fbd","year":2017},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.736036Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:8c081f9175693599b081d8802ac573abc22a44a0ad72bc73f62dea46de7259df","observation_id":"26f2ea6b-2e17-48d2-9fe7-d4c7c617330d","resolution":{"observed_at":"2026-08-06T11:24:41.762904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.747575Z","title":null,"venue":null,"work_id":"3829a6bf-ca2c-4a6e-9aa3-a7666519fedc","year":2008},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.752209Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:6a4b88cd18107e1fd211c4f6eb49747f17ed98930371f3c282bf1f0e46475819","observation_id":"6a7de58a-b816-4cb2-9e91-0e276e657863","resolution":{"observed_at":"2026-08-06T11:24:41.751273Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.735769Z","title":"Alspach, J","venue":null,"work_id":"3aa52764-b199-4bdd-845f-fa1fa1ef8c58","year":1987},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.756597Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:8edbf29dc662c94f8e71e1e61fb7cae1a824e27261545345e5aea22d209bd8da","observation_id":"2c585df4-13d4-4996-a044-05b9b4e2b8bf","resolution":{"observed_at":"2026-08-06T11:24:41.739315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.723870Z","title":"Ara´ ujo, M","venue":null,"work_id":"fd684c3c-f5f0-4114-9a28-2e24491ce8ca","year":2025},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.761118Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:4edd82a9e7c02375b862d887b41c25b506f8d5a86fda3f055e35c15f67ce9353","observation_id":"a4bec928-7e0c-4a90-87b7-d5406516621f","resolution":{"observed_at":"2026-08-06T11:24:41.727337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.712253Z","title":"Bang-Jensen and G","venue":null,"work_id":"5e95ce30-8d59-48a7-8636-41a8241027eb","year":2009},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.765244Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:31c31851ccfa2d71a779e5ceae97301ecf596d5f6b1b0b1d4a3e0bf0dd04294b","observation_id":"9266c638-aa86-492f-bc97-1752287f3690","resolution":{"observed_at":"2026-08-06T11:24:41.715698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.700337Z","title":"Ben-Shimon, M","venue":null,"work_id":"3ae98437-104b-460b-b908-648eed30641d","year":2011},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.769876Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:c1f930b257df3a824fcc734511b9e1d311a7cbb1a82868a797be2ebe57487805","observation_id":"cb24b897-c6a8-4d35-9467-09e48e894f77","resolution":{"observed_at":"2026-08-06T11:24:41.704368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.689224Z","title":"Bollob´ as","venue":null,"work_id":"394f03d0-8871-4cb9-b35d-6be5bd14b3ee","year":1983},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.773483Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:89f1bd7976f9862a95811555cc4b621bae6682f9808d64b5fd5de4b89042f3b4","observation_id":"e177f8ec-9814-4914-a4a4-766c32c8d02d","resolution":{"observed_at":"2026-08-06T11:24:41.692618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.677655Z","title":"Bollob´ as","venue":null,"work_id":"adfd4bc1-e76d-4350-aa46-fc3d286b1e68","year":1983},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.777343Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:14bdc66f033d364d3ec09a653b1083bdd134c1e6572d1c7a1e89c9d4dd824b72","observation_id":"67351b50-f3c1-4f7d-97c9-40e3e6a06d80","resolution":{"observed_at":"2026-08-06T11:24:41.681238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.665823Z","title":"Bollob´ as and A","venue":null,"work_id":"b2e7186c-9556-49bd-a5dd-0df2a2b4187f","year":1985},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.781137Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:2bcfc820187b27c1c90eedda979d63ba33231568a1c39ce6e2196f34529e4c6d","observation_id":"6c01bdfc-6cb3-43e4-8189-879f1eb31508","resolution":{"observed_at":"2026-08-06T11:24:41.669599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.651554Z","title":null,"venue":null,"work_id":"09dc101e-ab11-45fa-bf8a-335ed223d93e","year":1985},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.784761Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:4198937f0b629400c3db0dbd39ef4b17f2c9a1a34f9d3d76c022eebdf3b15904","observation_id":"6d959a6b-a220-4489-9a51-08ece186ded7","resolution":{"observed_at":"2026-08-06T11:24:41.657859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20500","last_updated":"2025-07-28T03:39:30Z","snapshot_observed_at":"2026-08-06T13:30:34.613773Z","submitted_at":"2025-07-28T03:39:30Z","title":"New bounds for linear arboricity and related problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.20500","snapshot_observed_at":"2026-08-06T11:24:40.788967Z","title":"Christoph, N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.788967Z"},"links":{"cited_paper":"/paper/2507.20500","citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:cfbaeef388ef317c3b7b5a72cb80a71b2d8694ad9d73c47bacc951a1563c738e","observation_id":"7aefecd3-6a5e-4a75-8b5b-a59116715390","resolution":{"observed_at":"2026-08-06T11:24:40.788967Z","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-06T11:24:41.640438Z","title":"Condon, A","venue":null,"work_id":"a96e5260-7caa-49d3-9c5e-65eadc18a862","year":2021},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.793533Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:310a4bdd2d5389d813733ebca42631b93e8562b2bcb482d3d5fd97719cec34a0","observation_id":"35496f48-18e1-473f-9963-0cf11242b338","resolution":{"observed_at":"2026-08-06T11:24:41.643928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.628456Z","title":"Cooper, A","venue":null,"work_id":"6c939a70-0a74-4be8-adea-ba91fe9cc52f","year":2002},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.797557Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:2d4a7fcfb9467babe3ffd1a6f93de3178db10fe831e948f07bea0c6069c5acb2","observation_id":"1792045b-8e59-4034-b5ba-384571f8b1a1","resolution":{"observed_at":"2026-08-06T11:24:41.632424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.617150Z","title":"Csaba, D","venue":null,"work_id":"506bb394-7b6f-41c1-bde8-e500878a68fe","year":2016},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.801485Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:6687e824ce90084a14f8a649698bd294c84a9d9db631745f54b674d75a3a0b81","observation_id":"64041e4b-cb58-4f09-b662-9e6f0425e6fc","resolution":{"observed_at":"2026-08-06T11:24:41.620712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.605653Z","title":null,"venue":null,"work_id":"64713bc2-9e8c-49c7-812f-df1c6d5269c4","year":2018},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.805372Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:51cb6ec87d07c6482f0bb1ac2afd33a2bfde372cfdac93e01a87d67c3fd4db9b","observation_id":"afdb09e8-3f93-4741-83ef-6b0643e76c45","resolution":{"observed_at":"2026-08-06T11:24:41.609519Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.594297Z","title":null,"venue":null,"work_id":"40a2a174-1432-481c-b963-37cd9734dff2","year":1952},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.809029Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:34c2b818545dbc129cb5100c84103d0a0649b3946c97f5eef77d044778351a46","observation_id":"fcec43b1-756f-4431-b1ca-c352bdb55b25","resolution":{"observed_at":"2026-08-06T11:24:41.597882Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.583107Z","title":"Dragani´ c, M","venue":null,"work_id":"a0614346-8b45-4e91-b000-9bde32e2047b","year":2022},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.812754Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:ce9fd3da4301ea4b59388a3b63cea51a27ff40a3cad23242038d4f58c96a4896","observation_id":"82dece15-6664-4e7c-b6cc-2ae1a7685860","resolution":{"observed_at":"2026-08-06T11:24:41.586517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06603","last_updated":"2024-04-14T09:20:38Z","snapshot_observed_at":"2026-07-06T17:28:06.332906Z","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-06T11:24:40.816363Z","title":"Dragani´ c, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.816363Z"},"links":{"cited_paper":"/paper/2402.06603","citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:6128d3579cc1daef471105e64a9507f530bb42d763151595c85531e596a3377f","observation_id":"b5cd4e26-9abf-44de-bf42-cac5b87b8918","resolution":{"observed_at":"2026-08-06T11:24:40.816363Z","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-06T11:24:41.571006Z","title":"Dragani´ c, S","venue":null,"work_id":"a11989ff-1a74-4c13-868c-bdecbb8127ae","year":2025},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.820200Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:b9ac20cb779d6cab33c0c93881b5eaa398fc892cc3d1065d14251b65c2684510","observation_id":"492b0a16-1923-4089-9dc5-7eb874195a0c","resolution":{"observed_at":"2026-08-06T11:24:41.574876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.559284Z","title":null,"venue":null,"work_id":"046a64ed-1833-41e0-902a-7fdee1d15cf4","year":1984},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.823780Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:02638fe399005dcdc4720f08e912ad664053ad3cc8b2fd2c5b911760748212ea","observation_id":"67cd9b20-2013-4565-95fb-9609926264c7","resolution":{"observed_at":"2026-08-06T11:24:41.562612Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.547920Z","title":"Ferber, J","venue":null,"work_id":"03f48019-26b2-45aa-865c-30ace75b28f1","year":2024},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.827258Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:c0056413415670cd058e0ff31693f2a8892d2220d964324f991954c273824981","observation_id":"e85f77cb-7aa8-4e8e-9dc6-3fdcf968fd6c","resolution":{"observed_at":"2026-08-06T11:24:41.551448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12981","last_updated":"2024-10-16T19:23:01Z","snapshot_observed_at":"2026-07-06T19:34:55.594468Z","submitted_at":"2024-10-16T19:23:01Z","title":"Regular bipartite decompositions of pseudorandom graphs","version":1},"cited_work":{"arxiv_id":"2410.12981","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.12981","snapshot_observed_at":"2026-08-06T11:24:41.036104Z","title":"Regular bipartite decompositions of pseudorandom graphs","venue":"math.CO","work_id":"d9e150a1-ad88-4e4e-bf12-8a77d218363f","year":2024},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.830831Z"},"links":{"cited_paper":"/paper/2410.12981","citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:4a2c93884d60780413cef0640b4b45cbd2a4cdbf06b8418656079fd7dd9e3502","observation_id":"eda146e5-ef21-49c5-85ab-ab7b257296dd","resolution":{"observed_at":"2026-08-06T11:24:41.040088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.535550Z","title":"Ferber, G","venue":null,"work_id":"732afdf4-7a06-4048-936b-201392f9662c","year":2017},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.835080Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:f2651aaf6c297d153776b1d992aba6464455be963021e60b3b760c0f142fa08d","observation_id":"fc6a3beb-a7ed-4911-bf4c-fdb10de21ca3","resolution":{"observed_at":"2026-08-06T11:24:41.539643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.523153Z","title":"Friedman and N","venue":null,"work_id":"bb7d61d1-34cc-4070-863a-593bc7a867aa","year":1987},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.838985Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:e489564914d6964734e28ec013f5734c883b2872da31c8da934405921592257d","observation_id":"2bd1a922-eb76-4b58-beec-3546e07f2e01","resolution":{"observed_at":"2026-08-06T11:24:41.526702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.510732Z","title":"Gerke and A","venue":null,"work_id":"882c6830-240b-4d77-a8ea-7cc7f489f4d1","year":2005},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.842936Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:7155ea6b0a904ca7208985bfe49d69838cb4812e3262f673676fbc877ee715a7","observation_id":"9910d895-c9bf-4324-8c6d-15fc74b3d75f","resolution":{"observed_at":"2026-08-06T11:24:41.514808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.498481Z","title":null,"venue":null,"work_id":"b7e862b6-0cd2-44ba-9619-6b5f8d87cd6c","year":2013},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.846477Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:95083a16f02adf0d3da9234fcb9b1c83a8725940c589dd5e26ce190836fd6710","observation_id":"e7d40af4-9e13-41eb-85f4-21292b3a1090","resolution":{"observed_at":"2026-08-06T11:24:41.502171Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.486457Z","title":"Glock, F","venue":null,"work_id":"b42b5afd-de87-41e1-a2a4-4f305c578ef5","year":2021},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.850799Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:b3bde14dd82d4c76ac90c1498463fda5f0ffbf9a8639afe31856812b02c7a2c7","observation_id":"d5527ef8-3503-413a-969a-ba96f356f1b8","resolution":{"observed_at":"2026-08-06T11:24:41.490146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.473888Z","title":"Glock, D","venue":null,"work_id":"3655f649-54bf-46dd-ad10-1dd5c06de4d0","year":2021},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.854510Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:da5d4bcc9fffbb20632e624a94207bde82dd75fdc3738c2e8f04923b4533047a","observation_id":"f7b46574-a0fe-428e-8efb-6a743dc4d088","resolution":{"observed_at":"2026-08-06T11:24:41.477997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.461658Z","title":"Glock, D","venue":null,"work_id":"d9330749-c68e-4a62-b2fa-5c237dd94e4b","year":2024},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.858257Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:7cc62a405b4ebe3242cc4c628e614e36294c9b3b0f6062073dbc31f6b93b2606","observation_id":"ddb5050a-43a7-45d2-aeb2-00aaf9bf8dc2","resolution":{"observed_at":"2026-08-06T11:24:41.465403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.449958Z","title":null,"venue":null,"work_id":"3041d75e-4bda-4350-96d2-8cf8699bdd53","year":2003},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.862064Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:c22f0e27395e9aa50f58873d0c77a056ffadc5148d82f2234e27081de39e78a7","observation_id":"219db504-c201-45bc-8b32-4c3c9d0dde96","resolution":{"observed_at":"2026-08-06T11:24:41.453550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.438265Z","title":null,"venue":null,"work_id":"87c7ec36-8b29-453b-9f5b-879e366c74e5","year":1971},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.865837Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:4f208e7a072457a22306f55bca7c1c9edcc702c061d0bac565d8eac89411c0ea","observation_id":"fed61465-5d1f-4ea3-b634-e6dd2ed47153","resolution":{"observed_at":"2026-08-06T11:24:41.441713Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.425964Z","title":null,"venue":null,"work_id":"4c328daa-4ce6-4580-ac43-b714be6556da","year":2001},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.869451Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:b637a62c1f5e7f9ea19a26505a9d21c8fc1f0107483d36647bcff98412a07e69","observation_id":"694d246a-d0f6-43e4-bf6b-6f039454b1dd","resolution":{"observed_at":"2026-08-06T11:24:41.429758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.414038Z","title":"Hefetz, M","venue":null,"work_id":"715d7368-7aeb-4e31-a658-996392c65e40","year":2009},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.872803Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:adaf33db9c059f6d19de7392f858cd3ea9499e23011ccd0390ab8f06435d59c5","observation_id":"3c17869a-3ded-4d9b-b767-80bcd94a3122","resolution":{"observed_at":"2026-08-06T11:24:41.418112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.401964Z","title":null,"venue":null,"work_id":"ea7edd5b-ff7c-4004-8e57-094107635ee0","year":2025},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.876933Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:8f6d849f92894dde4c425aca9b854cb6102d69b1266ee16968eaa403b9081827","observation_id":"03f4638a-e3fa-4686-8075-9579e5f807c8","resolution":{"observed_at":"2026-08-06T11:24:41.405636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.389850Z","title":"Keevash and K","venue":null,"work_id":"2c998eb0-6e55-4bc3-acc1-9ef47103e5a9","year":2022},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.881468Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:3339e43393cb986cf3ecfd3c7d7cc98f6755315ba4c216c1628dc9d4d7dde6cb","observation_id":"374d208c-a3c6-4a7f-a003-51ffde4b5809","resolution":{"observed_at":"2026-08-06T11:24:41.393582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.372891Z","title":null,"venue":null,"work_id":"83deeca9-0130-42b4-80e2-c53addaf9c13","year":2001},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.885138Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:81168339193c456045a2f971d1723121e1118aa68aac62edfe128191dd14b85a","observation_id":"d8a75538-0b9b-406c-99e4-91dcdfe5fbe2","resolution":{"observed_at":"2026-08-06T11:24:41.381429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.360993Z","title":null,"venue":null,"work_id":"df61a253-1d68-46c2-a27e-d83d57d17c43","year":2012},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.888628Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:cdc848edc15d1810d9d4228dd7d9c4fd58ed40e890fe6b3d1fedea6f4bab7a0f","observation_id":"996d0aee-9355-4fc1-b141-cbfcacbe18b3","resolution":{"observed_at":"2026-08-06T11:24:41.364758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.348344Z","title":null,"venue":null,"work_id":"cbca7c44-436b-4cab-80b9-08c391af4448","year":2015},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.891996Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:9b3d7f58f8216b83ad8bb9d6079a5455421cf715701046a425c785509e50855e","observation_id":"a1100ba2-15c6-4ab1-be0e-e7bd23638d51","resolution":{"observed_at":"2026-08-06T11:24:41.352911Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.335654Z","title":"Kohayakawa","venue":null,"work_id":"531a1655-7cd4-456e-91dd-f3614eb4c0a4","year":1997},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.895739Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:1ad170b9ec40b188bbdf8771cc983e7f74a5e1032b9037f31f8d7d27b8359820","observation_id":"fc84bcad-dd47-4c73-9712-992a5b6f9ccc","resolution":{"observed_at":"2026-08-06T11:24:41.339337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.323671Z","title":"Koml´ os and E","venue":null,"work_id":"d210a28e-470b-48fc-b613-89a8b56dbacf","year":1983},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.899127Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:2b338f11c4c9ec2a65440bd8eaf2652eead5c684d6e745f465bb4f91610e3b34","observation_id":"bc34f451-cfb2-4b27-9dfe-795b5f0b81fb","resolution":{"observed_at":"2026-08-06T11:24:41.327395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.311603Z","title":null,"venue":null,"work_id":"78714760-3689-4a1b-b8f5-6b66f584ca98","year":1976},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.902521Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:13b276e8e031a69df5ca81e277b26d78dbb4d138b1a8c846dc589d73eb4b4d5a","observation_id":"1d704a77-736f-4c04-bbdb-253b6a6f6f17","resolution":{"observed_at":"2026-08-06T11:24:41.315864Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.300036Z","title":"Krivelevich","venue":null,"work_id":"69a545e0-3ffb-48d4-9c7f-00f1dc6ebd2a","year":2012},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.906315Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:133440e3ececd73826dcdb7134e6bcdf46f2e9be9aa4eba7885dc1f07986764e","observation_id":"24f1fd11-d60b-4a28-8bfb-f69893bf9bc3","resolution":{"observed_at":"2026-08-06T11:24:41.303806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.288282Z","title":"Krivelevich and B","venue":null,"work_id":"c083d37e-af8c-4f78-8c6a-c507e4c60e04","year":2003},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.910323Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:d71c9427737596d2577c49ccb239b8c5e8bd5ec9d21e0fb48c59d3a7dafabc5e","observation_id":"d6d3448f-2fbb-4231-8a96-f426092223dc","resolution":{"observed_at":"2026-08-06T11:24:41.291672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.276193Z","title":"Krivelevich and B","venue":null,"work_id":"da79be7b-16cf-4fc8-b1c1-b183f83502fa","year":2006},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.914478Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:9221d29b8124643a440b6c7379639f05aae078ff6bcb601803ba0d22e2d050bd","observation_id":"3a751682-2eb6-494f-b7ff-2f41bc8aca06","resolution":{"observed_at":"2026-08-06T11:24:41.279925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.264596Z","title":"Krivelevich and W","venue":null,"work_id":"859645bf-787a-4929-b07e-54002d0681ca","year":2012},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.918061Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:098c26a0f9de8180e51457965d987fda7ae7b8f809563c45e9258b15ed67c7fd","observation_id":"d1199bd3-b369-48c3-8c3a-2f10deeeb69b","resolution":{"observed_at":"2026-08-06T11:24:41.268244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.252943Z","title":"Krivelevich, B","venue":null,"work_id":"6be15b5f-31da-40cb-b18e-006c43f282e4","year":2001},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.921613Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:41f6492ee3f6e88622b8acd0e5f1247c5efbb5cfee934e314e0240eed6f021be","observation_id":"049f8052-1132-49fb-b178-a5a77cd58efc","resolution":{"observed_at":"2026-08-06T11:24:41.256617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.241223Z","title":"K¨ uhn and D","venue":null,"work_id":"8c887d44-8673-4733-878a-97632169530a","year":2013},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.925411Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:b2a1d295111b867ecd289691aa750f68b33390adc131be10f83a9c3b61bb383a","observation_id":"e226bec7-1e8f-4584-b03b-3b8978a71b40","resolution":{"observed_at":"2026-08-06T11:24:41.244816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.229359Z","title":"K¨ uhn and D","venue":null,"work_id":"a08cf057-8f40-447b-a0a4-9ac04f469e8b","year":2014},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.928931Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:6fcb6f9578b96f676d2c2c06bd962b7c063639088862d991e5bde6de67cdc46b","observation_id":"bb301a33-ac55-4ad1-8eb2-f0b15856ecfe","resolution":{"observed_at":"2026-08-06T11:24:41.232944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.216988Z","title":"Lee and B","venue":null,"work_id":"289ab289-ef84-4d59-a373-307c82156dc0","year":2012},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.932629Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:ddfa0d3fe06a73d42e371ef47071c1c35b29db4b1ab28142ee8c45c511d7d03b","observation_id":"8cd0384d-f0b0-400f-86f2-a482ad108d56","resolution":{"observed_at":"2026-08-06T11:24:41.220776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.205303Z","title":"Montgomery","venue":null,"work_id":"34f3131f-eca7-4a41-917f-acf0d6cd5cd8","year":2019},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.936238Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:84e1614e0da1924649819c6a657ff34c375eeae7f28898bf86b21c153e241bb3","observation_id":"ad107ef2-6eb8-42b0-9f24-e30b02f0a5db","resolution":{"observed_at":"2026-08-06T11:24:41.209015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02514","last_updated":"2024-06-04T17:37:13Z","snapshot_observed_at":"2026-08-05T03:53:51.150890Z","submitted_at":"2024-06-04T17:37:13Z","title":"Approximate path decompositions of regular graphs","version":1},"cited_work":{"arxiv_id":"2406.02514","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.02514","snapshot_observed_at":"2026-08-06T11:24:41.014459Z","title":"Approximate path decompositions of regular graphs","venue":"math.CO","work_id":"dda12eea-82a3-43f6-98df-b98a88bb7e05","year":2024},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.940358Z"},"links":{"cited_paper":"/paper/2406.02514","citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:f318779ab58e80c434ee00432da80571e16821e5dc7736b741bb5a67967f3062","observation_id":"b283ab3a-36af-4621-8d3b-f81c1d5323aa","resolution":{"observed_at":"2026-08-06T11:24:41.020630Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.193291Z","title":"Perkovic and B","venue":null,"work_id":"1e458cd2-3f50-48e3-9289-b7b20d5ac534","year":1997},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.944253Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:9ac83358ef2ec34c3ecadfda6ac97f60a28dab032134b885cd222aa58f75f628","observation_id":"8ae06928-5b4b-4c41-9d01-0a88fa60e2b9","resolution":{"observed_at":"2026-08-06T11:24:41.196728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.180476Z","title":null,"venue":null,"work_id":"bdd8f189-26e0-4e70-8cc4-d512e772dcf4","year":1976},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.947995Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:3ebee854dd398e69d8903b38c739ae70d8f9a9db84b3fa09fc2b9ec3492cee4e","observation_id":"a256f9d9-a795-405c-bd3e-33c361b3115f","resolution":{"observed_at":"2026-08-06T11:24:41.184123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.169068Z","title":null,"venue":null,"work_id":"d6c671dd-3e45-4cc7-9ca5-36015b11e894","year":1971},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.951647Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:f358f90845ccb8ac887197bd455c64300a18122b7a18699ef9aa3aa20c5dd592","observation_id":"336d9ce5-9693-45ea-9737-60efaae0e1e8","resolution":{"observed_at":"2026-08-06T11:24:41.172735Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.156524Z","title":null,"venue":null,"work_id":"6bd9ae96-4fec-492e-9ee1-916cd33ef244","year":1994},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.955255Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:13278405db7b6ad3c6d2b97e62aef27cbbecbf7acb345125f7e1acb0ff2b962a","observation_id":"bc669389-f138-43b6-8924-9978bacccbd2","resolution":{"observed_at":"2026-08-06T11:24:41.160965Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.143369Z","title":"Sauer and J","venue":null,"work_id":"b71f58dc-1ba2-4565-8d5a-221039041870","year":1978},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.959092Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:f11d342fcf2edbc576b4642c28298f8e08afc1b01a7616c873312b179cdccb87","observation_id":"6292b02e-ff34-4d6e-bd40-3ed4eff835ec","resolution":{"observed_at":"2026-08-06T11:24:41.146921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.129848Z","title":null,"venue":null,"work_id":"e8635e27-c28f-48bb-a111-3fda4f77924b","year":2008},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.962559Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:02a0cee5dfa2c62868db8e239667e8343b54d6d388991a32622517f8320953fe","observation_id":"93ad3296-3ce5-4e48-8711-30063f9e2e9c","resolution":{"observed_at":"2026-08-06T11:24:41.134178Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.117168Z","title":null,"venue":null,"work_id":"57e9fd6c-edef-4527-b0cb-fec52534c682","year":2017},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.966392Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:07bcb2be6a39f83e672a62fbfbb6cf993331bae579bdf0c5280c1c7cdd737260","observation_id":"b643d9bc-1ea6-4428-8c65-5a32a2d414ce","resolution":{"observed_at":"2026-08-06T11:24:41.121344Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.104602Z","title":"Sudakov and V","venue":null,"work_id":"cd4f8532-c481-4a44-be70-ac9214a727ae","year":2008},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.970254Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:ab3eaa5a2db5c28b9a9fc72e6d46b05077b09a9d8a8cb6aa5454832cfafac731","observation_id":"83e993b1-c92a-4789-bb45-4197aa7053e4","resolution":{"observed_at":"2026-08-06T11:24:41.108465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.090882Z","title":"Szemer´ edi","venue":null,"work_id":"4bbe70f3-43ed-4ba6-945a-bd30058eb8be","year":1976},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.973685Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:09e56f96537c44ecbb3b4dfaaa3cd9b2209a94e560250be39216b857fb8daba2","observation_id":"26e2a2b3-e5d1-4f32-b8ab-654767486319","resolution":{"observed_at":"2026-08-06T11:24:41.095659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:24:41.077740Z","title":"We also need a modification of Lemma 3.6 in [19]","venue":null,"work_id":"ed8a4566-3b45-4903-bb1a-7b5753c51f4d","year":null},"citing_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T11:24:40.978643Z"},"links":{"citing_paper":"/paper/2507.22807"},"observation_digest":"sha256:6014b4809b329b4001b0b18cdb7d11fa16cfaf1f5d45ad8e4ce179cda943b866","observation_id":"437ef91f-d479-4be2-84c4-3d18442e0dbb","resolution":{"observed_at":"2026-08-06T11:24:41.081523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-06T11:24:38.775458Z","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":62},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 3 inbound Pith citation observations for arXiv:2507.22807."}