{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IQ3OZJ7X37GW6OBBYLLBYPUCO7","short_pith_number":"pith:IQ3OZJ7X","schema_version":"1.0","canonical_sha256":"4436eca7f7dfcd6f3821c2d61c3e8277eebd2b27a76e243d60ae16b678deab53","source":{"kind":"arxiv","id":"2102.02611","version":3},"attestation_state":"computed","paper":{"title":"CKConv: Continuous Kernel Convolution For Sequential Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Kuzina, David W. Romero, Erik J. Bekkers, Jakub M. Tomczak, Mark Hoogendoorn","submitted_at":"2021-02-04T13:51:19Z","abstract_excerpt":"Conventional neural architectures for sequential data present important limitations. Recurrent networks suffer from exploding and vanishing gradients, small effective memory horizons, and must be trained sequentially. Convolutional networks are unable to handle sequences of unknown size and their memory horizon must be defined a priori. In this work, we show that all these problems can be solved by formulating convolutional kernels in CNNs as continuous functions. The resulting Continuous Kernel Convolution (CKConv) allows us to model arbitrarily long sequences in a parallel manner, within a s"},"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":"2102.02611","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T13:51:19Z","cross_cats_sorted":[],"title_canon_sha256":"d0fda2169c65b255e9ae4f17b9739e808a53152f6127effd1f2af6ef5e5a279b","abstract_canon_sha256":"0f443877ad42ddf1fd9b1c7154a542d954f9cf0aa820f4bcd033cff974b99ad4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:05:56.797036Z","signature_b64":"vXdNHhGcjOJz0dGTj7OPlBv+A60sAgMHYvgnvR3EEZP3GmgBh9m6LnBFhebtFFiaLfbQuYT12uGue8Q4bNN1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4436eca7f7dfcd6f3821c2d61c3e8277eebd2b27a76e243d60ae16b678deab53","last_reissued_at":"2026-07-05T04:05:56.796632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:05:56.796632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CKConv: Continuous Kernel Convolution For Sequential Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Kuzina, David W. Romero, Erik J. Bekkers, Jakub M. Tomczak, Mark Hoogendoorn","submitted_at":"2021-02-04T13:51:19Z","abstract_excerpt":"Conventional neural architectures for sequential data present important limitations. Recurrent networks suffer from exploding and vanishing gradients, small effective memory horizons, and must be trained sequentially. Convolutional networks are unable to handle sequences of unknown size and their memory horizon must be defined a priori. In this work, we show that all these problems can be solved by formulating convolutional kernels in CNNs as continuous functions. The resulting Continuous Kernel Convolution (CKConv) allows us to model arbitrarily long sequences in a parallel manner, within a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02611","kind":"arxiv","version":3},"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/2102.02611/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":"2102.02611","created_at":"2026-07-05T04:05:56.796689+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.02611v3","created_at":"2026-07-05T04:05:56.796689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02611","created_at":"2026-07-05T04:05:56.796689+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQ3OZJ7X37GW","created_at":"2026-07-05T04:05:56.796689+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQ3OZJ7X37GW6OBB","created_at":"2026-07-05T04:05:56.796689+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQ3OZJ7X","created_at":"2026-07-05T04:05:56.796689+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01172","citing_title":"Revisiting Neural Processes via Fourier Transform and Volterra Series","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2404.14294","citing_title":"A Survey on Efficient Inference for Large Language Models","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2312.06635","citing_title":"Gated Linear Attention Transformers with Hardware-Efficient Training","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2111.00396","citing_title":"Efficiently Modeling Long Sequences with Structured State Spaces","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2312.00752","citing_title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","ref_index":90,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7","json":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7.json","graph_json":"https://pith.science/api/pith-number/IQ3OZJ7X37GW6OBBYLLBYPUCO7/graph.json","events_json":"https://pith.science/api/pith-number/IQ3OZJ7X37GW6OBBYLLBYPUCO7/events.json","paper":"https://pith.science/paper/IQ3OZJ7X"},"agent_actions":{"view_html":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7","download_json":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7.json","view_paper":"https://pith.science/paper/IQ3OZJ7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.02611&json=true","fetch_graph":"https://pith.science/api/pith-number/IQ3OZJ7X37GW6OBBYLLBYPUCO7/graph.json","fetch_events":"https://pith.science/api/pith-number/IQ3OZJ7X37GW6OBBYLLBYPUCO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7/action/storage_attestation","attest_author":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7/action/author_attestation","sign_citation":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7/action/citation_signature","submit_replication":"https://pith.science/pith/IQ3OZJ7X37GW6OBBYLLBYPUCO7/action/replication_record"}},"created_at":"2026-07-05T04:05:56.796689+00:00","updated_at":"2026-07-05T04:05:56.796689+00:00"}