{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:25FZ5OR7ACACHSFFHHFCL7IOOK","short_pith_number":"pith:25FZ5OR7","schema_version":"1.0","canonical_sha256":"d74b9eba3f008023c8a539ca25fd0e72bcf217db80ca871b253109748b9342b6","source":{"kind":"arxiv","id":"2112.07536","version":2},"attestation_state":"computed","paper":{"title":"Tackling Query-Focused Summarization as A Knowledge-Intensive Task: A Pilot Study","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Evangelos Kanoulas, Svitlana Vakulenko, Thilina Rajapakse, Weijia Zhang, Yumo Xu","submitted_at":"2021-12-14T16:49:47Z","abstract_excerpt":"Query-focused summarization (QFS) requires generating a summary given a query using a set of relevant documents. However, such relevant documents should be annotated manually and thus are not readily available in realistic scenarios. To address this limitation, we tackle the QFS task as a knowledge-intensive (KI) task without access to any relevant documents. Instead, we assume that these documents are present in a large-scale knowledge corpus and should be retrieved first. To explore this new setting, we build a new dataset (KI-QFS) by adapting existing QFS datasets. In this dataset, answerin"},"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":"2112.07536","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2021-12-14T16:49:47Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"c127ce744f2889de223cc1bb33e769fd77cd666f9b560c727b755ee8204147c9","abstract_canon_sha256":"a8f44e1433c9020d1c1007bee1ad425a45fd8ec21fbdb9bc0757991859b8ace1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:42.707488Z","signature_b64":"gv/srvsDauvuxaqJYF+n4AuEsj8Di638GI/SiJZP3bPrvveFeMB+hnK23IjWEZ2T+FIx8fe5qc+RrJ/LsU3gAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74b9eba3f008023c8a539ca25fd0e72bcf217db80ca871b253109748b9342b6","last_reissued_at":"2026-07-05T06:35:42.706978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:42.706978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tackling Query-Focused Summarization as A Knowledge-Intensive Task: A Pilot Study","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Evangelos Kanoulas, Svitlana Vakulenko, Thilina Rajapakse, Weijia Zhang, Yumo Xu","submitted_at":"2021-12-14T16:49:47Z","abstract_excerpt":"Query-focused summarization (QFS) requires generating a summary given a query using a set of relevant documents. However, such relevant documents should be annotated manually and thus are not readily available in realistic scenarios. To address this limitation, we tackle the QFS task as a knowledge-intensive (KI) task without access to any relevant documents. Instead, we assume that these documents are present in a large-scale knowledge corpus and should be retrieved first. To explore this new setting, we build a new dataset (KI-QFS) by adapting existing QFS datasets. In this dataset, answerin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07536","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/2112.07536/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":"2112.07536","created_at":"2026-07-05T06:35:42.707032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.07536v2","created_at":"2026-07-05T06:35:42.707032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07536","created_at":"2026-07-05T06:35:42.707032+00:00"},{"alias_kind":"pith_short_12","alias_value":"25FZ5OR7ACAC","created_at":"2026-07-05T06:35:42.707032+00:00"},{"alias_kind":"pith_short_16","alias_value":"25FZ5OR7ACACHSFF","created_at":"2026-07-05T06:35:42.707032+00:00"},{"alias_kind":"pith_short_8","alias_value":"25FZ5OR7","created_at":"2026-07-05T06:35:42.707032+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16711","citing_title":"A Unified Retrieval Framework with Document Ranking and EDU Filtering for Multi-document Summarization","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK","json":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK.json","graph_json":"https://pith.science/api/pith-number/25FZ5OR7ACACHSFFHHFCL7IOOK/graph.json","events_json":"https://pith.science/api/pith-number/25FZ5OR7ACACHSFFHHFCL7IOOK/events.json","paper":"https://pith.science/paper/25FZ5OR7"},"agent_actions":{"view_html":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK","download_json":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK.json","view_paper":"https://pith.science/paper/25FZ5OR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.07536&json=true","fetch_graph":"https://pith.science/api/pith-number/25FZ5OR7ACACHSFFHHFCL7IOOK/graph.json","fetch_events":"https://pith.science/api/pith-number/25FZ5OR7ACACHSFFHHFCL7IOOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK/action/storage_attestation","attest_author":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK/action/author_attestation","sign_citation":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK/action/citation_signature","submit_replication":"https://pith.science/pith/25FZ5OR7ACACHSFFHHFCL7IOOK/action/replication_record"}},"created_at":"2026-07-05T06:35:42.707032+00:00","updated_at":"2026-07-05T06:35:42.707032+00:00"}