{"as_of":"2026-08-16T01:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:426a11fd4b7ac7c40785ebe8763658e85e4e888d3efffdf72c888e24a8dbe18e","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:16:45.721539Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2607.14881/citation-record","integrity":"/paper/2607.14881/integrity","json":"/paper/2607.14881/citation-record.json","paper":"/paper/2607.14881"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.574102Z","title":"The first occurrence of Hamilton cycles in random graphs.Annals of Discrete Mathematics, 27:173–178, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.574102Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:827ef6d4d4ad45f4d12c4e49751255447c236de67bdab9393a09e0780e2029c5","observation_id":"ff051f4b-abbe-4f15-8335-925d472b19cb","resolution":{"observed_at":"2026-08-02T01:16:45.574102Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.579070Z","title":"Covering and packing in graphs","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.579070Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:14480fcf5e6b6ca3ac183011b2a7ba12809b6d92a7d3253e2887475737841e1b","observation_id":"027d1996-7944-4e96-8377-5ad7a4a7730a","resolution":{"observed_at":"2026-08-02T01:16:45.579070Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.583486Z","title":"The linear arboricity of graphs.Israel Journal of Mathematics, 62(3):311–325, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.583486Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:875e02a1306aba0eae5dda952b05e22ef6dcce4229045ef968d9d7c11535e5c0","observation_id":"5034bb4b-156f-4f33-9b69-4d6f70838f5e","resolution":{"observed_at":"2026-08-02T01:16:45.583486Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.587699Z","title":"Algorithms with large domination ratio","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.587699Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:5137cfaca474fe277a6cff9736e30e524255eeed81a114c5eb5acea59e194527","observation_id":"be940237-893e-4e35-8c1d-e15b9903ab0f","resolution":{"observed_at":"2026-08-02T01:16:45.587699Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.592239Z","title":"Spencer.The Probabilistic Method","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.592239Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:caddf42147627866c58cd26b32f32d2918d09015ee24fbd39bd85f74d45b1c3f","observation_id":"ddaf6309-6f1e-433d-a211-1b2549f77197","resolution":{"observed_at":"2026-08-02T01:16:45.592239Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.597105Z","title":"The wonderful Walecki construction.Bulletin of the Institute of Combinatorics and its Applications, 52:7–20, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.597105Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:f17faeb2a33048731a0ced7dbd26e915940c84db2a8b1805f29ca7d23916849f","observation_id":"23cd3a74-6cfb-4263-ac45-0f9eecf68358","resolution":{"observed_at":"2026-08-02T01:16:45.597105Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.601926Z","title":"The evolution of sparse graphs","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.601926Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:b85b28a4c18ac28fbfc3ef72ebdd30d907068bd06352878cb7feecb58772014b","observation_id":"e04ef64e-43e8-484b-b168-893592431bea","resolution":{"observed_at":"2026-08-02T01:16:45.601926Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.605763Z","title":"Cambridge Studies in Advanced Mathematics, volume 73","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.605763Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:3c26a61693cd6e068b6003edfca4ff294f144fd9857da7efa054bc947decd0a1","observation_id":"d6d9faff-6c74-4dc6-90a1-4d0dca1a28c8","resolution":{"observed_at":"2026-08-02T01:16:45.605763Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.609758Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.609758Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:0c8a69dc27a0a7c1d3a422758785f91f7d4207ce898025c2cadd74963faad20f","observation_id":"62184ba0-0369-4b37-b89f-2fb323167502","resolution":{"observed_at":"2026-08-02T01:16:45.609758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.20500","last_updated":"2025-07-28T03:39:30Z","snapshot_observed_at":"2026-08-15T17:40:13.035468Z","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-02T01:16:45.613827Z","title":"New bounds for linear arboricity and related problems.arXiv preprint arXiv:2507.20500, 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-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.613827Z"},"links":{"cited_paper":"/paper/2507.20500","citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:6c4601c57d13056d661870e2fb07900798cb8395d17ed6e282ca801b25dff1b3","observation_id":"16fa3c5a-e44a-497d-99a9-30256c3e0111","resolution":{"observed_at":"2026-08-02T01:16:45.613827Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.618174Z","title":"Optimal Hamilton covers and linear arboricity for random graphs.Proceedings of the American Mathematical Society, 153(3):921–935, 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-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.618174Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:490ba016a91a85a6079d23951e0522b2b75fe7a2129caa0f680a54bb5f331984","observation_id":"7c06c6fa-2187-40b3-a02e-f982053960e5","resolution":{"observed_at":"2026-08-02T01:16:45.618174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22807","last_updated":"2025-07-30T16:19:49Z","snapshot_observed_at":"2026-08-13T06:51:38.408485Z","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-10T05:28:37.752436Z","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:b86e6588d6e5918e8247867caf3dcdf187c9139105ccc1e3c05260aa0100d9e3","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.626960Z","title":"Rolling backwards can move you forward: on embedding problems in sparse expanders.Transactions of the American Mathem- atical Society, 375(7):5195–5216, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.626960Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:5a7d0e8ac89a5f94f68bec3b1bb5b5b32bc35e1589199a73d9341530d95c6496","observation_id":"eb0f2f10-6387-4158-88b2-6df33e5a08f9","resolution":{"observed_at":"2026-08-02T01:16:45.626960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.06603","last_updated":"2024-04-14T09:20:38Z","snapshot_observed_at":"2026-08-13T04:22:21.242706Z","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-02T01:16:45.630918Z","title":"Hamiltonicity of expanders: optimal bounds and applications.arXiv preprint arXiv:2402.06603, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.630918Z"},"links":{"cited_paper":"/paper/2402.06603","citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:879373a85011471850deb43d5551c84e06c7070ed5041b021009dc5092d9ba3f","observation_id":"0bd7d8d9-c00a-45b2-8836-aa4f0f4b1938","resolution":{"observed_at":"2026-08-02T01:16:45.630918Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.635442Z","title":"Towards the linear arboricity conjecture.Journal of Combinatorial Theory, Series B, 142:56–79, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.635442Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:5b47695142ea4af5afe73094840902895138a525997163edb0581d1174a15b3f","observation_id":"35c41e2b-476e-41c0-8d41-4ada354c89bd","resolution":{"observed_at":"2026-08-02T01:16:45.635442Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.639419Z","title":"Packing, counting and covering Hamilton cycles in random directed graphs.Israel Journal of Mathematics, 220:57–87, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.639419Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:4096e0715aa6cc332c7e2c72f29c96231aaf31c2bb6db74ecb2ef7a7a4611510","observation_id":"0f61c18b-1e89-4a33-abd6-4f1618654f99","resolution":{"observed_at":"2026-08-02T01:16:45.639419Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.643497Z","title":"Minimum degree edge-disjoint Hamilton cycles in random directed graphs","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-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.643497Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:3aca635ba48ee912372446ec7b09cfe3e8555b8be86de72dabcc5ee109bc5ae4","observation_id":"4c1f36b5-9fe6-4856-8c3c-c343fcdab0b3","resolution":{"observed_at":"2026-08-02T01:16:45.643497Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.647573Z","title":"Expanding graphs contain all small trees.Combinatorica, 7(1):71–76, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.647573Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:d6f81ade07bda5b84d6355edce1f201d2d75e7281cd9f2b642c3547a7d784f54","observation_id":"e27898b9-b24b-4e27-b3fa-27da7d79a694","resolution":{"observed_at":"2026-08-02T01:16:45.647573Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.651780Z","title":"On two Hamilton cycle problems in random graphs.Israel Journal of Mathematics, 166:221–234, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.651780Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:15de49e89309bc7187c931454c912d62f6286359ac5c551f5d4b22607cb283f2","observation_id":"91191a42-499a-42c9-bd12-201bf50ddbb3","resolution":{"observed_at":"2026-08-02T01:16:45.651780Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.656251Z","title":"On covering expander graphs by Hamilton cycles.Random Structures & Algorithms, 44(2):183–200, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.656251Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:1d30b0b6d5bd13a382c60e6506221264a14caf4bc994716c1d6eebbb5e077cc8","observation_id":"20d57376-18cf-4c88-9768-780bf8fdf5e7","resolution":{"observed_at":"2026-08-02T01:16:45.656251Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.660477Z","title":"Optimal path and cycle decompositions of dense quasirandom graphs.Journal of Combinatorial Theory, Series B, 118:88–108, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.660477Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:f7cc433bdefd11a743b664a7c9df0d1d571d8e92aa32008c3d64b2916c2382b6","observation_id":"c4ead7d9-d81b-4e21-ad3b-ed248676fe3d","resolution":{"observed_at":"2026-08-02T01:16:45.660477Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.665258Z","title":"TSP tour domination and Hamilton cycle decompositions of regular digraphs.Operations Research Letters, 28:107–111, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.665258Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:8d4b12bad0fe005ae4552621feab66e5891ec40766229a2d5a6cb261b9bc56a0","observation_id":"d7364714-7a12-4205-9e00-b12a18c38a92","resolution":{"observed_at":"2026-08-02T01:16:45.665258Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.669401Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.669401Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:ae01145e8de1ecf66d318889870d8b6d9f892750a6a252923c3817602c460421","observation_id":"952cf4ff-da08-444e-bb96-3b1f4d1c910a","resolution":{"observed_at":"2026-08-02T01:16:45.669401Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.673313Z","title":"Optimal covers with Hamilton cycles in random graphs.Combinatorica, 34(5):573–596, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.673313Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:dfa80805c1fcc4d80a0bb3e695db59e2fea4bdcabc65b55c31604c95ef7815f4","observation_id":"1057d634-9546-4470-8378-035ef3fd5688","resolution":{"observed_at":"2026-08-02T01:16:45.673313Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.677367Z","title":"Wiley-Interscience, New York, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.677367Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:5c42f69a57e13875839187a2352cd04e83aca84d7f20c6d1a1a278b25c78e914","observation_id":"f10cc416-5666-4a7c-9c0a-847a6722ed0b","resolution":{"observed_at":"2026-08-02T01:16:45.677367Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.681486Z","title":"A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.Journal of the ACM, 51(4):671–697, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.681486Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:25fc3235ac1df7eaeff3bdf23dbb3eb56b1a74ad0fa6ec6e669a68afa0e06fcf","observation_id":"22d7e213-3988-4641-bff2-b5f5cfeaa73a","resolution":{"observed_at":"2026-08-02T01:16:45.681486Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.685363Z","title":"Edge-disjoint Hamilton cycles in random graphs.Random Structures & Algorithms, 46(3):397–445, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.685363Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:b20d61fc9ee625c1539c48228be9d071449e7b8e8412af3743c6fcef2af299f9","observation_id":"7d77ccba-b6bd-46fb-9668-83f4e975d9e6","resolution":{"observed_at":"2026-08-02T01:16:45.685363Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.689564Z","title":"Limit distribution for the existence of Hamiltonian cycles in a random graph.Discrete Mathematics, 43(1):55–63, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.689564Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:329df2cece88d51ba0906b463286a2e457e5401444e56a353e1ef7402570aae5","observation_id":"ddfd68e2-3829-4c80-a204-1eb056f583af","resolution":{"observed_at":"2026-08-02T01:16:45.689564Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.693722Z","title":"Optimal packings of Hamilton cycles in sparse random graphs.SIAM Journal on Discrete Mathematics, 26(3):964–982, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.693722Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:fdcf9038909f5333ba339878e43cda78b766b361ca4057713d171ff4825deb2d","observation_id":"ab5b3223-004c-415c-9ab2-026e0f2c8c5a","resolution":{"observed_at":"2026-08-02T01:16:45.693722Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.697749Z","title":"Hamilton decompositions of regular expanders: applications","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.697749Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:3c4764727e856b6a408e62007289978b0fbadc510ba669d768baa3575e538087","observation_id":"e7c947ed-a974-4ec7-b267-4fb8c9b56e3f","resolution":{"observed_at":"2026-08-02T01:16:45.697749Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.701909Z","title":"An improved bound for the linear arboricity conjecture.Com- binatorica, 43(3):547–569, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.701909Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:412354c41f08b5a5d28d1b43341f07514322d1ccc5f89ab8cda5062d18e1f9f1","observation_id":"fb88e598-2c01-4657-aa7f-a27e0a40397a","resolution":{"observed_at":"2026-08-02T01:16:45.701909Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.705732Z","title":"Linear arboricity of random regular graphs.Random Struc- tures & Algorithms, 1(4):443–445, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.705732Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:dfdd3978ce46224cf9d1e4298f36a3da79eedda01ce55f2ddd0901ffc5bfa9a0","observation_id":"b5557405-7987-4998-a151-d049bf438702","resolution":{"observed_at":"2026-08-02T01:16:45.705732Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.709558Z","title":"Spanning trees in random graphs.Advances in Mathematics, 356:106793, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.709558Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:cf093e83b86cdab4159b704bc607e25bba6bfc5993e6aadc74e9c4b491300f3c","observation_id":"12872807-caee-4dcc-aa6a-f7fffdb11182","resolution":{"observed_at":"2026-08-02T01:16:45.709558Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.713463Z","title":"Moser and G´ abor Tardos","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.713463Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:3216f5b886182a54d27d800dc7752351c087e02aa42c4402e10c76998d5fdf89","observation_id":"e973efd5-83e4-4df6-9052-9adc537e021f","resolution":{"observed_at":"2026-08-02T01:16:45.713463Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.717586Z","title":"On the circuits of finite graphs.A Magyar Tudom´ anyos Akad´ emia Matematikai Kutat´ o Int´ ezet´ enek K¨ ozlem´ enyei, 8(3):355–361, 1963","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.717586Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:21dd9dc6b9d7cd6214ddd69af4689375cfbce26928d62494fcf64da6359412a9","observation_id":"fe200835-dbef-4d0f-b2bf-cc9a921526d6","resolution":{"observed_at":"2026-08-02T01:16:45.717586Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T01:16:45.721539Z","title":"Hamiltonian circuits in random graphs.Discrete Mathematics, 14(4):359–364, 1976","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T01:16:45.721539Z"},"links":{"citing_paper":"/paper/2607.14881"},"observation_digest":"sha256:1b7b864b885e3bb26a8e8e01015ee83b20af4f71ed3bc6c453cd2c6e353eeb50","observation_id":"ff2f9fe9-8400-4dbf-8d1d-fc7a13ef8dd4","resolution":{"observed_at":"2026-08-02T01:16:45.721539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.14881","last_updated":"2026-07-16T11:55:55Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T05:28:37.752436Z","submitted_at":"2026-07-16T11:55:55Z","title":"Efficient Hamilton covers and linear arboricity of random graphs"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":36},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.14881."}