{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GZWQZES4XC4JPKNX5VBU55A3UL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"53961cf5ce337617923cc590839bcc713d940790e2ccfe70de867bde0b52ddca","cross_cats_sorted":["math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-11-06T04:57:48Z","title_canon_sha256":"2a01fbb39253e1bc2ae3fb66ee966ecc033b16abcc89e4f33d3d0e69245d3d72"},"schema_version":"1.0","source":{"id":"2511.04058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.04058","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2511.04058v2","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.04058","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"GZWQZES4XC4J","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"GZWQZES4XC4JPKNX","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"GZWQZES4","created_at":"2026-06-05T00:13:44Z"}],"graph_snapshots":[{"event_id":"sha256:f57750f9977320867e2f9920876b3b978b7382ba9b77f172471891c8a3d456bd","target":"graph","created_at":"2026-06-05T00:13:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.04058/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Colin Sandon, Dana Yang, Jiaming Xu, Julia Gaudio","cross_cats":["math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-11-06T04:57:48Z","title":"Finding Planted Cycles in a Random Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.04058","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3ae0a0ee96a7d5fe744c08c09e3f62331635f6164dedd5322813231f05b74067","target":"record","created_at":"2026-06-05T00:13:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"53961cf5ce337617923cc590839bcc713d940790e2ccfe70de867bde0b52ddca","cross_cats_sorted":["math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-11-06T04:57:48Z","title_canon_sha256":"2a01fbb39253e1bc2ae3fb66ee966ecc033b16abcc89e4f33d3d0e69245d3d72"},"schema_version":"1.0","source":{"id":"2511.04058","kind":"arxiv","version":2}},"canonical_sha256":"366d0c925cb8b897a9b7ed434ef41ba2d7e5ef72dae0f6765770726deca0e020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"366d0c925cb8b897a9b7ed434ef41ba2d7e5ef72dae0f6765770726deca0e020","first_computed_at":"2026-06-05T00:13:44.250430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T00:13:44.250430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/cNRUdFmLEqB0GJ6KIPLVKOYNlDgYHWawMSl///XVyVBAT3TF/lskP/r/LHYBC86cae2i6wVafBnxYWTT0K4Dw==","signature_status":"signed_v1","signed_at":"2026-06-05T00:13:44.251005Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.04058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae0a0ee96a7d5fe744c08c09e3f62331635f6164dedd5322813231f05b74067","sha256:f57750f9977320867e2f9920876b3b978b7382ba9b77f172471891c8a3d456bd"],"state_sha256":"28a61720f7c83714b3cc528d8b45699b441e7783666ee91201c7d3da12fa6fb6"}