{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I4FJC2NRSPXC2AX276U3HICG67","short_pith_number":"pith:I4FJC2NR","schema_version":"1.0","canonical_sha256":"470a9169b193ee2d02faffa9b3a046f7d13626ba1b1db0d9054f812497dece9a","source":{"kind":"arxiv","id":"1902.00672","version":1},"attestation_state":"computed","paper":{"title":"Query-oriented text summarization based on hypergraph transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hadrien Van Lierde, Tommy W. S. Chow","submitted_at":"2019-02-02T08:52:44Z","abstract_excerpt":"Existing graph- and hypergraph-based algorithms for document summarization represent the sentences of a corpus as the nodes of a graph or a hypergraph in which the edges represent relationships of lexical similarities between sentences. Each sentence of the corpus is then scored individually, using popular node ranking algorithms, and a summary is produced by extracting highly scored sentences. This approach fails to select a subset of jointly relevant sentences and it may produce redundant summaries that are missing important topics of the corpus. To alleviate this issue, a new hypergraph-bas"},"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":"1902.00672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-02T08:52:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d9b7ab8c3bc72d71cf540f2d5b316255e6e65b75aee4755489c444d980a88448","abstract_canon_sha256":"6578f641c1f41cc4789db0316943dbd66b1acd915e85152502d4fe3ef3657aaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:30.629751Z","signature_b64":"WeUkY8oAnxnCWkw6WOXHMfw9vINm/CgYXC8220IKXP9vuSvBSEOW7zkB1clGEkJl49onK/Q+mPGLeRG01V0eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"470a9169b193ee2d02faffa9b3a046f7d13626ba1b1db0d9054f812497dece9a","last_reissued_at":"2026-05-17T23:48:30.629014Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:30.629014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query-oriented text summarization based on hypergraph transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Hadrien Van Lierde, Tommy W. S. Chow","submitted_at":"2019-02-02T08:52:44Z","abstract_excerpt":"Existing graph- and hypergraph-based algorithms for document summarization represent the sentences of a corpus as the nodes of a graph or a hypergraph in which the edges represent relationships of lexical similarities between sentences. Each sentence of the corpus is then scored individually, using popular node ranking algorithms, and a summary is produced by extracting highly scored sentences. This approach fails to select a subset of jointly relevant sentences and it may produce redundant summaries that are missing important topics of the corpus. To alleviate this issue, a new hypergraph-bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00672","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":"1902.00672","created_at":"2026-05-17T23:48:30.629121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00672v1","created_at":"2026-05-17T23:48:30.629121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00672","created_at":"2026-05-17T23:48:30.629121+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4FJC2NRSPXC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4FJC2NRSPXC2AX2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4FJC2NR","created_at":"2026-05-18T12:33:18.533446+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/I4FJC2NRSPXC2AX276U3HICG67","json":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67.json","graph_json":"https://pith.science/api/pith-number/I4FJC2NRSPXC2AX276U3HICG67/graph.json","events_json":"https://pith.science/api/pith-number/I4FJC2NRSPXC2AX276U3HICG67/events.json","paper":"https://pith.science/paper/I4FJC2NR"},"agent_actions":{"view_html":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67","download_json":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67.json","view_paper":"https://pith.science/paper/I4FJC2NR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00672&json=true","fetch_graph":"https://pith.science/api/pith-number/I4FJC2NRSPXC2AX276U3HICG67/graph.json","fetch_events":"https://pith.science/api/pith-number/I4FJC2NRSPXC2AX276U3HICG67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67/action/storage_attestation","attest_author":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67/action/author_attestation","sign_citation":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67/action/citation_signature","submit_replication":"https://pith.science/pith/I4FJC2NRSPXC2AX276U3HICG67/action/replication_record"}},"created_at":"2026-05-17T23:48:30.629121+00:00","updated_at":"2026-05-17T23:48:30.629121+00:00"}