{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ONTGOQUEF4NUIBPU4R3TFIBYEX","short_pith_number":"pith:ONTGOQUE","schema_version":"1.0","canonical_sha256":"73666742842f1b4405f4e47732a03825c4ad96541513c14a01d9d9c4c2d8f31b","source":{"kind":"arxiv","id":"1906.03508","version":1},"attestation_state":"computed","paper":{"title":"Sentence Centrality Revisited for Unsupervised Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Zheng, Mirella Lapata","submitted_at":"2019-06-08T19:27:31Z","abstract_excerpt":"Single document summarization has enjoyed renewed interests in recent years thanks to the popularity of neural network models and the availability of large-scale datasets. In this paper we develop an unsupervised approach arguing that it is unrealistic to expect large-scale and high-quality training data to be available or created for different types of summaries, domains, or languages. We revisit a popular graph-based ranking algorithm and modify how node (aka sentence) centrality is computed in two ways: (a)~we employ BERT, a state-of-the-art neural representation learning model to better ca"},"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":"1906.03508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-08T19:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"67223f1b7c0d98f538ac48b53aa16e189fed1c2459e58e92e1c0002ebfda8075","abstract_canon_sha256":"ec13e02d314ffe7c6c5e1e647b6bbdda7c73690d823758eb55232982e64854e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:48.254128Z","signature_b64":"NLz96uO4h+bYdrzw0xGQu5lbl+xj0S5eRP80WT4xxDbO4XFVuhFyeEl0IvC/wR/T6faiwbvx+LXzkJtkOILnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73666742842f1b4405f4e47732a03825c4ad96541513c14a01d9d9c4c2d8f31b","last_reissued_at":"2026-05-17T23:43:48.253686Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:48.253686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sentence Centrality Revisited for Unsupervised Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hao Zheng, Mirella Lapata","submitted_at":"2019-06-08T19:27:31Z","abstract_excerpt":"Single document summarization has enjoyed renewed interests in recent years thanks to the popularity of neural network models and the availability of large-scale datasets. In this paper we develop an unsupervised approach arguing that it is unrealistic to expect large-scale and high-quality training data to be available or created for different types of summaries, domains, or languages. We revisit a popular graph-based ranking algorithm and modify how node (aka sentence) centrality is computed in two ways: (a)~we employ BERT, a state-of-the-art neural representation learning model to better ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03508","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.03508","created_at":"2026-05-17T23:43:48.253749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03508v1","created_at":"2026-05-17T23:43:48.253749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03508","created_at":"2026-05-17T23:43:48.253749+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONTGOQUEF4NU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONTGOQUEF4NUIBPU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONTGOQUE","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07891","citing_title":"TrumorGPT: Graph-Based Retrieval-Augmented Large Language Model for Fact-Checking","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX","json":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX.json","graph_json":"https://pith.science/api/pith-number/ONTGOQUEF4NUIBPU4R3TFIBYEX/graph.json","events_json":"https://pith.science/api/pith-number/ONTGOQUEF4NUIBPU4R3TFIBYEX/events.json","paper":"https://pith.science/paper/ONTGOQUE"},"agent_actions":{"view_html":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX","download_json":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX.json","view_paper":"https://pith.science/paper/ONTGOQUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03508&json=true","fetch_graph":"https://pith.science/api/pith-number/ONTGOQUEF4NUIBPU4R3TFIBYEX/graph.json","fetch_events":"https://pith.science/api/pith-number/ONTGOQUEF4NUIBPU4R3TFIBYEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX/action/storage_attestation","attest_author":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX/action/author_attestation","sign_citation":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX/action/citation_signature","submit_replication":"https://pith.science/pith/ONTGOQUEF4NUIBPU4R3TFIBYEX/action/replication_record"}},"created_at":"2026-05-17T23:43:48.253749+00:00","updated_at":"2026-05-17T23:43:48.253749+00:00"}