{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VBTBECI43ZLD4XJICIQQU46PZX","short_pith_number":"pith:VBTBECI4","canonical_record":{"source":{"id":"2604.13030","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-04-14T17:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"882a87b9ada1a0488dcca7fa5e5ec821c4a407cfbb87e48990287d81c6e2d0f4","abstract_canon_sha256":"977f9bb339fa6c6087184224f4f8e59ed2abb726d43fe819f15aecea94e8ea88"},"schema_version":"1.0"},"canonical_sha256":"a86612091cde563e5d2812210a73cfcdf08fd236a37537eb4b2877df9e556ca5","source":{"kind":"arxiv","id":"2604.13030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13030","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13030v2","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13030","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"pith_short_12","alias_value":"VBTBECI43ZLD","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"pith_short_16","alias_value":"VBTBECI43ZLD4XJI","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"pith_short_8","alias_value":"VBTBECI4","created_at":"2026-07-08T01:19:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VBTBECI43ZLD4XJICIQQU46PZX","target":"record","payload":{"canonical_record":{"source":{"id":"2604.13030","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-04-14T17:59:03Z","cross_cats_sorted":[],"title_canon_sha256":"882a87b9ada1a0488dcca7fa5e5ec821c4a407cfbb87e48990287d81c6e2d0f4","abstract_canon_sha256":"977f9bb339fa6c6087184224f4f8e59ed2abb726d43fe819f15aecea94e8ea88"},"schema_version":"1.0"},"canonical_sha256":"a86612091cde563e5d2812210a73cfcdf08fd236a37537eb4b2877df9e556ca5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:19:12.859752Z","signature_b64":"x8tuQMmsvPvaBqG8zO5LkCIhyTr4S/NvnaQpLs4e9MqJ7obGPq+rHPtm04p5JS5q25kE/flAHw1nGGtX8wUGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86612091cde563e5d2812210a73cfcdf08fd236a37537eb4b2877df9e556ca5","last_reissued_at":"2026-07-08T01:19:12.859218Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:19:12.859218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.13030","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-08T01:19:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFrYNl7u603ogW6wyO0JJH+t1fU9+domPmEUUvH/AKjvVaq1tXIXw8MgvRLZz7lnH7RlOpj59oYwyrr8QFP5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:53:14.410336Z"},"content_sha256":"e70679fa1ac34987952e399690341e8963d9884b32276dd3b8f9ce8931a90486","schema_version":"1.0","event_id":"sha256:e70679fa1ac34987952e399690341e8963d9884b32276dd3b8f9ce8931a90486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VBTBECI43ZLD4XJICIQQU46PZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Refinement Networks for Visual Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Generative Refinement Networks combine near-lossless quantization with global refinement to surpass diffusion and autoregressive models in visual synthesis.","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bingyue Peng, Jiahuan Wang, Jian Han, Jinlai Liu, Zehuan Yuan","submitted_at":"2026-04-14T17:59:03Z","abstract_excerpt":"While diffusion models dominate the field of visual generation, they are computationally inefficient, applying a uniform computational effort regardless of different complexity. In contrast, autoregressive (AR) models are inherently complexity-aware, as evidenced by their variable likelihoods, but are often hindered by lossy discrete tokenization and error accumulation. In this work, we introduce Generative Refinement Networks (GRN), a next-generation visual synthesis paradigm that addresses these issues. At its core, GRN addresses the discrete tokenization bottleneck through a theoretically n"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On the ImageNet benchmark, GRN establishes new records in image reconstruction (0.56 rFID) and class-conditional image generation (1.81 gFID). We also scale GRN to more challenging text-to-image and text-to-video generation, delivering superior performance on an equivalent scale.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the Hierarchical Binary Quantization is theoretically near-lossless and that the global refinement mechanism corrects errors without introducing new accumulation problems or requiring post-hoc tuning that affects the reported metrics.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GRN uses hierarchical binary quantization and entropy-guided refinement to set new ImageNet records of 0.56 rFID for reconstruction and 1.81 gFID for class-conditional generation while releasing code and models.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Generative Refinement Networks combine near-lossless quantization with global refinement to surpass diffusion and autoregressive models in visual synthesis.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7237182ebe3a0838a0eb5990bbc9ea321f13487929f1ffe114e96713404a2a84"},"source":{"id":"2604.13030","kind":"arxiv","version":2},"verdict":{"id":"b00fa9a5-57b3-449e-a0aa-8aa439dde081","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T15:37:19.049077Z","strongest_claim":"On the ImageNet benchmark, GRN establishes new records in image reconstruction (0.56 rFID) and class-conditional image generation (1.81 gFID). We also scale GRN to more challenging text-to-image and text-to-video generation, delivering superior performance on an equivalent scale.","one_line_summary":"GRN uses hierarchical binary quantization and entropy-guided refinement to set new ImageNet records of 0.56 rFID for reconstruction and 1.81 gFID for class-conditional generation while releasing code and models.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the Hierarchical Binary Quantization is theoretically near-lossless and that the global refinement mechanism corrects errors without introducing new accumulation problems or requiring post-hoc tuning that affects the reported metrics.","pith_extraction_headline":"Generative Refinement Networks combine near-lossless quantization with global refinement to surpass diffusion and autoregressive models in visual synthesis."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.13030/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"},"verdict_id":"b00fa9a5-57b3-449e-a0aa-8aa439dde081"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-08T01:19:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"erAis3tFD1ucx4g+OqcDVXiILXBUWLEIlJv4J3ahwq5SuR4zk9gBWMscTRdnqfb+tiM8ZScVRExQra/6oKhSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:53:14.410962Z"},"content_sha256":"767659e57552bda109f0dfcacca7443855fb2f209d4b77d2297e42d225cf3d22","schema_version":"1.0","event_id":"sha256:767659e57552bda109f0dfcacca7443855fb2f209d4b77d2297e42d225cf3d22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBTBECI43ZLD4XJICIQQU46PZX/bundle.json","state_url":"https://pith.science/pith/VBTBECI43ZLD4XJICIQQU46PZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBTBECI43ZLD4XJICIQQU46PZX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T09:53:14Z","links":{"resolver":"https://pith.science/pith/VBTBECI43ZLD4XJICIQQU46PZX","bundle":"https://pith.science/pith/VBTBECI43ZLD4XJICIQQU46PZX/bundle.json","state":"https://pith.science/pith/VBTBECI43ZLD4XJICIQQU46PZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBTBECI43ZLD4XJICIQQU46PZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VBTBECI43ZLD4XJICIQQU46PZX","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":"977f9bb339fa6c6087184224f4f8e59ed2abb726d43fe819f15aecea94e8ea88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-04-14T17:59:03Z","title_canon_sha256":"882a87b9ada1a0488dcca7fa5e5ec821c4a407cfbb87e48990287d81c6e2d0f4"},"schema_version":"1.0","source":{"id":"2604.13030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13030","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13030v2","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13030","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"pith_short_12","alias_value":"VBTBECI43ZLD","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"pith_short_16","alias_value":"VBTBECI43ZLD4XJI","created_at":"2026-07-08T01:19:12Z"},{"alias_kind":"pith_short_8","alias_value":"VBTBECI4","created_at":"2026-07-08T01:19:12Z"}],"graph_snapshots":[{"event_id":"sha256:767659e57552bda109f0dfcacca7443855fb2f209d4b77d2297e42d225cf3d22","target":"graph","created_at":"2026-07-08T01:19:12Z","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":"On the ImageNet benchmark, GRN establishes new records in image reconstruction (0.56 rFID) and class-conditional image generation (1.81 gFID). We also scale GRN to more challenging text-to-image and text-to-video generation, delivering superior performance on an equivalent scale."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the Hierarchical Binary Quantization is theoretically near-lossless and that the global refinement mechanism corrects errors without introducing new accumulation problems or requiring post-hoc tuning that affects the reported metrics."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GRN uses hierarchical binary quantization and entropy-guided refinement to set new ImageNet records of 0.56 rFID for reconstruction and 1.81 gFID for class-conditional generation while releasing code and models."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Generative Refinement Networks combine near-lossless quantization with global refinement to surpass diffusion and autoregressive models in visual synthesis."}],"snapshot_sha256":"7237182ebe3a0838a0eb5990bbc9ea321f13487929f1ffe114e96713404a2a84"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.13030/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While diffusion models dominate the field of visual generation, they are computationally inefficient, applying a uniform computational effort regardless of different complexity. In contrast, autoregressive (AR) models are inherently complexity-aware, as evidenced by their variable likelihoods, but are often hindered by lossy discrete tokenization and error accumulation. In this work, we introduce Generative Refinement Networks (GRN), a next-generation visual synthesis paradigm that addresses these issues. At its core, GRN addresses the discrete tokenization bottleneck through a theoretically n","authors_text":"Bingyue Peng, Jiahuan Wang, Jian Han, Jinlai Liu, Zehuan Yuan","cross_cats":[],"headline":"Generative Refinement Networks combine near-lossless quantization with global refinement to surpass diffusion and autoregressive models in visual synthesis.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-04-14T17:59:03Z","title":"Generative Refinement Networks for Visual Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.13030","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:37:19.049077Z","id":"b00fa9a5-57b3-449e-a0aa-8aa439dde081","model_set":{"reader":"grok-4.3"},"one_line_summary":"GRN uses hierarchical binary quantization and entropy-guided refinement to set new ImageNet records of 0.56 rFID for reconstruction and 1.81 gFID for class-conditional generation while releasing code and models.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Generative Refinement Networks combine near-lossless quantization with global refinement to surpass diffusion and autoregressive models in visual synthesis.","strongest_claim":"On the ImageNet benchmark, GRN establishes new records in image reconstruction (0.56 rFID) and class-conditional image generation (1.81 gFID). We also scale GRN to more challenging text-to-image and text-to-video generation, delivering superior performance on an equivalent scale.","weakest_assumption":"That the Hierarchical Binary Quantization is theoretically near-lossless and that the global refinement mechanism corrects errors without introducing new accumulation problems or requiring post-hoc tuning that affects the reported metrics."}},"verdict_id":"b00fa9a5-57b3-449e-a0aa-8aa439dde081"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e70679fa1ac34987952e399690341e8963d9884b32276dd3b8f9ce8931a90486","target":"record","created_at":"2026-07-08T01:19:12Z","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":"977f9bb339fa6c6087184224f4f8e59ed2abb726d43fe819f15aecea94e8ea88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-04-14T17:59:03Z","title_canon_sha256":"882a87b9ada1a0488dcca7fa5e5ec821c4a407cfbb87e48990287d81c6e2d0f4"},"schema_version":"1.0","source":{"id":"2604.13030","kind":"arxiv","version":2}},"canonical_sha256":"a86612091cde563e5d2812210a73cfcdf08fd236a37537eb4b2877df9e556ca5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a86612091cde563e5d2812210a73cfcdf08fd236a37537eb4b2877df9e556ca5","first_computed_at":"2026-07-08T01:19:12.859218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:19:12.859218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8tuQMmsvPvaBqG8zO5LkCIhyTr4S/NvnaQpLs4e9MqJ7obGPq+rHPtm04p5JS5q25kE/flAHw1nGGtX8wUGAw==","signature_status":"signed_v1","signed_at":"2026-07-08T01:19:12.859752Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.13030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e70679fa1ac34987952e399690341e8963d9884b32276dd3b8f9ce8931a90486","sha256:767659e57552bda109f0dfcacca7443855fb2f209d4b77d2297e42d225cf3d22"],"state_sha256":"4580bb4d2255c3557a3d955acfa8af7796c8e4c8bda811c36978207d1adf32d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QA1RX6Ks5Izo8JQbcIpjk8XcD1tkcSCKBekzkqLfXKS43oT3E2PrkqaJHP06i0gupBMDCmna5WPEncfuP20YDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:53:14.414413Z","bundle_sha256":"b46f0cac9fcc893fc9eaeda020f001b97a751be2a50b427c7ca050e09ffc2f3d"}}