{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YNBBOI34VBEEKBDNKKABTK3NXM","short_pith_number":"pith:YNBBOI34","canonical_record":{"source":{"id":"1612.08083","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-23T20:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"b603c8af5845ea66f356e172367082cd9077f5e2aa454bc56dc4fe0b727642be","abstract_canon_sha256":"bb3273ebd83b8cdbb66a7c3e94f17deef8b87e89871374b3b2b67cd6dc422f43"},"schema_version":"1.0"},"canonical_sha256":"c34217237ca84845046d528019ab6dbb319f632440e0c4c74fd55c0d777819ae","source":{"kind":"arxiv","id":"1612.08083","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08083","created_at":"2026-05-18T00:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08083v3","created_at":"2026-05-18T00:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08083","created_at":"2026-05-18T00:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"YNBBOI34VBEE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNBBOI34VBEEKBDN","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNBBOI34","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YNBBOI34VBEEKBDNKKABTK3NXM","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08083","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-23T20:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"b603c8af5845ea66f356e172367082cd9077f5e2aa454bc56dc4fe0b727642be","abstract_canon_sha256":"bb3273ebd83b8cdbb66a7c3e94f17deef8b87e89871374b3b2b67cd6dc422f43"},"schema_version":"1.0"},"canonical_sha256":"c34217237ca84845046d528019ab6dbb319f632440e0c4c74fd55c0d777819ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:43.757990Z","signature_b64":"0y3QYiBBccrFti1eN5XYDuw86vwp+rSYvXxBB5gnx7mh248I3rX+QtlDQqb0av8J/uM5i+fMiZdVP0c7m2FTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34217237ca84845046d528019ab6dbb319f632440e0c4c74fd55c0d777819ae","last_reissued_at":"2026-05-18T00:35:43.757458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:43.757458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08083","source_version":3,"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:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYcOlX+9tWagX1Ipsr0/gF39PvgGGVbrNsW9P8+8/15al+MYRqyI9B1rk8KAC02ZBnNirHNjX7xOcSSpnk3UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:46:48.409056Z"},"content_sha256":"7047b63ba0485e1447105ed6018c06050761a214bb6e9c94c3cc75b9c02efde2","schema_version":"1.0","event_id":"sha256:7047b63ba0485e1447105ed6018c06050761a214bb6e9c94c3cc75b9c02efde2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YNBBOI34VBEEKBDNKKABTK3NXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Language Modeling with Gated Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Angela Fan, David Grangier, Michael Auli, Yann N. Dauphin","submitted_at":"2016-12-23T20:32:33Z","abstract_excerpt":"The pre-dominant approach to language modeling to date is based on recurrent neural networks. Their success on this task is often linked to their ability to capture unbounded context. In this paper we develop a finite context approach through stacked convolutions, which can be more efficient since they allow parallelization over sequential tokens. We propose a novel simplified gating mechanism that outperforms Oord et al (2016) and investigate the impact of key architectural decisions. The proposed approach achieves state-of-the-art on the WikiText-103 benchmark, even though it features long-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08083","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":""},"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:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwGFmdUEIYXnP/PHPQvRFjt4dFYF4a5k7aGBTZySCaLu3BC5JniSvFgidq5mrDxLM4ZLoUnXguTAMl6CXZTrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:46:48.409477Z"},"content_sha256":"53f39b9f01707288881a730e79a8150594474c1c201d1594011ac31da4ac4f61","schema_version":"1.0","event_id":"sha256:53f39b9f01707288881a730e79a8150594474c1c201d1594011ac31da4ac4f61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNBBOI34VBEEKBDNKKABTK3NXM/bundle.json","state_url":"https://pith.science/pith/YNBBOI34VBEEKBDNKKABTK3NXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNBBOI34VBEEKBDNKKABTK3NXM/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-27T15:46:48Z","links":{"resolver":"https://pith.science/pith/YNBBOI34VBEEKBDNKKABTK3NXM","bundle":"https://pith.science/pith/YNBBOI34VBEEKBDNKKABTK3NXM/bundle.json","state":"https://pith.science/pith/YNBBOI34VBEEKBDNKKABTK3NXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNBBOI34VBEEKBDNKKABTK3NXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YNBBOI34VBEEKBDNKKABTK3NXM","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":"bb3273ebd83b8cdbb66a7c3e94f17deef8b87e89871374b3b2b67cd6dc422f43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-23T20:32:33Z","title_canon_sha256":"b603c8af5845ea66f356e172367082cd9077f5e2aa454bc56dc4fe0b727642be"},"schema_version":"1.0","source":{"id":"1612.08083","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08083","created_at":"2026-05-18T00:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08083v3","created_at":"2026-05-18T00:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08083","created_at":"2026-05-18T00:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"YNBBOI34VBEE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNBBOI34VBEEKBDN","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNBBOI34","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:53f39b9f01707288881a730e79a8150594474c1c201d1594011ac31da4ac4f61","target":"graph","created_at":"2026-05-18T00:35:43Z","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":"The pre-dominant approach to language modeling to date is based on recurrent neural networks. Their success on this task is often linked to their ability to capture unbounded context. In this paper we develop a finite context approach through stacked convolutions, which can be more efficient since they allow parallelization over sequential tokens. We propose a novel simplified gating mechanism that outperforms Oord et al (2016) and investigate the impact of key architectural decisions. The proposed approach achieves state-of-the-art on the WikiText-103 benchmark, even though it features long-t","authors_text":"Angela Fan, David Grangier, Michael Auli, Yann N. Dauphin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-23T20:32:33Z","title":"Language Modeling with Gated Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08083","kind":"arxiv","version":3},"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:7047b63ba0485e1447105ed6018c06050761a214bb6e9c94c3cc75b9c02efde2","target":"record","created_at":"2026-05-18T00:35:43Z","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":"bb3273ebd83b8cdbb66a7c3e94f17deef8b87e89871374b3b2b67cd6dc422f43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-12-23T20:32:33Z","title_canon_sha256":"b603c8af5845ea66f356e172367082cd9077f5e2aa454bc56dc4fe0b727642be"},"schema_version":"1.0","source":{"id":"1612.08083","kind":"arxiv","version":3}},"canonical_sha256":"c34217237ca84845046d528019ab6dbb319f632440e0c4c74fd55c0d777819ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c34217237ca84845046d528019ab6dbb319f632440e0c4c74fd55c0d777819ae","first_computed_at":"2026-05-18T00:35:43.757458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:43.757458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0y3QYiBBccrFti1eN5XYDuw86vwp+rSYvXxBB5gnx7mh248I3rX+QtlDQqb0av8J/uM5i+fMiZdVP0c7m2FTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:43.757990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08083","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7047b63ba0485e1447105ed6018c06050761a214bb6e9c94c3cc75b9c02efde2","sha256:53f39b9f01707288881a730e79a8150594474c1c201d1594011ac31da4ac4f61"],"state_sha256":"36e9ddaa8c5ac04239440a032137d2227bf7c5ef5ee77bdec3e0ebcde46cfa3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXV18abyj3nlJWouzCgEMKkeRXW3L9iI4M5UQYPh6sxw+mifzcetQNutWQpLeMTstC2hRJBfZmhFVCtLoXcVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:46:48.412236Z","bundle_sha256":"54ea4a396107f14b1a32396c361640eb28f46a9a353397b40d292ada1e6fc6c9"}}