{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LSPPHAXMMBFG2WXQZMFJVTKCDF","short_pith_number":"pith:LSPPHAXM","schema_version":"1.0","canonical_sha256":"5c9ef382ec604a6d5af0cb0a9acd421959abdcdafc37840df50aa079d9cec6d6","source":{"kind":"arxiv","id":"2305.03319","version":2},"attestation_state":"computed","paper":{"title":"HiPool: Modeling Long Documents Using Graph Neural Networks","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aosong Feng, Dragomir Radev, Irene Li, Rex Ying","submitted_at":"2023-05-05T06:58:24Z","abstract_excerpt":"Encoding long sequences in Natural Language Processing (NLP) is a challenging problem. Though recent pretraining language models achieve satisfying performances in many NLP tasks, they are still restricted by a pre-defined maximum length, making them challenging to be extended to longer sequences. So some recent works utilize hierarchies to model long sequences. However, most of them apply sequential models for upper hierarchies, suffering from long dependency issues. In this paper, we alleviate these issues through a graph-based method. We first chunk the sequence with a fixed length to model"},"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":"2305.03319","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CL","submitted_at":"2023-05-05T06:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"baa8a1b62fedc4e9b5a22b26c25701ce6534cd53e8af38343097e830be58191f","abstract_canon_sha256":"2b85866c465d48bad882a66632966813753a3377418922120420e98bd998c8ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:51.511348Z","signature_b64":"efquLTVyypvnjo1l/QmbeU5WRvYPjd5CnjjYrou6L0okVZlAkPP08Z014txGZQGhs13eAri0CDnVLg5JtQ6qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c9ef382ec604a6d5af0cb0a9acd421959abdcdafc37840df50aa079d9cec6d6","last_reissued_at":"2026-07-05T06:09:51.510922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:51.510922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HiPool: Modeling Long Documents Using Graph Neural Networks","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aosong Feng, Dragomir Radev, Irene Li, Rex Ying","submitted_at":"2023-05-05T06:58:24Z","abstract_excerpt":"Encoding long sequences in Natural Language Processing (NLP) is a challenging problem. Though recent pretraining language models achieve satisfying performances in many NLP tasks, they are still restricted by a pre-defined maximum length, making them challenging to be extended to longer sequences. So some recent works utilize hierarchies to model long sequences. However, most of them apply sequential models for upper hierarchies, suffering from long dependency issues. In this paper, we alleviate these issues through a graph-based method. We first chunk the sequence with a fixed length to model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03319","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/2305.03319/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":"2305.03319","created_at":"2026-07-05T06:09:51.510974+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.03319v2","created_at":"2026-07-05T06:09:51.510974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03319","created_at":"2026-07-05T06:09:51.510974+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSPPHAXMMBFG","created_at":"2026-07-05T06:09:51.510974+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSPPHAXMMBFG2WXQ","created_at":"2026-07-05T06:09:51.510974+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSPPHAXM","created_at":"2026-07-05T06:09:51.510974+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF","json":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF.json","graph_json":"https://pith.science/api/pith-number/LSPPHAXMMBFG2WXQZMFJVTKCDF/graph.json","events_json":"https://pith.science/api/pith-number/LSPPHAXMMBFG2WXQZMFJVTKCDF/events.json","paper":"https://pith.science/paper/LSPPHAXM"},"agent_actions":{"view_html":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF","download_json":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF.json","view_paper":"https://pith.science/paper/LSPPHAXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.03319&json=true","fetch_graph":"https://pith.science/api/pith-number/LSPPHAXMMBFG2WXQZMFJVTKCDF/graph.json","fetch_events":"https://pith.science/api/pith-number/LSPPHAXMMBFG2WXQZMFJVTKCDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF/action/storage_attestation","attest_author":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF/action/author_attestation","sign_citation":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF/action/citation_signature","submit_replication":"https://pith.science/pith/LSPPHAXMMBFG2WXQZMFJVTKCDF/action/replication_record"}},"created_at":"2026-07-05T06:09:51.510974+00:00","updated_at":"2026-07-05T06:09:51.510974+00:00"}