{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CQSRZDPWSEZM75UU5WZA3POOI3","short_pith_number":"pith:CQSRZDPW","canonical_record":{"source":{"id":"1802.01817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-02-06T06:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"03a0de01346d81ebec104f417654ab8aae8aa899fd619264af02470e5b30251d","abstract_canon_sha256":"9c85638c15ecf2b5abb2562cf4ae431217e64f4389df1213201dea5156f162a6"},"schema_version":"1.0"},"canonical_sha256":"14251c8df69132cff694edb20dbdce46c21e061bf98c5394b921788b6c9deed9","source":{"kind":"arxiv","id":"1802.01817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01817","created_at":"2026-05-18T00:24:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01817v1","created_at":"2026-05-18T00:24:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01817","created_at":"2026-05-18T00:24:21Z"},{"alias_kind":"pith_short_12","alias_value":"CQSRZDPWSEZM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CQSRZDPWSEZM75UU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CQSRZDPW","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CQSRZDPWSEZM75UU5WZA3POOI3","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-02-06T06:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"03a0de01346d81ebec104f417654ab8aae8aa899fd619264af02470e5b30251d","abstract_canon_sha256":"9c85638c15ecf2b5abb2562cf4ae431217e64f4389df1213201dea5156f162a6"},"schema_version":"1.0"},"canonical_sha256":"14251c8df69132cff694edb20dbdce46c21e061bf98c5394b921788b6c9deed9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:21.199695Z","signature_b64":"+gS/TKQ5ZbNaVFQ3AB4C7avRVixk9kSRC6kcVvu+MgDaSsgg0R/c5WB8/LtnZ2tv5M7JlE1Nl4DJuSjxtIkxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14251c8df69132cff694edb20dbdce46c21e061bf98c5394b921788b6c9deed9","last_reissued_at":"2026-05-18T00:24:21.199211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:21.199211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01817","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:24:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Il0ERmNxP6Z1gG1RPY4iUTz87/YQWoKxErs0nP7RLNtw8cB4YE5Rc7ZZ29KCHzaJCvcNpj4CqLZJNoMkp1vQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T18:20:57.936509Z"},"content_sha256":"98755c109a6958a6c3bdf732ad16b585b32dfdf935d439ae3f06236d36e6d0e5","schema_version":"1.0","event_id":"sha256:98755c109a6958a6c3bdf732ad16b585b32dfdf935d439ae3f06236d36e6d0e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CQSRZDPWSEZM75UU5WZA3POOI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Byte-Level Recursive Convolutional Auto-Encoder for Text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Xiang Zhang, Yann LeCun","submitted_at":"2018-02-06T06:47:09Z","abstract_excerpt":"This article proposes to auto-encode text at byte-level using convolutional networks with a recursive architecture. The motivation is to explore whether it is possible to have scalable and homogeneous text generation at byte-level in a non-sequential fashion through the simple task of auto-encoding. We show that non-sequential text generation from a fixed-length representation is not only possible, but also achieved much better auto-encoding results than recurrent networks. The proposed model is a multi-stage deep convolutional encoder-decoder framework using residual connections, containing u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01817","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:24:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/R4YOezuMtuvC6SOM+5kfnsSei3rbO0XHEe+bygAw/ruM2662PJQfBn/10ZAUmrVeKyqSA6QijkjfG9qH7jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T18:20:57.936847Z"},"content_sha256":"aa0e6846664bd9c6fe8ca239f82521ebcb62f2fe5fc43770c77b0ec1d6ad2e1b","schema_version":"1.0","event_id":"sha256:aa0e6846664bd9c6fe8ca239f82521ebcb62f2fe5fc43770c77b0ec1d6ad2e1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQSRZDPWSEZM75UU5WZA3POOI3/bundle.json","state_url":"https://pith.science/pith/CQSRZDPWSEZM75UU5WZA3POOI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQSRZDPWSEZM75UU5WZA3POOI3/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-07-26T18:20:57Z","links":{"resolver":"https://pith.science/pith/CQSRZDPWSEZM75UU5WZA3POOI3","bundle":"https://pith.science/pith/CQSRZDPWSEZM75UU5WZA3POOI3/bundle.json","state":"https://pith.science/pith/CQSRZDPWSEZM75UU5WZA3POOI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQSRZDPWSEZM75UU5WZA3POOI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CQSRZDPWSEZM75UU5WZA3POOI3","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":"9c85638c15ecf2b5abb2562cf4ae431217e64f4389df1213201dea5156f162a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-02-06T06:47:09Z","title_canon_sha256":"03a0de01346d81ebec104f417654ab8aae8aa899fd619264af02470e5b30251d"},"schema_version":"1.0","source":{"id":"1802.01817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01817","created_at":"2026-05-18T00:24:21Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01817v1","created_at":"2026-05-18T00:24:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01817","created_at":"2026-05-18T00:24:21Z"},{"alias_kind":"pith_short_12","alias_value":"CQSRZDPWSEZM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CQSRZDPWSEZM75UU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CQSRZDPW","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:aa0e6846664bd9c6fe8ca239f82521ebcb62f2fe5fc43770c77b0ec1d6ad2e1b","target":"graph","created_at":"2026-05-18T00:24:21Z","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":"This article proposes to auto-encode text at byte-level using convolutional networks with a recursive architecture. The motivation is to explore whether it is possible to have scalable and homogeneous text generation at byte-level in a non-sequential fashion through the simple task of auto-encoding. We show that non-sequential text generation from a fixed-length representation is not only possible, but also achieved much better auto-encoding results than recurrent networks. The proposed model is a multi-stage deep convolutional encoder-decoder framework using residual connections, containing u","authors_text":"Xiang Zhang, Yann LeCun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-02-06T06:47:09Z","title":"Byte-Level Recursive Convolutional Auto-Encoder for Text"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01817","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:98755c109a6958a6c3bdf732ad16b585b32dfdf935d439ae3f06236d36e6d0e5","target":"record","created_at":"2026-05-18T00:24:21Z","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":"9c85638c15ecf2b5abb2562cf4ae431217e64f4389df1213201dea5156f162a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-02-06T06:47:09Z","title_canon_sha256":"03a0de01346d81ebec104f417654ab8aae8aa899fd619264af02470e5b30251d"},"schema_version":"1.0","source":{"id":"1802.01817","kind":"arxiv","version":1}},"canonical_sha256":"14251c8df69132cff694edb20dbdce46c21e061bf98c5394b921788b6c9deed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14251c8df69132cff694edb20dbdce46c21e061bf98c5394b921788b6c9deed9","first_computed_at":"2026-05-18T00:24:21.199211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:21.199211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+gS/TKQ5ZbNaVFQ3AB4C7avRVixk9kSRC6kcVvu+MgDaSsgg0R/c5WB8/LtnZ2tv5M7JlE1Nl4DJuSjxtIkxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:21.199695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98755c109a6958a6c3bdf732ad16b585b32dfdf935d439ae3f06236d36e6d0e5","sha256:aa0e6846664bd9c6fe8ca239f82521ebcb62f2fe5fc43770c77b0ec1d6ad2e1b"],"state_sha256":"94392f7c453532a1b7cbac60a12dcdb36f495128631356e00f1ea51224a7d945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"minVArGD+6bgaf570OMIZt939TPqCd3HRamYsXtsZbAtDBKckAeVJXUEmZIR987HFkbDXpudXvAJsS/vC5lJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T18:20:57.938879Z","bundle_sha256":"f3ff340e36b9e1931d8367870133fbeb56c87ce13ffaf0b4e174417a609643d1"}}