{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VFVJESTSFGMIKSNIGYZTLY3P2W","short_pith_number":"pith:VFVJESTS","canonical_record":{"source":{"id":"2012.00052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-30T19:07:27Z","cross_cats_sorted":[],"title_canon_sha256":"0d0e2f7d23bac2e66e11af49ab869a3901cb2a17ffdf0e4e58cd1e6600907c15","abstract_canon_sha256":"c4286149e0bb5ac63142d6e7fe2a52ad14d875d085bcc31e3c0925dae52dff7e"},"schema_version":"1.0"},"canonical_sha256":"a96a924a7229988549a8363335e36fd59981d1568635bf6751f8b548778ec01a","source":{"kind":"arxiv","id":"2012.00052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.00052","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"2012.00052v1","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00052","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"VFVJESTSFGMI","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"pith_short_16","alias_value":"VFVJESTSFGMIKSNI","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"pith_short_8","alias_value":"VFVJESTS","created_at":"2026-07-05T01:55:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VFVJESTSFGMIKSNIGYZTLY3P2W","target":"record","payload":{"canonical_record":{"source":{"id":"2012.00052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-30T19:07:27Z","cross_cats_sorted":[],"title_canon_sha256":"0d0e2f7d23bac2e66e11af49ab869a3901cb2a17ffdf0e4e58cd1e6600907c15","abstract_canon_sha256":"c4286149e0bb5ac63142d6e7fe2a52ad14d875d085bcc31e3c0925dae52dff7e"},"schema_version":"1.0"},"canonical_sha256":"a96a924a7229988549a8363335e36fd59981d1568635bf6751f8b548778ec01a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:31.758327Z","signature_b64":"Gt5cAnyU+RslT7uHFlEo3m5qhurbKtTjX3cH2Ly6Cnou9KUd25+/95jGDJmZSAfI1Uuhll/FTowQRCyzL3YJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a96a924a7229988549a8363335e36fd59981d1568635bf6751f8b548778ec01a","last_reissued_at":"2026-07-05T01:55:31.757736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:31.757736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.00052","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-07-05T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUjfghwjhpkxusLeqKYay0MbbJbyBYb75d/YWGydvo5XLSsueLmTLYAnrcURnDoOcgpOyoPnvVLk0ona+C0vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:31:52.855412Z"},"content_sha256":"b89a1d3c0f44809e2c7e719f4ee6f20f77e68e029b6079914d96daab09edea92","schema_version":"1.0","event_id":"sha256:b89a1d3c0f44809e2c7e719f4ee6f20f77e68e029b6079914d96daab09edea92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VFVJESTSFGMIKSNIGYZTLY3P2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Systematically Exploring Redundancy Reduction in Summarizing Long Documents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Giuseppe Carenini, Wen Xiao","submitted_at":"2020-11-30T19:07:27Z","abstract_excerpt":"Our analysis of large summarization datasets indicates that redundancy is a very serious problem when summarizing long documents. Yet, redundancy reduction has not been thoroughly investigated in neural summarization. In this work, we systematically explore and compare different ways to deal with redundancy when summarizing long documents. Specifically, we organize the existing methods into categories based on when and how the redundancy is considered. Then, in the context of these categories, we propose three additional methods balancing non-redundancy and importance in a general and flexible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00052","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.00052/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5sNeUqMP4yA7eDNnjzEknUe5NigLovAJ1hgXmM80NvIU/uU31h9YjT36uzopDvtGN+hMXU3jtNVXYAX/hJ+gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:31:52.855902Z"},"content_sha256":"14aebc6528291e685810dd05ea30dea5aeb67fc41edd34a709af3f4df0971942","schema_version":"1.0","event_id":"sha256:14aebc6528291e685810dd05ea30dea5aeb67fc41edd34a709af3f4df0971942"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFVJESTSFGMIKSNIGYZTLY3P2W/bundle.json","state_url":"https://pith.science/pith/VFVJESTSFGMIKSNIGYZTLY3P2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFVJESTSFGMIKSNIGYZTLY3P2W/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-08-10T09:31:52Z","links":{"resolver":"https://pith.science/pith/VFVJESTSFGMIKSNIGYZTLY3P2W","bundle":"https://pith.science/pith/VFVJESTSFGMIKSNIGYZTLY3P2W/bundle.json","state":"https://pith.science/pith/VFVJESTSFGMIKSNIGYZTLY3P2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFVJESTSFGMIKSNIGYZTLY3P2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VFVJESTSFGMIKSNIGYZTLY3P2W","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":"c4286149e0bb5ac63142d6e7fe2a52ad14d875d085bcc31e3c0925dae52dff7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-30T19:07:27Z","title_canon_sha256":"0d0e2f7d23bac2e66e11af49ab869a3901cb2a17ffdf0e4e58cd1e6600907c15"},"schema_version":"1.0","source":{"id":"2012.00052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.00052","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"2012.00052v1","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00052","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"VFVJESTSFGMI","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"pith_short_16","alias_value":"VFVJESTSFGMIKSNI","created_at":"2026-07-05T01:55:31Z"},{"alias_kind":"pith_short_8","alias_value":"VFVJESTS","created_at":"2026-07-05T01:55:31Z"}],"graph_snapshots":[{"event_id":"sha256:14aebc6528291e685810dd05ea30dea5aeb67fc41edd34a709af3f4df0971942","target":"graph","created_at":"2026-07-05T01:55:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.00052/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Our analysis of large summarization datasets indicates that redundancy is a very serious problem when summarizing long documents. Yet, redundancy reduction has not been thoroughly investigated in neural summarization. In this work, we systematically explore and compare different ways to deal with redundancy when summarizing long documents. Specifically, we organize the existing methods into categories based on when and how the redundancy is considered. Then, in the context of these categories, we propose three additional methods balancing non-redundancy and importance in a general and flexible","authors_text":"Giuseppe Carenini, Wen Xiao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-30T19:07:27Z","title":"Systematically Exploring Redundancy Reduction in Summarizing Long Documents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00052","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:b89a1d3c0f44809e2c7e719f4ee6f20f77e68e029b6079914d96daab09edea92","target":"record","created_at":"2026-07-05T01:55:31Z","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":"c4286149e0bb5ac63142d6e7fe2a52ad14d875d085bcc31e3c0925dae52dff7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2020-11-30T19:07:27Z","title_canon_sha256":"0d0e2f7d23bac2e66e11af49ab869a3901cb2a17ffdf0e4e58cd1e6600907c15"},"schema_version":"1.0","source":{"id":"2012.00052","kind":"arxiv","version":1}},"canonical_sha256":"a96a924a7229988549a8363335e36fd59981d1568635bf6751f8b548778ec01a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a96a924a7229988549a8363335e36fd59981d1568635bf6751f8b548778ec01a","first_computed_at":"2026-07-05T01:55:31.757736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:55:31.757736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gt5cAnyU+RslT7uHFlEo3m5qhurbKtTjX3cH2Ly6Cnou9KUd25+/95jGDJmZSAfI1Uuhll/FTowQRCyzL3YJBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:55:31.758327Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.00052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b89a1d3c0f44809e2c7e719f4ee6f20f77e68e029b6079914d96daab09edea92","sha256:14aebc6528291e685810dd05ea30dea5aeb67fc41edd34a709af3f4df0971942"],"state_sha256":"e262442753fb915360636308fca65ad37acf536f8744562d642c7e5120bcfecc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZSjmXL7PhSe+QcR76hdoF//UHDDv0JFfJ/MaaOCn0IoMkzPwV5kR9m33TjlctZJ0FXE3iNXuNe3rrNK5KNYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:31:52.859984Z","bundle_sha256":"8c8dece6d31d1212c1552160add8774130fe17152ec1b1bbb070c02ba27509cd"}}