{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2INBEHDXQN7QRYDEUXOGVJ7NVV","short_pith_number":"pith:2INBEHDX","schema_version":"1.0","canonical_sha256":"d21a121c77837f08e064a5dc6aa7edad5471ae7a7f5b848551b2f4690b8d86ed","source":{"kind":"arxiv","id":"2506.16054","version":1},"attestation_state":"computed","paper":{"title":"PAROAttention: Pattern-Aware ReOrdering for Efficient Sparse and Quantized Attention in Visual Generation Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Feng Ling, Hongyu Zhu, Huixia Li, Ke Hong, Ruiqi Xie, Siqi Chen, Tianchen Zhao, Xinhao Yang, Xuefeng Xiao, Yichong Zhang, Yu Wang","submitted_at":"2025-06-19T06:25:02Z","abstract_excerpt":"In visual generation, the quadratic complexity of attention mechanisms results in high memory and computational costs, especially for longer token sequences required in high-resolution image or multi-frame video generation. To address this, prior research has explored techniques such as sparsification and quantization. However, these techniques face significant challenges under low density and reduced bitwidths. Through systematic analysis, we identify that the core difficulty stems from the dispersed and irregular characteristics of visual attention patterns. Therefore, instead of introducing"},"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":"2506.16054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-19T06:25:02Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"00ea39fe7f08ded691300ad0d48c56a3377dcc504c90b072864c62bad2c0e9e3","abstract_canon_sha256":"a740bd233999ba9ee0b7027105270ecdf87c75b9729bfe581833c52340e35293"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:54.157528Z","signature_b64":"0ergJBogKjvEovotQiCKar54ivxdvNiE1K+w5JXZ7mNcDx0Yn5nv7QcKc6/t6ixdD1c+LRsAN7s7x/LEFLC2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d21a121c77837f08e064a5dc6aa7edad5471ae7a7f5b848551b2f4690b8d86ed","last_reissued_at":"2026-07-05T11:24:54.157029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:54.157029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PAROAttention: Pattern-Aware ReOrdering for Efficient Sparse and Quantized Attention in Visual Generation Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Feng Ling, Hongyu Zhu, Huixia Li, Ke Hong, Ruiqi Xie, Siqi Chen, Tianchen Zhao, Xinhao Yang, Xuefeng Xiao, Yichong Zhang, Yu Wang","submitted_at":"2025-06-19T06:25:02Z","abstract_excerpt":"In visual generation, the quadratic complexity of attention mechanisms results in high memory and computational costs, especially for longer token sequences required in high-resolution image or multi-frame video generation. To address this, prior research has explored techniques such as sparsification and quantization. However, these techniques face significant challenges under low density and reduced bitwidths. Through systematic analysis, we identify that the core difficulty stems from the dispersed and irregular characteristics of visual attention patterns. Therefore, instead of introducing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16054","kind":"arxiv","version":1},"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/2506.16054/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":"2506.16054","created_at":"2026-07-05T11:24:54.157111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16054v1","created_at":"2026-07-05T11:24:54.157111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16054","created_at":"2026-07-05T11:24:54.157111+00:00"},{"alias_kind":"pith_short_12","alias_value":"2INBEHDXQN7Q","created_at":"2026-07-05T11:24:54.157111+00:00"},{"alias_kind":"pith_short_16","alias_value":"2INBEHDXQN7QRYDE","created_at":"2026-07-05T11:24:54.157111+00:00"},{"alias_kind":"pith_short_8","alias_value":"2INBEHDX","created_at":"2026-07-05T11:24:54.157111+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23019","citing_title":"ScalingAttention: Discovering Intrinsic Sparse Attention Topology for Video Diffusion Transformers","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14513","citing_title":"HASTE: Training-Free Video Diffusion Acceleration via Head-Wise Adaptive Sparse Attention","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15911","citing_title":"Efficient Video Diffusion Models: Advancements and Challenges","ref_index":194,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV","json":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV.json","graph_json":"https://pith.science/api/pith-number/2INBEHDXQN7QRYDEUXOGVJ7NVV/graph.json","events_json":"https://pith.science/api/pith-number/2INBEHDXQN7QRYDEUXOGVJ7NVV/events.json","paper":"https://pith.science/paper/2INBEHDX"},"agent_actions":{"view_html":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV","download_json":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV.json","view_paper":"https://pith.science/paper/2INBEHDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16054&json=true","fetch_graph":"https://pith.science/api/pith-number/2INBEHDXQN7QRYDEUXOGVJ7NVV/graph.json","fetch_events":"https://pith.science/api/pith-number/2INBEHDXQN7QRYDEUXOGVJ7NVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV/action/storage_attestation","attest_author":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV/action/author_attestation","sign_citation":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV/action/citation_signature","submit_replication":"https://pith.science/pith/2INBEHDXQN7QRYDEUXOGVJ7NVV/action/replication_record"}},"created_at":"2026-07-05T11:24:54.157111+00:00","updated_at":"2026-07-05T11:24:54.157111+00:00"}