{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WICYPLET34DVMKZGFDSV5FSYTP","short_pith_number":"pith:WICYPLET","canonical_record":{"source":{"id":"1809.09096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-24T11:00:57Z","cross_cats_sorted":["cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"9b3cc18a807c730f50db677d835ed7d439024ef0c73354a20be08cae80a2d00d","abstract_canon_sha256":"1d2b78376303c2ec4b640ea4c3e33fbb273ba75f13866c4aaa45fa5ec9687656"},"schema_version":"1.0"},"canonical_sha256":"b20587ac93df07562b2628e55e96589bdfb4d48503ebac6748d9a2a7834f198f","source":{"kind":"arxiv","id":"1809.09096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09096","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09096v1","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09096","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"WICYPLET34DV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WICYPLET34DVMKZG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WICYPLET","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WICYPLET34DVMKZGFDSV5FSYTP","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-24T11:00:57Z","cross_cats_sorted":["cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"9b3cc18a807c730f50db677d835ed7d439024ef0c73354a20be08cae80a2d00d","abstract_canon_sha256":"1d2b78376303c2ec4b640ea4c3e33fbb273ba75f13866c4aaa45fa5ec9687656"},"schema_version":"1.0"},"canonical_sha256":"b20587ac93df07562b2628e55e96589bdfb4d48503ebac6748d9a2a7834f198f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:54.221528Z","signature_b64":"MmC7tlIpSeG55Sgtq/yU9OjkV13wbTvgHZkcUumwrg6nCzqqUdivrcuEzW0oXx8CUYwaK4tOfLHdBXSOahkHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b20587ac93df07562b2628e55e96589bdfb4d48503ebac6748d9a2a7834f198f","last_reissued_at":"2026-05-18T00:04:54.221021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:54.221021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09096","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:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZJ62UW6H75ajLPws/jTzbWqM3qkNI+OsGevuhON3l4/+kSqDRGXPgtqLoExXfbRvQQUOSlYfQYNe/5i6XH0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:07:25.708392Z"},"content_sha256":"522ea973ebae6591b6721336ca4016faf9584c08611f73e5b8ed4c2e6179525b","schema_version":"1.0","event_id":"sha256:522ea973ebae6591b6721336ca4016faf9584c08611f73e5b8ed4c2e6179525b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WICYPLET34DVMKZGFDSV5FSYTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Text Summarization as Tree Transduction by Top-Down TreeLSTM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.IR","authors_text":"Antonio Bruno, Davide Bacciu","submitted_at":"2018-09-24T11:00:57Z","abstract_excerpt":"Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by this, we introduce a deep neural model for learning structure-to-substructure tree transductions by extending the standard Long Short-Term Memory, considering the parent-child relationships in the structural recursion. The proposed model can achieve state of the art performance on sentence compression benchmarks, both in terms of accuracy and compression rate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09096","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:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkXOHBVl3QLgsrin1mLOwkrV43qqDNNt2Mn/eKM0i+UCbhLjemOXbNwNfERQ9ekFLKItf3b7fwIQwy0V/QV7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:07:25.708745Z"},"content_sha256":"c7fea8947c38d11896d06a8ba40aed25621ba64ae51dfa3d53502d63a0689baa","schema_version":"1.0","event_id":"sha256:c7fea8947c38d11896d06a8ba40aed25621ba64ae51dfa3d53502d63a0689baa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WICYPLET34DVMKZGFDSV5FSYTP/bundle.json","state_url":"https://pith.science/pith/WICYPLET34DVMKZGFDSV5FSYTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WICYPLET34DVMKZGFDSV5FSYTP/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-04T20:07:25Z","links":{"resolver":"https://pith.science/pith/WICYPLET34DVMKZGFDSV5FSYTP","bundle":"https://pith.science/pith/WICYPLET34DVMKZGFDSV5FSYTP/bundle.json","state":"https://pith.science/pith/WICYPLET34DVMKZGFDSV5FSYTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WICYPLET34DVMKZGFDSV5FSYTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WICYPLET34DVMKZGFDSV5FSYTP","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":"1d2b78376303c2ec4b640ea4c3e33fbb273ba75f13866c4aaa45fa5ec9687656","cross_cats_sorted":["cs.LG","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-24T11:00:57Z","title_canon_sha256":"9b3cc18a807c730f50db677d835ed7d439024ef0c73354a20be08cae80a2d00d"},"schema_version":"1.0","source":{"id":"1809.09096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09096","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09096v1","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09096","created_at":"2026-05-18T00:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"WICYPLET34DV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WICYPLET34DVMKZG","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WICYPLET","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:c7fea8947c38d11896d06a8ba40aed25621ba64ae51dfa3d53502d63a0689baa","target":"graph","created_at":"2026-05-18T00:04:54Z","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":"Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by this, we introduce a deep neural model for learning structure-to-substructure tree transductions by extending the standard Long Short-Term Memory, considering the parent-child relationships in the structural recursion. The proposed model can achieve state of the art performance on sentence compression benchmarks, both in terms of accuracy and compression rate.","authors_text":"Antonio Bruno, Davide Bacciu","cross_cats":["cs.LG","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-24T11:00:57Z","title":"Text Summarization as Tree Transduction by Top-Down TreeLSTM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09096","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:522ea973ebae6591b6721336ca4016faf9584c08611f73e5b8ed4c2e6179525b","target":"record","created_at":"2026-05-18T00:04:54Z","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":"1d2b78376303c2ec4b640ea4c3e33fbb273ba75f13866c4aaa45fa5ec9687656","cross_cats_sorted":["cs.LG","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-24T11:00:57Z","title_canon_sha256":"9b3cc18a807c730f50db677d835ed7d439024ef0c73354a20be08cae80a2d00d"},"schema_version":"1.0","source":{"id":"1809.09096","kind":"arxiv","version":1}},"canonical_sha256":"b20587ac93df07562b2628e55e96589bdfb4d48503ebac6748d9a2a7834f198f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b20587ac93df07562b2628e55e96589bdfb4d48503ebac6748d9a2a7834f198f","first_computed_at":"2026-05-18T00:04:54.221021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:54.221021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MmC7tlIpSeG55Sgtq/yU9OjkV13wbTvgHZkcUumwrg6nCzqqUdivrcuEzW0oXx8CUYwaK4tOfLHdBXSOahkHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:54.221528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:522ea973ebae6591b6721336ca4016faf9584c08611f73e5b8ed4c2e6179525b","sha256:c7fea8947c38d11896d06a8ba40aed25621ba64ae51dfa3d53502d63a0689baa"],"state_sha256":"db439bf4872ec5af68de732995f4d8a8b0e7b0fc5e6c313a0d22f82b08521c8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"np7D5KTbkMJNVGGcmvWpWu2gM4ouEhYq7QqvEI8p6Qp5g7EhaXqrlcKIl4OMgw/DVqwIn4Djj81FadX++qlGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:07:25.710677Z","bundle_sha256":"117a163a2f264c9c491fa40a082f5d8392a5ae92a33abfd06e42d828a6b17527"}}