{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3KP6LBG6FNOAWWGTSHCUNQHLU6","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":"f2a8e337b0b32921c728b072882a3bdd8f379610e9051875bcd5547ab393e20c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-14T18:22:44Z","title_canon_sha256":"9111f4abb7cdabc692f820878d03594739d7d0c51d2fce876e8da6d59e3602b6"},"schema_version":"1.0","source":{"id":"2605.15309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15309","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15309v1","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15309","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"3KP6LBG6FNOA","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_16","alias_value":"3KP6LBG6FNOAWWGT","created_at":"2026-05-20T00:00:51Z"},{"alias_kind":"pith_short_8","alias_value":"3KP6LBG6","created_at":"2026-05-20T00:00:51Z"}],"graph_snapshots":[{"event_id":"sha256:62ed1f485faed4866024e50e0e9ab58aaf3e0dd594c05eb49f6ea75a8ba5a63a","target":"graph","created_at":"2026-05-20T00:00:51Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Integrated with Implicit Maximum Likelihood Estimation (IMLE), RTM achieves the highest precision and recall among current state-of-the-art approaches while maintaining competitive FID, with improvements across CIFAR-10, CelebA-HQ at 256x256, and nine few-shot benchmarks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That performing multiple refinement iterations on the latent code will reliably increase mode coverage without destabilizing training or introducing new failure modes, an assumption invoked when the abstract states that recursive refinement improves both quality and diversity simultaneously."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RTM uses iterative refinement of latent codes in generative models to improve both precision and recall alongside competitive FID scores on CIFAR-10, CelebA-HQ, and few-shot datasets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Replacing a single latent mapping with iterative refinement improves both image quality and diversity in generative models."}],"snapshot_sha256":"17ead99734692e13172254fb7d3fdecbccc39afd83ed167bc5eec80c9e715e6f"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"796a7de57aaea1f5ad5a664c6356219075768a1219ffdc430ed4ad4e26ed497f"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.337674Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:27:02.181306Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.221424Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.775458Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15309/integrity.json","findings":[],"snapshot_sha256":"2aa583ce83e7b8849470707e84440a05d2705d0a3807045d053f45487617cdf7","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Despite remarkable progress, image generation is far from solved. The dominant metric, FID, conflates sample fidelity with mode coverage and is close to being saturated. Yet a model can still exhibit mode collapse while achieving a low FID, since a handful of sharp, near-duplicate images can outscore a model that faithfully covers the full data distribution. We argue that precision and recall are essential complements to FID, and that because FID is already saturated, the more meaningful goal is to improve diversity and coverage. Achieving high recall requires a model that explicitly prioritiz","authors_text":"Alexia Jolicoeur-Martineau, Chirag Vashist, Ke Li, Mehdi Esmaeilzadeh","cross_cats":[],"headline":"Replacing a single latent mapping with iterative refinement improves both image quality and diversity in generative models.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-14T18:22:44Z","title":"One Pass Is Not Enough: Recursive Latent Refinement for Generative Models"},"references":{"count":12,"internal_anchors":6,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Generative recursive reasoning models.ICLR 2026 Workshop on AI with Recursive Self-Improvement,","work_id":"cb02306d-a847-4ca0-83ff-bcbf459d13c4","year":2026},{"cited_arxiv_id":"2505.13447","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Mean Flows for One-step Generative Modeling","work_id":"07a52ad5-0f82-4095-9a66-559b09fea1ae","year":null},{"cited_arxiv_id":"1701.00160","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Goodfellow, Nips 2016 tutorial: Generative adversarial networks (2017), arXiv:1701.00160 [cs.LG]","work_id":"d8b51fd9-7758-41a2-aa2b-f4d5302f7b10","year":2016},{"cited_arxiv_id":"2510.04871","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Less is More: Recursive Reasoning with Tiny Networks","work_id":"749dbba1-fbff-4b07-a1a7-9ccf98494da2","year":null},{"cited_arxiv_id":"1809.09087","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Implicit Maximum Likelihood Estimation","work_id":"b193191f-f3fe-433b-a8d4-eef0f7cde7ef","year":null}],"snapshot_sha256":"f9268c37784e1b52c3bc39331a47deed5e691b8f07e6038937a7575cd73c07f2"},"source":{"id":"2605.15309","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:16:01.327047Z","id":"4273cb8e-3fe5-4040-837c-ed32f30c2bd7","model_set":{"reader":"grok-4.3"},"one_line_summary":"RTM uses iterative refinement of latent codes in generative models to improve both precision and recall alongside competitive FID scores on CIFAR-10, CelebA-HQ, and few-shot datasets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Replacing a single latent mapping with iterative refinement improves both image quality and diversity in generative models.","strongest_claim":"Integrated with Implicit Maximum Likelihood Estimation (IMLE), RTM achieves the highest precision and recall among current state-of-the-art approaches while maintaining competitive FID, with improvements across CIFAR-10, CelebA-HQ at 256x256, and nine few-shot benchmarks.","weakest_assumption":"That performing multiple refinement iterations on the latent code will reliably increase mode coverage without destabilizing training or introducing new failure modes, an assumption invoked when the abstract states that recursive refinement improves both quality and diversity simultaneously."}},"verdict_id":"4273cb8e-3fe5-4040-837c-ed32f30c2bd7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b7e87dc814c85713f4032f2c5aa4079b21a9158be7d7bc71f8b0dc2944d280b9","target":"record","created_at":"2026-05-20T00:00:51Z","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":"f2a8e337b0b32921c728b072882a3bdd8f379610e9051875bcd5547ab393e20c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-14T18:22:44Z","title_canon_sha256":"9111f4abb7cdabc692f820878d03594739d7d0c51d2fce876e8da6d59e3602b6"},"schema_version":"1.0","source":{"id":"2605.15309","kind":"arxiv","version":1}},"canonical_sha256":"da9fe584de2b5c0b58d391c546c0eba7bcc3eb9f66c4597e0268257b795773f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da9fe584de2b5c0b58d391c546c0eba7bcc3eb9f66c4597e0268257b795773f8","first_computed_at":"2026-05-20T00:00:51.898791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:51.898791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iAp/4HHijnr7SA+QKlRnPe+IwjOKhVDYDY/Zr/zGJW/OPIfol7Kz2WaYZfQVyxU1YekeWi5dEGTuq5YZ9N6MBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:51.899535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e87dc814c85713f4032f2c5aa4079b21a9158be7d7bc71f8b0dc2944d280b9","sha256:62ed1f485faed4866024e50e0e9ab58aaf3e0dd594c05eb49f6ea75a8ba5a63a"],"state_sha256":"65c8fa65f0edacf4f3c4bd1e3db4b792cd8c2a20957f9e829f6867208e57ebe6"}