{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4OCCQTFIP3PHYSWQE2KRQJLS7I","short_pith_number":"pith:4OCCQTFI","schema_version":"1.0","canonical_sha256":"e384284ca87ede7c4ad02695182572fa2829025a2ebc918869675c4564763cca","source":{"kind":"arxiv","id":"1704.06001","version":1},"attestation_state":"computed","paper":{"title":"Fast Generation for Convolutional Autoregressive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark A. Hasegawa-Johnson, Mohammad Babaeizadeh, Pooya Khorrami, Prajit Ramachandran, Roy H. Campbell, Shiyu Chang, Thomas S. Huang, Tom Le Paine, Yang Zhang","submitted_at":"2017-04-20T04:13:21Z","abstract_excerpt":"Convolutional autoregressive models have recently demonstrated state-of-the-art performance on a number of generation tasks. While fast, parallel training methods have been crucial for their success, generation is typically implemented in a na\\\"{i}ve fashion where redundant computations are unnecessarily repeated. This results in slow generation, making such models infeasible for production environments. In this work, we describe a method to speed up generation in convolutional autoregressive models. The key idea is to cache hidden states to avoid redundant computation. We apply our fast gener"},"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":"1704.06001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-20T04:13:21Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"7401f2e14c36932bdf2f4ee760817c7febaa46faedfea59efc97738f13cd82d9","abstract_canon_sha256":"f008776154caf37394b2936293dcf7352ab890b6f496ac692941e8d954c93e47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.574658Z","signature_b64":"z/xg+On0b5t47M28A5dLdTqsUszelRrb3ZrBTtbAPE/SjjGXlCEqXy4B0y9/Fvdhtdr1koReBLxboqo0Zk9rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e384284ca87ede7c4ad02695182572fa2829025a2ebc918869675c4564763cca","last_reissued_at":"2026-05-18T00:46:03.574115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.574115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Generation for Convolutional Autoregressive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark A. Hasegawa-Johnson, Mohammad Babaeizadeh, Pooya Khorrami, Prajit Ramachandran, Roy H. Campbell, Shiyu Chang, Thomas S. Huang, Tom Le Paine, Yang Zhang","submitted_at":"2017-04-20T04:13:21Z","abstract_excerpt":"Convolutional autoregressive models have recently demonstrated state-of-the-art performance on a number of generation tasks. While fast, parallel training methods have been crucial for their success, generation is typically implemented in a na\\\"{i}ve fashion where redundant computations are unnecessarily repeated. This results in slow generation, making such models infeasible for production environments. In this work, we describe a method to speed up generation in convolutional autoregressive models. The key idea is to cache hidden states to avoid redundant computation. We apply our fast gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06001","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":""},"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":"1704.06001","created_at":"2026-05-18T00:46:03.574206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06001v1","created_at":"2026-05-18T00:46:03.574206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06001","created_at":"2026-05-18T00:46:03.574206+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OCCQTFIP3PH","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OCCQTFIP3PHYSWQ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OCCQTFI","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2111.00396","citing_title":"Efficiently Modeling Long Sequences with Structured State Spaces","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2202.00512","citing_title":"Progressive Distillation for Fast Sampling of Diffusion Models","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I","json":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I.json","graph_json":"https://pith.science/api/pith-number/4OCCQTFIP3PHYSWQE2KRQJLS7I/graph.json","events_json":"https://pith.science/api/pith-number/4OCCQTFIP3PHYSWQE2KRQJLS7I/events.json","paper":"https://pith.science/paper/4OCCQTFI"},"agent_actions":{"view_html":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I","download_json":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I.json","view_paper":"https://pith.science/paper/4OCCQTFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06001&json=true","fetch_graph":"https://pith.science/api/pith-number/4OCCQTFIP3PHYSWQE2KRQJLS7I/graph.json","fetch_events":"https://pith.science/api/pith-number/4OCCQTFIP3PHYSWQE2KRQJLS7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I/action/storage_attestation","attest_author":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I/action/author_attestation","sign_citation":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I/action/citation_signature","submit_replication":"https://pith.science/pith/4OCCQTFIP3PHYSWQE2KRQJLS7I/action/replication_record"}},"created_at":"2026-05-18T00:46:03.574206+00:00","updated_at":"2026-05-18T00:46:03.574206+00:00"}