{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GZWQZES4XC4JPKNX5VBU55A3UL","short_pith_number":"pith:GZWQZES4","schema_version":"1.0","canonical_sha256":"366d0c925cb8b897a9b7ed434ef41ba2d7e5ef72dae0f6765770726deca0e020","source":{"kind":"arxiv","id":"2511.04058","version":2},"attestation_state":"computed","paper":{"title":"Finding Planted Cycles in a Random Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Colin Sandon, Dana Yang, Jiaming Xu, Julia Gaudio","submitted_at":"2025-11-06T04:57:48Z","abstract_excerpt":"In this paper, we study the problem of finding a collection of planted cycles in an \\ER random graph $G \\sim \\mathcal{G}(n, \\lambda/n)$, in analogy to the famous Planted Clique Problem. When the cycles are planted on a uniformly random subset of $\\delta n$ vertices, we show that almost-exact recovery (that is, recovering all but a vanishing fraction of planted-cycle edges as $n \\to \\infty$) is information-theoretically possible if $\\lambda < \\frac{1}{(\\sqrt{2 \\delta} + \\sqrt{1-\\delta})^2}$ and impossible if $\\lambda > \\frac{1}{(\\sqrt{2 \\delta} + \\sqrt{1-\\delta})^2}$. Moreover, despite the wors"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.04058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-11-06T04:57:48Z","cross_cats_sorted":["math.PR","stat.TH"],"title_canon_sha256":"2a01fbb39253e1bc2ae3fb66ee966ecc033b16abcc89e4f33d3d0e69245d3d72","abstract_canon_sha256":"53961cf5ce337617923cc590839bcc713d940790e2ccfe70de867bde0b52ddca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T00:13:44.251005Z","signature_b64":"/cNRUdFmLEqB0GJ6KIPLVKOYNlDgYHWawMSl///XVyVBAT3TF/lskP/r/LHYBC86cae2i6wVafBnxYWTT0K4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"366d0c925cb8b897a9b7ed434ef41ba2d7e5ef72dae0f6765770726deca0e020","last_reissued_at":"2026-06-05T00:13:44.250430Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T00:13:44.250430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Planted Cycles in a Random Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Colin Sandon, Dana Yang, Jiaming Xu, Julia Gaudio","submitted_at":"2025-11-06T04:57:48Z","abstract_excerpt":"In this paper, we study the problem of finding a collection of planted cycles in an \\ER random graph $G \\sim \\mathcal{G}(n, \\lambda/n)$, in analogy to the famous Planted Clique Problem. When the cycles are planted on a uniformly random subset of $\\delta n$ vertices, we show that almost-exact recovery (that is, recovering all but a vanishing fraction of planted-cycle edges as $n \\to \\infty$) is information-theoretically possible if $\\lambda < \\frac{1}{(\\sqrt{2 \\delta} + \\sqrt{1-\\delta})^2}$ and impossible if $\\lambda > \\frac{1}{(\\sqrt{2 \\delta} + \\sqrt{1-\\delta})^2}$. Moreover, despite the wors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.04058","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.04058/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.04058","created_at":"2026-06-05T00:13:44.250510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.04058v2","created_at":"2026-06-05T00:13:44.250510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.04058","created_at":"2026-06-05T00:13:44.250510+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZWQZES4XC4J","created_at":"2026-06-05T00:13:44.250510+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZWQZES4XC4JPKNX","created_at":"2026-06-05T00:13:44.250510+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZWQZES4","created_at":"2026-06-05T00:13:44.250510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL","json":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL.json","graph_json":"https://pith.science/api/pith-number/GZWQZES4XC4JPKNX5VBU55A3UL/graph.json","events_json":"https://pith.science/api/pith-number/GZWQZES4XC4JPKNX5VBU55A3UL/events.json","paper":"https://pith.science/paper/GZWQZES4"},"agent_actions":{"view_html":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL","download_json":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL.json","view_paper":"https://pith.science/paper/GZWQZES4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.04058&json=true","fetch_graph":"https://pith.science/api/pith-number/GZWQZES4XC4JPKNX5VBU55A3UL/graph.json","fetch_events":"https://pith.science/api/pith-number/GZWQZES4XC4JPKNX5VBU55A3UL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL/action/storage_attestation","attest_author":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL/action/author_attestation","sign_citation":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL/action/citation_signature","submit_replication":"https://pith.science/pith/GZWQZES4XC4JPKNX5VBU55A3UL/action/replication_record"}},"created_at":"2026-06-05T00:13:44.250510+00:00","updated_at":"2026-06-05T00:13:44.250510+00:00"}