{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:O5RQ5RNLSBK3HZ4BSBEH3774LZ","short_pith_number":"pith:O5RQ5RNL","canonical_record":{"source":{"id":"2104.02112","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-05T18:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"feb344fcb23902a4eb395e9e35ccbea01280c07e265e99e99a2b6a4b7bf35604","abstract_canon_sha256":"ecfed84661c1ca80736b092f3e3f8fad667dffb3155c2fc67888cf7dc0b2114b"},"schema_version":"1.0"},"canonical_sha256":"77630ec5ab9055b3e78190487dfffc5e79dde68ced3eca852fc4e556b8cea672","source":{"kind":"arxiv","id":"2104.02112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.02112","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"2104.02112v2","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02112","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"O5RQ5RNLSBK3","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"O5RQ5RNLSBK3HZ4B","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"O5RQ5RNL","created_at":"2026-07-05T02:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:O5RQ5RNLSBK3HZ4BSBEH3774LZ","target":"record","payload":{"canonical_record":{"source":{"id":"2104.02112","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-05T18:45:13Z","cross_cats_sorted":[],"title_canon_sha256":"feb344fcb23902a4eb395e9e35ccbea01280c07e265e99e99a2b6a4b7bf35604","abstract_canon_sha256":"ecfed84661c1ca80736b092f3e3f8fad667dffb3155c2fc67888cf7dc0b2114b"},"schema_version":"1.0"},"canonical_sha256":"77630ec5ab9055b3e78190487dfffc5e79dde68ced3eca852fc4e556b8cea672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:31:05.399539Z","signature_b64":"vGZ85SBza5HIc15JHLLyZ1eMnViKtHOhoEvSfviy9xf7vcdIoaHOA+6+RGrKeMZ6YmHEhDdB2xpSDD8sNNKcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77630ec5ab9055b3e78190487dfffc5e79dde68ced3eca852fc4e556b8cea672","last_reissued_at":"2026-07-05T02:31:05.399035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:31:05.399035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.02112","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-07-05T02:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dg354NeP3g1nIDOJufvwnNHagKHqkkULSp1MDQqVnpDI7lq74ONhkvN6jcKbW/a4MobnNO46LOEM7gC/9C5PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:45:19.215501Z"},"content_sha256":"a7a3f3ba7243491460cfd35ecc190d403bf1a7069bdb44e4377f263d1dbb7fbb","schema_version":"1.0","event_id":"sha256:a7a3f3ba7243491460cfd35ecc190d403bf1a7069bdb44e4377f263d1dbb7fbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:O5RQ5RNLSBK3HZ4BSBEH3774LZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Attentions for Long Document Summarization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Heng Ji, Lu Wang, Luyang Huang, Nikolaus Parulian, Shuyang Cao","submitted_at":"2021-04-05T18:45:13Z","abstract_excerpt":"The quadratic computational and memory complexities of large Transformers have limited their scalability for long document summarization. In this paper, we propose Hepos, a novel efficient encoder-decoder attention with head-wise positional strides to effectively pinpoint salient information from the source. We further conduct a systematic study of existing efficient self-attentions. Combined with Hepos, we are able to process ten times more tokens than existing models that use full attentions. For evaluation, we present a new dataset, GovReport, with significantly longer documents and summari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02112","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.02112/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-05T02:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMgI2+eAbXS9BFTeOrFzKScxGQWNlqTO6+2YBbEdZMecT9eb8CEZJrCmFEhnzbHcKF18VQgjS3eqZLEdx0eIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:45:19.216189Z"},"content_sha256":"415bd48ca84546a836a5ef961a3bcf3d797504fc7403e1a6973b6d12cbe1fd52","schema_version":"1.0","event_id":"sha256:415bd48ca84546a836a5ef961a3bcf3d797504fc7403e1a6973b6d12cbe1fd52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ/bundle.json","state_url":"https://pith.science/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ/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-07T04:45:19Z","links":{"resolver":"https://pith.science/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ","bundle":"https://pith.science/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ/bundle.json","state":"https://pith.science/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5RQ5RNLSBK3HZ4BSBEH3774LZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:O5RQ5RNLSBK3HZ4BSBEH3774LZ","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":"ecfed84661c1ca80736b092f3e3f8fad667dffb3155c2fc67888cf7dc0b2114b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-05T18:45:13Z","title_canon_sha256":"feb344fcb23902a4eb395e9e35ccbea01280c07e265e99e99a2b6a4b7bf35604"},"schema_version":"1.0","source":{"id":"2104.02112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.02112","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"2104.02112v2","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02112","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"O5RQ5RNLSBK3","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"O5RQ5RNLSBK3HZ4B","created_at":"2026-07-05T02:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"O5RQ5RNL","created_at":"2026-07-05T02:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:415bd48ca84546a836a5ef961a3bcf3d797504fc7403e1a6973b6d12cbe1fd52","target":"graph","created_at":"2026-07-05T02:31:05Z","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/2104.02112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quadratic computational and memory complexities of large Transformers have limited their scalability for long document summarization. In this paper, we propose Hepos, a novel efficient encoder-decoder attention with head-wise positional strides to effectively pinpoint salient information from the source. We further conduct a systematic study of existing efficient self-attentions. Combined with Hepos, we are able to process ten times more tokens than existing models that use full attentions. For evaluation, we present a new dataset, GovReport, with significantly longer documents and summari","authors_text":"Heng Ji, Lu Wang, Luyang Huang, Nikolaus Parulian, Shuyang Cao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02112","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:a7a3f3ba7243491460cfd35ecc190d403bf1a7069bdb44e4377f263d1dbb7fbb","target":"record","created_at":"2026-07-05T02:31:05Z","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":"ecfed84661c1ca80736b092f3e3f8fad667dffb3155c2fc67888cf7dc0b2114b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-05T18:45:13Z","title_canon_sha256":"feb344fcb23902a4eb395e9e35ccbea01280c07e265e99e99a2b6a4b7bf35604"},"schema_version":"1.0","source":{"id":"2104.02112","kind":"arxiv","version":2}},"canonical_sha256":"77630ec5ab9055b3e78190487dfffc5e79dde68ced3eca852fc4e556b8cea672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77630ec5ab9055b3e78190487dfffc5e79dde68ced3eca852fc4e556b8cea672","first_computed_at":"2026-07-05T02:31:05.399035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:31:05.399035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGZ85SBza5HIc15JHLLyZ1eMnViKtHOhoEvSfviy9xf7vcdIoaHOA+6+RGrKeMZ6YmHEhDdB2xpSDD8sNNKcBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:31:05.399539Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.02112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7a3f3ba7243491460cfd35ecc190d403bf1a7069bdb44e4377f263d1dbb7fbb","sha256:415bd48ca84546a836a5ef961a3bcf3d797504fc7403e1a6973b6d12cbe1fd52"],"state_sha256":"bf500f697d196630b182ef3028dcaaf4bc60abc1fd6ee6b1b6bfd0bc9dd7dd1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzW3Avgkt3Z/5EuFgIeb+86bI1mZmIxKqstr8tEOz0hnuCUewDwQ7MtrhYnuLWrT+Z3PfYBcKyUMTpwibcAEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T04:45:19.220275Z","bundle_sha256":"dab4982b560c524c091e350bcde69504f203ec8c9489d97de0edaf1318461813"}}