{"as_of":"2026-08-13T17:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71e33bcf81617c79eb5c351b5c33918837007aaa27adc39a3b8e46275aae004a","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:59:29.069245Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2502.01631/citation-record","integrity":"/paper/2502.01631/integrity","json":"/paper/2502.01631/citation-record.json","paper":"/paper/2502.01631"},"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-09T14:59:30.307311Z","title":"Alon and J.H","venue":null,"work_id":"2dc00357-c22d-462f-b07e-bf27c20e97ec","year":2004},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.645314Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:cb244a54e488ec8c7631483da3937f33eb4331960a024948454bd3a68c161e5b","observation_id":"716fd7c1-690d-495a-9f9b-7f98fd762422","resolution":{"observed_at":"2026-08-09T14:59:30.310282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.298821Z","title":"Ben-Shimon, M","venue":null,"work_id":"d2a75281-f076-4952-a64a-49bd168f5786","year":2011},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.712754Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:fa239fa1c8877e5bacfc062155f10e5cea4395ec62e72b27a27bda5b4e49f501","observation_id":"01593a7d-6717-4fd3-b18b-58afc6732535","resolution":{"observed_at":"2026-08-09T14:59:30.301102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.290485Z","title":"Bollobás,The evolution of sparse graphs, Graph theory and combinatorics (Cambridge, 1983) (1984), 35–57","venue":null,"work_id":"4b9a4e68-67b0-4f73-b58f-55184f4a3e63","year":1984},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.762495Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:95ff68b680e253ef23b34aebe102c10d89854f5e1f902bc9609627e196f3b0fb","observation_id":"d573dca5-7aad-49af-829a-c28f4c0df50e","resolution":{"observed_at":"2026-08-09T14:59:30.293455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.282465Z","title":null,"venue":null,"work_id":"24f577ab-aef0-4dfa-9ca0-4570c7917280","year":1998},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.765921Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:dd17de35db94840cd9972394732de2d6ddd024c4a0788b7c36b4916f8fd2c1a1","observation_id":"a2935461-c63f-4733-a314-e420815bc8cd","resolution":{"observed_at":"2026-08-09T14:59:30.285245Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.274488Z","title":"Bollobás and A","venue":null,"work_id":"707892c7-763a-472d-a12e-bf476b0000f7","year":1983},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.776125Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:1cf4f664392276af42e7efda2df273b79f97342a1ed522821a8ca036809b10a4","observation_id":"44bbe4ce-bc60-4dc6-a070-ff805cdf3aed","resolution":{"observed_at":"2026-08-09T14:59:30.277438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.243451Z","title":"Csaba, D","venue":null,"work_id":"32a08019-dfdd-488d-9884-439694d8f5a8","year":2016},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.779516Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:cff2ae17ad061829bd30c3db46f305d84a58c15eae7bc9fd39eeb176cfc18672","observation_id":"94cbd197-6543-4bbf-8157-fd33b5d9cf2c","resolution":{"observed_at":"2026-08-09T14:59:30.269285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.159249Z","title":null,"venue":null,"work_id":"52d177b9-29b8-4d74-b032-f5c876d0d9d3","year":1952},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.782671Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:a39de4363575b92b27086714d82e8061c28285006fbb5c6ea82039feb6268b32","observation_id":"eaf886a9-768e-4dd2-9c2b-5936247b1368","resolution":{"observed_at":"2026-08-09T14:59:30.200471Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.066854Z","title":"Ferber, M","venue":null,"work_id":"b4b5727a-7629-4c3f-9264-97d915b979bf","year":2017},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.786684Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:ae65c76955fa937c06e4637f2696571fe7ebe9617de48135b7368b653788c2af","observation_id":"fc761382-60b6-4178-9a40-42f3f9c67181","resolution":{"observed_at":"2026-08-09T14:59:30.104320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.014381Z","title":"Ferber, G","venue":null,"work_id":"31eb6876-003a-43bb-870b-d8a2f4e68fe5","year":2017},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.789632Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:916efc90d13e4359c660e12c6bdda97de5a4e7f8240bee76fee7e5b126b70a7b","observation_id":"a72bc06c-5ce5-4243-bb9b-7446e410551f","resolution":{"observed_at":"2026-08-09T14:59:30.025338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:30.005641Z","title":"Ferber and V","venue":null,"work_id":"53a17a69-63d9-4890-973f-05fa50d62e3e","year":2018},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.792292Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:7450b04b49bca46908898a6266cfd4b292907c9b9ea3fe9b834988106948bc4b","observation_id":"3029c955-8285-47af-b89e-f7fc908307de","resolution":{"observed_at":"2026-08-09T14:59:30.008427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.996859Z","title":"4, 592–603","venue":null,"work_id":"40b5b206-7544-4f85-bd4a-c5639767ba14","year":2018},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.796516Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:c3e775f2dc9affcc3077ffb3dc2c52823fc01ed1ee41d0c085571aece6a9270e","observation_id":"0a79f28f-406b-4035-a5ba-1388023f54ae","resolution":{"observed_at":"2026-08-09T14:59:29.999574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12019","last_updated":"2022-09-07T01:15:40Z","snapshot_observed_at":"2026-08-10T16:26:02.939228Z","submitted_at":"2021-04-24T20:34:42Z","title":"Cycle type of random permutations: A toolkit","version":3},"cited_work":{"arxiv_id":"2104.12019","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.12019","snapshot_observed_at":"2026-08-09T14:59:29.099544Z","title":"Cycle type of random permutations: A toolkit","venue":"math.CO","work_id":"ba22ced8-f1f9-4a5c-8009-335400b7162c","year":2021},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.800845Z"},"links":{"cited_paper":"/paper/2104.12019","citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:14d61c8e9a560f373bd552cae2845186943f1c87d435529f5ae53780bc36e260","observation_id":"044cd301-d7be-49d5-ade7-722d939fc612","resolution":{"observed_at":"2026-08-09T14:59:29.109191Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.988066Z","title":null,"venue":null,"work_id":"b147dcb8-9f36-4edc-973e-12dcf92f1912","year":1988},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.805068Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:9903785be92c6c95fd521d763cc62639458f1ca0e963a2d1e250d5be63958f7f","observation_id":"4f5c54b4-88a7-4952-abda-a342a9b27c16","resolution":{"observed_at":"2026-08-09T14:59:29.991336Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.979906Z","title":null,"venue":null,"work_id":"48f0151c-b236-41d4-83f5-2acf9dec8c52","year":2005},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.809125Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:1f26f186278a75286ebaf9267d93fe2cf87dc2ab04cc43f5c4129b73514b9d06","observation_id":"93cb775c-a8c1-4271-95f0-4dc53498c00c","resolution":{"observed_at":"2026-08-09T14:59:29.982627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.970381Z","title":"1, 221–234","venue":null,"work_id":"3ef67500-92c1-49ed-b81d-cbed7e22894a","year":2008},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.812036Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:087d15cda822657be92fbf3f34433b3225db2fa5b3b6d88b19566854e1f52cb3","observation_id":"e820a7c4-4d5b-4654-b97e-4f0b827272ec","resolution":{"observed_at":"2026-08-09T14:59:29.974220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.870930Z","title":"Ghouila-Houri,Une condition suffisante dexistence dun circuit hamiltonien, Comptes Rendus Hebdomadaires Des Seances De L’Academie Des Sciences251 (1960), no","venue":null,"work_id":"41843f1c-c67b-4c32-b10a-e7ced2c8cec5","year":1960},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.814786Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:c1bf5ab1553106199f875c386aaa3c77da07d5e353beabf1da1d3b44712e6459","observation_id":"429ad014-6ecf-4bda-90b3-153d81dfe2d3","resolution":{"observed_at":"2026-08-09T14:59:29.941059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.860845Z","title":"Häggkvist,Hamilton cycles in oriented graphs, Combinatorics, Probability and Computing2 (1993), no","venue":null,"work_id":"4704a019-54a9-4997-b787-618b2a5ed706","year":1993},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.818090Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:53b51b222752757965d64690d5543531ccd8e7e425f8fdab1bfc0ea8b2e0f61b","observation_id":"b18a42ee-abd7-4477-b145-03b871e2392d","resolution":{"observed_at":"2026-08-09T14:59:29.863947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.851653Z","title":"Janson, A","venue":null,"work_id":"832a3f1a-2d1d-4b61-b9db-cf23c8f2fc93","year":2000},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.820913Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:9340fb3fbc52d93e53f0210fd9e6efaf4fabc5f2825e2d887e3b2c64914be429","observation_id":"84bad349-32f7-474d-a9a7-86f9a34c5cac","resolution":{"observed_at":"2026-08-09T14:59:29.854865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.766581Z","title":null,"venue":null,"work_id":"f5f3457d-c8f2-4c11-a9fc-ba3031d70b5a","year":1972},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.823025Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:7a3c0d46f2770a8b29c3152e20a5532d414e70c5ac994e8594cb71e4ee44b7d9","observation_id":"2814ab91-09e6-4bd5-a96a-0b24bd71675f","resolution":{"observed_at":"2026-08-09T14:59:29.826284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.696715Z","title":"Keevash, D","venue":null,"work_id":"b4adfc12-64de-48e4-af41-22fc45551774","year":2009},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.826048Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:6feda54e170daa843b5c4728dfadb038e8d6c2e1c73950f957005da7198359c5","observation_id":"36ef0ed4-9d38-4162-9c35-d907447bd173","resolution":{"observed_at":"2026-08-09T14:59:29.703527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.687962Z","title":null,"venue":null,"work_id":"01c0d146-5543-4b40-b177-7e8e263a520d","year":2012},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.828215Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:a606800e99f1aef0e060e00b44715ff87ec72e3398f36af5e5643d905aeffdf8","observation_id":"146038f5-1706-4696-9c54-64596e7c33cf","resolution":{"observed_at":"2026-08-09T14:59:29.691331Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.631813Z","title":"3, 397–445","venue":null,"work_id":"2b6e1dec-d8d8-4bab-bea7-c3c725009753","year":2015},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.830396Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:b6122647ce3e8eb1d4ed39bc315fe8e17709b2b589deedddef4b81cb3afa2a82","observation_id":"76092a31-5133-45dc-a1f0-ed49787301ae","resolution":{"observed_at":"2026-08-09T14:59:29.681685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.576630Z","title":"Komlós and E","venue":null,"work_id":"b2bdd561-b2f9-4600-a4b0-ce924a609739","year":1983},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.833096Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:b38fcb53b981172443f7f50ace37c29aee8154b0af8cb7655c33813d3a5c489d","observation_id":"bc40dd20-1a4c-40e2-8adc-fa8da1950326","resolution":{"observed_at":"2026-08-09T14:59:29.587217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.567236Z","title":"Krivelevich and W","venue":null,"work_id":"22d31c81-117d-49fe-88b3-c1eb5a58aa57","year":2012},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.860792Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:48df0f1d10753b42fd8c80a4438293b57a7df5afd8f4cadbdedd5856417d4751","observation_id":"7e27bdf4-8fa2-4bc4-a8b8-01dafafa74d4","resolution":{"observed_at":"2026-08-09T14:59:29.570110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.557892Z","title":"Kühn and D","venue":null,"work_id":"196cdfd9-a5f0-4afd-abbf-144bcafa2fa8","year":2012},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.899446Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:6aa8d8c5843b2bc6175f751cdc53394b79ab86ac2321a13a16a86fc912707ffb","observation_id":"8daf6b1b-2b15-4a13-9cb7-acb3cfd9d764","resolution":{"observed_at":"2026-08-09T14:59:29.561952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.549535Z","title":null,"venue":null,"work_id":"51ddbcdd-4038-4047-b36a-7171c574cb93","year":2013},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:28.974382Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:9ed1d9aa250e0e3c056276d4a04f5bf50e6f91e2f7f0a588ec65a83d94624d7c","observation_id":"cc3d2d32-7597-4574-9c75-19b297aeea7d","resolution":{"observed_at":"2026-08-09T14:59:29.552729Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.4268","last_updated":"2014-05-23T12:06:53Z","snapshot_observed_at":"2026-07-06T03:36:16.847298Z","submitted_at":"2014-02-18T09:56:12Z","title":"Hamilton cycles in graphs and hypergraphs: an extremal perspective","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.4268","snapshot_observed_at":"2026-08-09T14:59:29.022380Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.022380Z"},"links":{"cited_paper":"/paper/1402.4268","citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:136be97ec43247406bdf37f7dc77832b3efa3b3c0fc886f397cf3e34527d82f5","observation_id":"15661b11-ba84-473b-9293-6f4a9dd592f8","resolution":{"observed_at":"2026-08-09T14:59:29.022380Z","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-09T14:59:29.540134Z","title":null,"venue":null,"work_id":"c67f6ca0-e08f-4a97-9150-3e1e0ec7fb94","year":2014},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.025659Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:ae3d8409bc92113a39c3c8214fab75dd2cd58ed452ab2a6f8e24543b8ebe8e5c","observation_id":"0ef59505-765d-4bbc-b12a-828a7ac5e014","resolution":{"observed_at":"2026-08-09T14:59:29.543677Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.530956Z","title":"Lovász,Combinatorial problems and exercises, Vol","venue":null,"work_id":"6831c966-0dcb-46f0-a926-6da41c96f55a","year":2007},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.029224Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:d9b4691f9301bd7dd968fad1dc1513eb31f167f54b1c268ae41e3c40b04a751c","observation_id":"ab42b86e-6654-4410-b23d-aeaa3dee647b","resolution":{"observed_at":"2026-08-09T14:59:29.534698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.521312Z","title":"McDiarmid,Clutter percolation and random graphs, Combinatorial optimization ii, 1980, pp","venue":null,"work_id":"1626526d-3b19-42f1-afcf-8d3f770ff9bd","year":1980},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.032474Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:e6d0592de16b8420f0fb872fa9ea90705992c3a5e19b0717fe2004490d17f0e3","observation_id":"9f45b837-8b33-4fbe-a09b-6c93200b0d4c","resolution":{"observed_at":"2026-08-09T14:59:29.524652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.512627Z","title":null,"venue":null,"work_id":"c1d4b16d-32c0-4a3d-9798-af7289447b6d","year":1971},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.034802Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:b6b5202c750d008c3ba981223601ae3e327e95c991f6880a970cc18e6fb8c179","observation_id":"341168cc-0098-4fa7-94f1-4723205e3d71","resolution":{"observed_at":"2026-08-09T14:59:29.515988Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.451345Z","title":"Pósa,Hamiltonian circuits in random graphs, Discrete Mathematics14 (1976), no","venue":null,"work_id":"e19d22f7-5866-439b-8630-3f4c37a5286b","year":1976},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.037835Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:2afaf4cc33118157bd80c8f2bdbe6e3d69ac7e87fed4a1640ae413839dac1a75","observation_id":"f64f20ad-618b-47a9-98f9-594c7bb045ac","resolution":{"observed_at":"2026-08-09T14:59:29.507921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.366650Z","title":null,"venue":null,"work_id":"c56be951-fdc6-4f55-96fa-5aff2f9b8dee","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.040394Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:1e9395d2f2e213a7b249fb060bd944bec06daf8239b567af0db0f5b459c63e4a","observation_id":"feafe81a-0b96-42c3-97ff-25eececc9385","resolution":{"observed_at":"2026-08-09T14:59:29.406899Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.325655Z","title":null,"venue":null,"work_id":"36fc9427-79e1-4855-8639-7950172c03af","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.043890Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:2804004cc2ca71557101012d43676a771eb4adadb28ba3e5bd2e2087aff90dbd","observation_id":"e108b82c-a8bd-40b9-a6b5-979227bce673","resolution":{"observed_at":"2026-08-09T14:59:29.329529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.316821Z","title":"These observations are sufficient to prove the following claim: Claim B.2","venue":null,"work_id":"db650940-87af-4e99-8eed-8459d42b8b1f","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.046860Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:abdc354174af426211b5d44d3226daa7a14e13c5a92e91403df2a701fcea2042","observation_id":"90315591-91df-42df-b518-4973c26a3849","resolution":{"observed_at":"2026-08-09T14:59:29.320725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.308514Z","title":null,"venue":null,"work_id":"441b21f0-1d34-4666-89fc-177b5d528e33","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.050188Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:b445dc20e79ec4d021d67cdc291eaca526569609bb4dde061c7d77e036669dbd","observation_id":"9eb6b44c-63ca-452f-95c1-e4a1e8de8837","resolution":{"observed_at":"2026-08-09T14:59:29.311438Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.299679Z","title":"(ii) While P is not a directed cycle, do the following step: Note that the componentP is either a directed path or an isolated vertex","venue":null,"work_id":"97acba61-1143-4bd5-85b5-ca09ece5f7e7","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.053037Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:9ab386dd4de9a8e9b994d913abac85e7f6ee1e36d0c3a955061fcb1e56850bd5","observation_id":"f4c9e0ea-0f41-4be1-ba80-c535487321c1","resolution":{"observed_at":"2026-08-09T14:59:29.303492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.291329Z","title":"This procedure incrementally reveals the permutationπ by following the edges of the matchings M1, M2, and M3 that define the cyclesC1, C2, and C3, repectively, inDπ","venue":null,"work_id":"ee5a1a4a-eb25-471a-b9c4-18e39b4d2d92","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.055366Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:e5a068901da58815e4cd0c9f6008a23abc41d570afb22b7f6f1b58f418b61faa","observation_id":"7e704d7d-4e2f-44e1-9357-d04dd212f7f1","resolution":{"observed_at":"2026-08-09T14:59:29.294626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.282318Z","title":null,"venue":null,"work_id":"619e3965-8c10-4b96-9845-eb7e7563fb62","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.058229Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:d5c4a3de194996e9c03bb95034b4e7a2c1cbd69cf66201064a2f32629fa4e4ea","observation_id":"6152ff3b-4e23-44c7-a33a-230ce11e6961","resolution":{"observed_at":"2026-08-09T14:59:29.285315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.273616Z","title":"Note that ifz is the other endpoint of the path, and we considerz ∈ X, then in order to close the cycle, its unique neighbor inMs, if yet unlabeled, must be labeledw","venue":null,"work_id":"8e1f8988-4fa1-4eb7-bfa0-d28b84710386","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.061075Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:423230af1d2a4cb29e67d961de96b15cb5ae94b1b97383688e6e75e6359ebdd9","observation_id":"5cfc0ab3-5010-430b-bdfb-490e531dace5","resolution":{"observed_at":"2026-08-09T14:59:29.276858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.263565Z","title":null,"venue":null,"work_id":"2e633bf3-b856-4f30-98ca-a8946a1d2f4d","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.063382Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:cb7fc3623b1abecd69c265fc13f91bf5310103dad49853079787e8fdf94cf4c6","observation_id":"1d1f4c6a-0179-4e20-8ae6-4e5676fb2402","resolution":{"observed_at":"2026-08-09T14:59:29.267942Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.254455Z","title":null,"venue":null,"work_id":"9144941e-6b55-4489-8fff-ae8e5df3aaf5","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.066139Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:4ba7a6884a4f22529f31559ded8293254510d54fca6dc495263ec9dc95b27152","observation_id":"4c7d942a-1fea-4abb-a4e2-bea03eab73d7","resolution":{"observed_at":"2026-08-09T14:59:29.258129Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T14:59:29.155414Z","title":null,"venue":null,"work_id":"bb7f7b69-077a-44cb-af2f-06f1dce00de7","year":null},"citing_paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T14:59:29.069245Z"},"links":{"citing_paper":"/paper/2502.01631"},"observation_digest":"sha256:ba1158839519b1189c9f0ed041139b8b3f79b1633fc807b90369227aa298ccb7","observation_id":"a23053be-9806-4b13-9585-f62f4cf3b61f","resolution":{"observed_at":"2026-08-09T14:59:29.205311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01631","last_updated":"2025-02-03T18:58:25Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T16:26:07.119894Z","submitted_at":"2025-02-03T18:58:25Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":43},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2502.01631."}