{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q7QBF2U2HR2SQQLRXVZGAHIFH7","short_pith_number":"pith:Q7QBF2U2","schema_version":"1.0","canonical_sha256":"87e012ea9a3c75284171bd72601d053ff1be0b98bda356f531e1a7bdfbd3287b","source":{"kind":"arxiv","id":"2203.11258","version":1},"attestation_state":"computed","paper":{"title":"Efficient Classification of Long Documents Using Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hyunji Hayley Park, Kashif Shah, Yogarshi Vyas","submitted_at":"2022-03-21T18:36:18Z","abstract_excerpt":"Several methods have been proposed for classifying long textual documents using Transformers. However, there is a lack of consensus on a benchmark to enable a fair comparison among different approaches. In this paper, we provide a comprehensive evaluation of the relative efficacy measured against various baselines and diverse datasets -- both in terms of accuracy as well as time and space overheads. Our datasets cover binary, multi-class, and multi-label classification tasks and represent various ways information is organized in a long text (e.g. information that is critical to making the clas"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.11258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-21T18:36:18Z","cross_cats_sorted":[],"title_canon_sha256":"29db820000a924254936029b4716a00516c751d876976a04148be5d7561a813a","abstract_canon_sha256":"1f226c7507da0a05ddb745c7d13a62d7ab7c726b8d155885f8c9a40e6e82dedd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:09.939337Z","signature_b64":"uYVIbnfliXDEuS8P2sakGGoZBJfrEoBMBtZ9RZGThlBK6NQql7ukkvTeRAYzXbguMiZEq3NiqtO7cFscZpncAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e012ea9a3c75284171bd72601d053ff1be0b98bda356f531e1a7bdfbd3287b","last_reissued_at":"2026-07-05T04:07:09.938865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:09.938865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Classification of Long Documents Using Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hyunji Hayley Park, Kashif Shah, Yogarshi Vyas","submitted_at":"2022-03-21T18:36:18Z","abstract_excerpt":"Several methods have been proposed for classifying long textual documents using Transformers. However, there is a lack of consensus on a benchmark to enable a fair comparison among different approaches. In this paper, we provide a comprehensive evaluation of the relative efficacy measured against various baselines and diverse datasets -- both in terms of accuracy as well as time and space overheads. Our datasets cover binary, multi-class, and multi-label classification tasks and represent various ways information is organized in a long text (e.g. information that is critical to making the clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.11258","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/2203.11258/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.11258","created_at":"2026-07-05T04:07:09.938926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.11258v1","created_at":"2026-07-05T04:07:09.938926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.11258","created_at":"2026-07-05T04:07:09.938926+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7QBF2U2HR2S","created_at":"2026-07-05T04:07:09.938926+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7QBF2U2HR2SQQLR","created_at":"2026-07-05T04:07:09.938926+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7QBF2U2","created_at":"2026-07-05T04:07:09.938926+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11737","citing_title":"Quizzard@INOVA Challenge 2025 -- Track A: Plug-and-Play Technique in Interleaved Multi-Image Model","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7","json":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7.json","graph_json":"https://pith.science/api/pith-number/Q7QBF2U2HR2SQQLRXVZGAHIFH7/graph.json","events_json":"https://pith.science/api/pith-number/Q7QBF2U2HR2SQQLRXVZGAHIFH7/events.json","paper":"https://pith.science/paper/Q7QBF2U2"},"agent_actions":{"view_html":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7","download_json":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7.json","view_paper":"https://pith.science/paper/Q7QBF2U2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.11258&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7QBF2U2HR2SQQLRXVZGAHIFH7/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7QBF2U2HR2SQQLRXVZGAHIFH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7/action/storage_attestation","attest_author":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7/action/author_attestation","sign_citation":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7/action/citation_signature","submit_replication":"https://pith.science/pith/Q7QBF2U2HR2SQQLRXVZGAHIFH7/action/replication_record"}},"created_at":"2026-07-05T04:07:09.938926+00:00","updated_at":"2026-07-05T04:07:09.938926+00:00"}