{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TOBULS6QQMXSXWNMJ4NGAOJ2FY","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":"e0b10bf98c8626f8a46240256d19f55f7c26b4573b4631eeb560b04b0c0a18b3","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-03-12T01:31:27Z","title_canon_sha256":"deca4f9047f9436fdc4ffd732cee62cea2cb55a5395b8680b8a54b82eff49463"},"schema_version":"1.0","source":{"id":"2503.08984","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08984","created_at":"2026-06-05T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08984v3","created_at":"2026-06-05T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08984","created_at":"2026-06-05T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"TOBULS6QQMXS","created_at":"2026-06-05T00:13:43Z"},{"alias_kind":"pith_short_16","alias_value":"TOBULS6QQMXSXWNM","created_at":"2026-06-05T00:13:43Z"},{"alias_kind":"pith_short_8","alias_value":"TOBULS6Q","created_at":"2026-06-05T00:13:43Z"}],"graph_snapshots":[{"event_id":"sha256:5af16b7b709c147663368c514aa926a88bd939b1f0c56f4c7629b3cc459674fc","target":"graph","created_at":"2026-06-05T00:13:43Z","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/2503.08984/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the problem of inferring a $k$-factor, specifically a spanning $k$-regular graph, planted within an Erdos-Renyi random graph $G(n,\\lambda/n)$. We show that as the average degree $\\lambda$ surpasses the critical threshold of $1/k$, the inference problem undergoes a transition from almost exact recovery to partial recovery. Moreover, as $\\lambda$ tends to infinity, the accuracy of recovery diminishes to zero. In addition, we characterize the recovery accuracy of a linear-time iterative pruning algorithm and show that it achieves almost exact recovery when $\\lambda < 1/k$. A ke","authors_text":"Colin Sandon, Dana Yang, Jiaming Xu, Julia Gaudio","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-03-12T01:31:27Z","title":"Phase Transitions in Planted k-Factor Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08984","kind":"arxiv","version":3},"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:f1ed9be64d6c63812a07cddeed8cdf4813512e6728dc1631588048a99aaf8f77","target":"record","created_at":"2026-06-05T00:13:43Z","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":"e0b10bf98c8626f8a46240256d19f55f7c26b4573b4631eeb560b04b0c0a18b3","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-03-12T01:31:27Z","title_canon_sha256":"deca4f9047f9436fdc4ffd732cee62cea2cb55a5395b8680b8a54b82eff49463"},"schema_version":"1.0","source":{"id":"2503.08984","kind":"arxiv","version":3}},"canonical_sha256":"9b8345cbd0832f2bd9ac4f1a60393a2e1d115d515830059c306bc4c03dc07fda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b8345cbd0832f2bd9ac4f1a60393a2e1d115d515830059c306bc4c03dc07fda","first_computed_at":"2026-06-05T00:13:43.450891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T00:13:43.450891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZMiRbCQDQoRnwqZgSxgYUcTKqrj4JLgefPJMQxnyDNQYzoByBCqhSyzJ4a+Wl80L3KM+sfGYy8qEOkO6XCf7Aw==","signature_status":"signed_v1","signed_at":"2026-06-05T00:13:43.451466Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.08984","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1ed9be64d6c63812a07cddeed8cdf4813512e6728dc1631588048a99aaf8f77","sha256:5af16b7b709c147663368c514aa926a88bd939b1f0c56f4c7629b3cc459674fc"],"state_sha256":"e1f08cd984984fe38b37a281da4e4927ff456af0594550389abc27db2c471568"}