{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XFCVCCKHOIW6HMFCFAIBB7BWGH","short_pith_number":"pith:XFCVCCKH","canonical_record":{"source":{"id":"1807.04065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-11T10:54:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e6e8ff540c2c5f1f38680b4e831d11b74d3afbcbc7a0142c34d11d44541c3c44","abstract_canon_sha256":"efc369e4218ebc378b8740894a8db9783213aa05247570822fc72538baf3eba4"},"schema_version":"1.0"},"canonical_sha256":"b945510947722de3b0a2281010fc3631c55ac2b10bf24b100a20b215eee3d735","source":{"kind":"arxiv","id":"1807.04065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04065","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04065v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04065","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"XFCVCCKHOIW6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XFCVCCKHOIW6HMFC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XFCVCCKH","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XFCVCCKHOIW6HMFCFAIBB7BWGH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-11T10:54:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e6e8ff540c2c5f1f38680b4e831d11b74d3afbcbc7a0142c34d11d44541c3c44","abstract_canon_sha256":"efc369e4218ebc378b8740894a8db9783213aa05247570822fc72538baf3eba4"},"schema_version":"1.0"},"canonical_sha256":"b945510947722de3b0a2281010fc3631c55ac2b10bf24b100a20b215eee3d735","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.133458Z","signature_b64":"PxRh7dKfTexyDBWtPo7mA56bQhHuv0G1I30Q35EFoyTqiekDmMuEWBZHzPFkzQ3OK9l94SypBvmxy2HwIHFzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b945510947722de3b0a2281010fc3631c55ac2b10bf24b100a20b215eee3d735","last_reissued_at":"2026-05-18T00:10:58.132743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.132743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04065","source_version":1,"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-05-18T00:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3VcFCoahVoWLlVTN0ZXqn2HyQMMlZDmwS8JRt5xGqTOTU2GY1Y63/lnSGP+0nUh8MfALpSVku5CBgFDAD00Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:39.510436Z"},"content_sha256":"382baa6c733cbad3da0fa6f91bd5c8e614c7b6ba0d842993bc0d68d2b77012e9","schema_version":"1.0","event_id":"sha256:382baa6c733cbad3da0fa6f91bd5c8e614c7b6ba0d842993bc0d68d2b77012e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XFCVCCKHOIW6HMFCFAIBB7BWGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrent Neural Networks with Flexible Gates using Kernel Activation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Aurelio Uncini, Danilo Comminiello, Simone Scardapane, Simone Totaro, Steven Van Vaerenbergh","submitted_at":"2018-07-11T10:54:46Z","abstract_excerpt":"Gated recurrent neural networks have achieved remarkable results in the analysis of sequential data. Inside these networks, gates are used to control the flow of information, allowing to model even very long-term dependencies in the data. In this paper, we investigate whether the original gate equation (a linear projection followed by an element-wise sigmoid) can be improved. In particular, we design a more flexible architecture, with a small number of adaptable parameters, which is able to model a wider range of gating functions than the classical one. To this end, we replace the sigmoid func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04065","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWRW94CetLJDl0fTnAP7MJ3fR8UYrnBv8/SzLFUbZeJjsvuJZ3isb1a3aMFXpzog8I9d0XLJSAPGBxbOOFhKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:39.510793Z"},"content_sha256":"af18877882e4d919dff7bc4b40afec5718895cc05adc75b574481888f8590b31","schema_version":"1.0","event_id":"sha256:af18877882e4d919dff7bc4b40afec5718895cc05adc75b574481888f8590b31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH/bundle.json","state_url":"https://pith.science/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH/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-05-28T13:31:39Z","links":{"resolver":"https://pith.science/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH","bundle":"https://pith.science/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH/bundle.json","state":"https://pith.science/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFCVCCKHOIW6HMFCFAIBB7BWGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XFCVCCKHOIW6HMFCFAIBB7BWGH","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":"efc369e4218ebc378b8740894a8db9783213aa05247570822fc72538baf3eba4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-11T10:54:46Z","title_canon_sha256":"e6e8ff540c2c5f1f38680b4e831d11b74d3afbcbc7a0142c34d11d44541c3c44"},"schema_version":"1.0","source":{"id":"1807.04065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04065","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04065v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04065","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"XFCVCCKHOIW6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XFCVCCKHOIW6HMFC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XFCVCCKH","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:af18877882e4d919dff7bc4b40afec5718895cc05adc75b574481888f8590b31","target":"graph","created_at":"2026-05-18T00:10:58Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Gated recurrent neural networks have achieved remarkable results in the analysis of sequential data. Inside these networks, gates are used to control the flow of information, allowing to model even very long-term dependencies in the data. In this paper, we investigate whether the original gate equation (a linear projection followed by an element-wise sigmoid) can be improved. In particular, we design a more flexible architecture, with a small number of adaptable parameters, which is able to model a wider range of gating functions than the classical one. To this end, we replace the sigmoid func","authors_text":"Aurelio Uncini, Danilo Comminiello, Simone Scardapane, Simone Totaro, Steven Van Vaerenbergh","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-11T10:54:46Z","title":"Recurrent Neural Networks with Flexible Gates using Kernel Activation Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04065","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:382baa6c733cbad3da0fa6f91bd5c8e614c7b6ba0d842993bc0d68d2b77012e9","target":"record","created_at":"2026-05-18T00:10:58Z","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":"efc369e4218ebc378b8740894a8db9783213aa05247570822fc72538baf3eba4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-07-11T10:54:46Z","title_canon_sha256":"e6e8ff540c2c5f1f38680b4e831d11b74d3afbcbc7a0142c34d11d44541c3c44"},"schema_version":"1.0","source":{"id":"1807.04065","kind":"arxiv","version":1}},"canonical_sha256":"b945510947722de3b0a2281010fc3631c55ac2b10bf24b100a20b215eee3d735","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b945510947722de3b0a2281010fc3631c55ac2b10bf24b100a20b215eee3d735","first_computed_at":"2026-05-18T00:10:58.132743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:58.132743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PxRh7dKfTexyDBWtPo7mA56bQhHuv0G1I30Q35EFoyTqiekDmMuEWBZHzPFkzQ3OK9l94SypBvmxy2HwIHFzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:58.133458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:382baa6c733cbad3da0fa6f91bd5c8e614c7b6ba0d842993bc0d68d2b77012e9","sha256:af18877882e4d919dff7bc4b40afec5718895cc05adc75b574481888f8590b31"],"state_sha256":"0e04bca916be4297d1a0ed2272152e6b0c5875f97273be9bbab7467528ab6baa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MgQYJ3lmQLi2no2nNOutQn1pCJVAaVDcJgvsSgjNNlqxzo2+KjckgYaiR+tr7xr6qqUPa7KJx1Dqq1avDG1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:31:39.512711Z","bundle_sha256":"5b1ad5af66b9ef37108dfa5743e55bc273de861679ade355b7548ee60ab7e529"}}