{"as_of":"2026-08-21T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9809ceb2b0d5ac333fcaad0b26cd4cd70e6743b517dcfefe1b717c6ae4415f51","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T23:57:55.019367Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2511.04058/citation-record","integrity":"/paper/2511.04058/integrity","json":"/paper/2511.04058/citation-record.json","paper":"/paper/2511.04058"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:57:53.039104Z","title":"Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3-4):457–466, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.039104Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:bf58ad3729e6a2188c67e1d425bfd5ae576f611eea0cfd71f66e6301c3efc210","observation_id":"e93f1ee2-914b-435c-86e2-c59bde20b36c","resolution":{"observed_at":"2026-08-03T23:57:53.039104Z","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-03T23:57:53.168703Z","title":"Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.168703Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:242520dbb61ea9f4cc3cb99e5ff421302acbe5b807eeecc9acc895502b672e7d","observation_id":"8bd44219-5e5d-46ac-9121-b903d7b772f6","resolution":{"observed_at":"2026-08-03T23:57:53.168703Z","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-03T23:57:53.254560Z","title":"A note on long cycles in sparse random graphs.Electronic Journal of Combinatorics, 30(2), 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.254560Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:0a8faac36b5173154e86183162d788d8fb630fda73110a9989e1d21368e14bf1","observation_id":"89adc43a-b5da-4b06-89c0-5044a3277278","resolution":{"observed_at":"2026-08-03T23:57:53.254560Z","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-03T23:57:53.331302Z","title":"A scaling limit for the length of the longest cycle in a sparse random graph","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.331302Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:60f77f1942c1ef70181976d5f24a9f5d98460e8152bf62872bf02c5063eb88b3","observation_id":"60dac7c3-b57d-4584-85eb-679f6b419c52","resolution":{"observed_at":"2026-08-03T23:57:53.331302Z","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-03T23:57:53.418427Z","title":"A nearly tight sum-of-squares lower bound for the planted clique problem.SIAM Journal on Computing, 48(2):687–735, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.418427Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:7e91f77327502b022286a729b8a1bd29a94dcf1a72687be8f25227a0a615ff97","observation_id":"00ad5f5b-02c5-4610-a3f8-6c39abd4eb44","resolution":{"observed_at":"2026-08-03T23:57:53.418427Z","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-03T23:57:53.553998Z","title":"Springer, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.553998Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:3eb44600841ec5ece707db62be4d1b65e1121253e1b03e810a812484c815b4a8","observation_id":"a4fa0b1c-953b-4d7c-8056-b8a5c301b7e1","resolution":{"observed_at":"2026-08-03T23:57:53.553998Z","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-03T23:57:53.613857Z","title":"Long cycles in sparse random graphs.Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, pages 59–64, 1984","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.613857Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:7d09e62e5996e001acf14282a8cf5596be85b3e191c149db3043ba2e29e71ba5","observation_id":"c8dde355-3271-46da-b8da-d1426ea53635","resolution":{"observed_at":"2026-08-03T23:57:53.613857Z","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-03T23:57:53.672426Z","title":"Statistical and computational phase transitions in group testing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.672426Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:e9b006179aeada9eefce64a4597877c48a3efeb543e3ba6cae6eb3bd4d993605","observation_id":"d63385e7-0000-47c7-92a0-e81a880097c0","resolution":{"observed_at":"2026-08-03T23:57:53.672426Z","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-03T23:57:53.761328Z","title":"The planted matching problem: Sharp threshold and infinite-order phase transition.Probability Theory and Related Fields, pages 1–71, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.761328Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:1673c4bd0f0e19910eb29a76ea7bbeef4ab36383e95dd724399ad20ae1b201b4","observation_id":"4d0d67d1-5b8d-4454-8661-f1b3d72fe117","resolution":{"observed_at":"2026-08-03T23:57:53.761328Z","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-03T23:57:53.842650Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.842650Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:fa58e87fcc609518cde27455a12854c845d9e1ece36eef03e30b4d83f161a5f8","observation_id":"7c5360d9-01eb-4a79-8cd6-ef56e3b90057","resolution":{"observed_at":"2026-08-03T23:57:53.842650Z","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-03T23:57:53.935083Z","title":"On the evolution of random graphs.Publ","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:53.935083Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:e9d03803067d5fc63e227de78b1241177bf3dbaadce2e84de75d2598e435e431","observation_id":"e467b4fb-1ce6-4bfa-ac23-ace27ef0c490","resolution":{"observed_at":"2026-08-03T23:57:53.935083Z","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-03T23:57:54.057993Z","title":"On large matchings and cycles in sparse random graphs.Discrete Mathematics, 59(3):243–256, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.057993Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:e46eaf6ad4913719b277ec704e849b367014c8f96113ba750b40315ae953df36","observation_id":"615c626f-2d14-40be-a99c-a8ee26b1e46f","resolution":{"observed_at":"2026-08-03T23:57:54.057993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.08984","last_updated":"2026-06-03T19:42:20Z","snapshot_observed_at":"2026-08-16T12:50:55.329777Z","submitted_at":"2025-03-12T01:31:27Z","title":"Phase Transitions in Planted k-Factor Recovery","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.08984","snapshot_observed_at":"2026-08-03T23:57:54.164560Z","title":"All-Something-Nothing","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.164560Z"},"links":{"cited_paper":"/paper/2503.08984","citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:ab6e8a178c5e8998a09628e2ed02748ab72bc01ba02bc3ee45934fc2d610c02c","observation_id":"0466ad49-e97a-4706-a692-96bfee93fb64","resolution":{"observed_at":"2026-08-03T23:57:54.164560Z","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-03T23:57:54.255331Z","title":"Large cliques elude the metropolis process.Random Structures & Algorithms, 3(4):347–359, 1992","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.255331Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:0b9477024feb37acc5cc197b4e64317d6c9111402b9998dc2c947c1f71d597d9","observation_id":"fbf779d1-068b-45f8-b568-4b78e7fbc6eb","resolution":{"observed_at":"2026-08-03T23:57:54.255331Z","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-03T23:57:54.359706Z","title":"The probabilistic analysis of some combinatorial search algorithms","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.359706Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:4716eed0de530a937cfc0bd7894c36cfdfc36bae372673c427cf37840fde39a9","observation_id":"ed26f6be-9154-4d42-8c35-9d9e5449987c","resolution":{"observed_at":"2026-08-03T23:57:54.359706Z","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-03T23:57:54.408013Z","title":"Moves without forbidden transitions in a graph.Matematick` y Časopis, 18(1):76–80, 1968","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.408013Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:75ff2a2ee8b9b85fb47a5235f01e0ca4dbe7dc9de566a9dd3a2acf15874713bc","observation_id":"596afbcd-33ab-4032-9833-59d579759c00","resolution":{"observed_at":"2026-08-03T23:57:54.408013Z","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-03T23:57:54.508946Z","title":"Long paths and cycles in random subgraphs of graphs with large minimum degree.Random Structures & Algorithms, 46(2):320–345, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.508946Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:005be312dad5bb2d411ad6406149613e68fb070293e259ae1e4f4ed06f275b49","observation_id":"601a6a7c-7b04-41d0-955a-67a1816ff5d7","resolution":{"observed_at":"2026-08-03T23:57:54.508946Z","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-03T23:57:54.570859Z","title":"Expected complexity of graph partitioning problems.Discrete Applied Mathematics, 57(2-3):193– 212, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.570859Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:bf57898754a47d875076e8d46380835d530a54e18a9fe4e915f7683deac51191","observation_id":"6ec9e13c-21ed-4c28-a20d-e71b783c2127","resolution":{"observed_at":"2026-08-03T23:57:54.570859Z","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-03T23:57:54.641402Z","title":"Detection-recovery gap for planted dense cycles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.641402Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:68f70d2addcaabc6c4ad383ae5eb5933b431659ff753fe5286f338b98e49b441","observation_id":"34e7766c-1289-40af-be4f-164aebbe9703","resolution":{"observed_at":"2026-08-03T23:57:54.641402Z","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-03T23:57:54.698938Z","title":"Information-theoretic thresholds for planted dense cycles","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.698938Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:f8e65516c575b76c276191f0dfcc8885e96582f85b7e7f2ed65764880962a99f","observation_id":"702a6c92-f999-4a96-a5de-c2816478b521","resolution":{"observed_at":"2026-08-03T23:57:54.698938Z","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-03T23:57:54.756172Z","title":"The planted matching problem: Phase transitions and exact results.The Annals of Applied Probability, 31(6):2663–2720, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.756172Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:d6d81ff81c919282747966c6ac32dc2033210b784e54c16adf289afc562a7257","observation_id":"0e2a0811-21c6-4f84-a56f-8091ebe74dc7","resolution":{"observed_at":"2026-08-03T23:57:54.756172Z","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-03T23:57:54.778019Z","title":"Sharp thresholds in inference of planted subgraphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.778019Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:c0fb2fc02310c252682c35e6ad645ec6d81d24b79d656162e76c52628a3fe752","observation_id":"dff2341c-6b40-4b54-89c5-453f4c827417","resolution":{"observed_at":"2026-08-03T23:57:54.778019Z","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-03T23:57:54.839857Z","title":"The All-or-Nothing phenomenon in sparse tensor PCA.Advances in Neural Information Processing Systems, 33:17674–17684, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.839857Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:f8d7091be0808b066f4c272e65ad38f138952237c4532bdbc25591b93e776145","observation_id":"fc44ba0b-a54d-4eec-b742-f58faa48bb56","resolution":{"observed_at":"2026-08-03T23:57:54.839857Z","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-03T23:57:54.899238Z","title":"The all-or-nothing phenomenon in sparse linear regression.Mathe- matical Statistics and Learning, 3(3):259–313, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.899238Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:10019d60c2291a35a66995549f704664c94039292696b2d511ff35f763b8c1a8","observation_id":"2f0a0ed7-ec66-4e26-abf8-69ddb72745f3","resolution":{"observed_at":"2026-08-03T23:57:54.899238Z","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-03T23:57:54.998341Z","title":"On the All-or-Nothing behavior of Bernoulli group testing.IEEE Journal on Selected Areas in Information Theory, 1(3):669–680, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:54.998341Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:b9ad8094951b93e0a33cb2019d27e9365cce0c0554395aeaf4d7e72056966bb3","observation_id":"674602bd-10ce-48b4-bfcd-da6f4755fe04","resolution":{"observed_at":"2026-08-03T23:57:54.998341Z","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-03T23:57:55.019367Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T23:57:55.019367Z"},"links":{"citing_paper":"/paper/2511.04058"},"observation_digest":"sha256:fc17d0e05a84e55b542637612839cf880e71882688ac342d0c6f3517ef4b4605","observation_id":"bbb5ec4c-4cc6-466f-be7c-186e80f5d452","resolution":{"observed_at":"2026-08-03T23:57:55.019367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.04058","last_updated":"2026-06-03T19:11:49Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-14T22:17:48.885233Z","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":26},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2511.04058."}