{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PYN3EMURF6PDZHV7NLJZOCKDQL","short_pith_number":"pith:PYN3EMUR","canonical_record":{"source":{"id":"1904.03651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-07T13:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"9e2ff836f0c89134927c0378bc90900199e115aeb9fb68901a0677a737ed7904","abstract_canon_sha256":"ed24a68ce0506ade9a433679665b59c0b8514ac25c57c09dc32f11dd0533c9ac"},"schema_version":"1.0"},"canonical_sha256":"7e1bb232912f9e3c9ebf6ad397094382ed3f1d2656fe29ed5bba32706cf473d0","source":{"kind":"arxiv","id":"1904.03651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03651","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03651v2","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03651","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"PYN3EMURF6PD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PYN3EMURF6PDZHV7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PYN3EMUR","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PYN3EMURF6PDZHV7NLJZOCKDQL","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-07T13:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"9e2ff836f0c89134927c0378bc90900199e115aeb9fb68901a0677a737ed7904","abstract_canon_sha256":"ed24a68ce0506ade9a433679665b59c0b8514ac25c57c09dc32f11dd0533c9ac"},"schema_version":"1.0"},"canonical_sha256":"7e1bb232912f9e3c9ebf6ad397094382ed3f1d2656fe29ed5bba32706cf473d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:49.570122Z","signature_b64":"sgbSdcu6gDDNcPXvocnQ7nlpo9GFShHrsgkZOyHWv+ghbNmT4C57aHlzDeCxLKvRSldn2YRD1WmGzEW/dYveCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e1bb232912f9e3c9ebf6ad397094382ed3f1d2656fe29ed5bba32706cf473d0","last_reissued_at":"2026-05-17T23:43:49.569458Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:49.569458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03651","source_version":2,"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-17T23:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ACimY/Iu1bgn65jRPvdNMfkx0pcYMGiqqNJfbXyNMMHXux405rQMy0203qRIJyykK70g4/N9HMHyMGYZef7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:35:18.429054Z"},"content_sha256":"f44ecfc8693021490e2cbfc8b1c7cfedd473598fe07c6aa893a0a5632a5b8bbe","schema_version":"1.0","event_id":"sha256:f44ecfc8693021490e2cbfc8b1c7cfedd473598fe07c6aa893a0a5632a5b8bbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PYN3EMURF6PDZHV7NLJZOCKDQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SEQ^3: Differentiable Sequence-to-Sequence-to-Sequence Autoencoder for Unsupervised Abstractive Sentence Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexandros Potamianos, Christos Baziotis, Ioannis Konstas, Ion Androutsopoulos","submitted_at":"2019-04-07T13:47:28Z","abstract_excerpt":"Neural sequence-to-sequence models are currently the dominant approach in several natural language processing tasks, but require large parallel corpora. We present a sequence-to-sequence-to-sequence autoencoder (SEQ^3), consisting of two chained encoder-decoder pairs, with words used as a sequence of discrete latent variables. We apply the proposed model to unsupervised abstractive sentence compression, where the first and last sequences are the input and reconstructed sentences, respectively, while the middle sequence is the compressed sentence. Constraining the length of the latent word sequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03651","kind":"arxiv","version":2},"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-17T23:43:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvnQbdNII3MR2T9QQJQmmTuxG9kG9Tdey7yf6eMyaimx1aIGKTN/YTuy+LhGafH97JqJdJmMd1ko4Qk7eWprDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:35:18.429413Z"},"content_sha256":"980723dfb3c547fd7e7700aa20225e3ecb3db5f4e2e507ecd8d689c26bb4f811","schema_version":"1.0","event_id":"sha256:980723dfb3c547fd7e7700aa20225e3ecb3db5f4e2e507ecd8d689c26bb4f811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYN3EMURF6PDZHV7NLJZOCKDQL/bundle.json","state_url":"https://pith.science/pith/PYN3EMURF6PDZHV7NLJZOCKDQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYN3EMURF6PDZHV7NLJZOCKDQL/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-06-02T03:35:18Z","links":{"resolver":"https://pith.science/pith/PYN3EMURF6PDZHV7NLJZOCKDQL","bundle":"https://pith.science/pith/PYN3EMURF6PDZHV7NLJZOCKDQL/bundle.json","state":"https://pith.science/pith/PYN3EMURF6PDZHV7NLJZOCKDQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYN3EMURF6PDZHV7NLJZOCKDQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PYN3EMURF6PDZHV7NLJZOCKDQL","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":"ed24a68ce0506ade9a433679665b59c0b8514ac25c57c09dc32f11dd0533c9ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-07T13:47:28Z","title_canon_sha256":"9e2ff836f0c89134927c0378bc90900199e115aeb9fb68901a0677a737ed7904"},"schema_version":"1.0","source":{"id":"1904.03651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03651","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03651v2","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03651","created_at":"2026-05-17T23:43:49Z"},{"alias_kind":"pith_short_12","alias_value":"PYN3EMURF6PD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PYN3EMURF6PDZHV7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PYN3EMUR","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:980723dfb3c547fd7e7700aa20225e3ecb3db5f4e2e507ecd8d689c26bb4f811","target":"graph","created_at":"2026-05-17T23:43:49Z","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":"Neural sequence-to-sequence models are currently the dominant approach in several natural language processing tasks, but require large parallel corpora. We present a sequence-to-sequence-to-sequence autoencoder (SEQ^3), consisting of two chained encoder-decoder pairs, with words used as a sequence of discrete latent variables. We apply the proposed model to unsupervised abstractive sentence compression, where the first and last sequences are the input and reconstructed sentences, respectively, while the middle sequence is the compressed sentence. Constraining the length of the latent word sequ","authors_text":"Alexandros Potamianos, Christos Baziotis, Ioannis Konstas, Ion Androutsopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-07T13:47:28Z","title":"SEQ^3: Differentiable Sequence-to-Sequence-to-Sequence Autoencoder for Unsupervised Abstractive Sentence Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03651","kind":"arxiv","version":2},"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:f44ecfc8693021490e2cbfc8b1c7cfedd473598fe07c6aa893a0a5632a5b8bbe","target":"record","created_at":"2026-05-17T23:43:49Z","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":"ed24a68ce0506ade9a433679665b59c0b8514ac25c57c09dc32f11dd0533c9ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-04-07T13:47:28Z","title_canon_sha256":"9e2ff836f0c89134927c0378bc90900199e115aeb9fb68901a0677a737ed7904"},"schema_version":"1.0","source":{"id":"1904.03651","kind":"arxiv","version":2}},"canonical_sha256":"7e1bb232912f9e3c9ebf6ad397094382ed3f1d2656fe29ed5bba32706cf473d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e1bb232912f9e3c9ebf6ad397094382ed3f1d2656fe29ed5bba32706cf473d0","first_computed_at":"2026-05-17T23:43:49.569458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:49.569458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sgbSdcu6gDDNcPXvocnQ7nlpo9GFShHrsgkZOyHWv+ghbNmT4C57aHlzDeCxLKvRSldn2YRD1WmGzEW/dYveCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:49.570122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f44ecfc8693021490e2cbfc8b1c7cfedd473598fe07c6aa893a0a5632a5b8bbe","sha256:980723dfb3c547fd7e7700aa20225e3ecb3db5f4e2e507ecd8d689c26bb4f811"],"state_sha256":"001439fdc2b92c8234f73454385586a45b813b87c6fb2520d22103bdf3169e5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QK4MzeYhWsk6l9VBwxSArhO2m4xsDxYsu2wtSxLTt+iY61UzMn9AGENi25/sVwxtaQF8eksbGMT4Ls3gsF85Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:35:18.431387Z","bundle_sha256":"6de21c60850bbd06bc03f26d375573704344dd87c9d145ce8baca67e4f4f64a0"}}