{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4KDGY3CHG4V3ULANCKQ23UB7UN","short_pith_number":"pith:4KDGY3CH","schema_version":"1.0","canonical_sha256":"e2866c6c47372bba2c0d12a1add03fa34b9819f08bb0ed0eb1bb3ef05a1b04ee","source":{"kind":"arxiv","id":"2310.19233","version":3},"attestation_state":"computed","paper":{"title":"Building Real-World Meeting Summarization Systems using Large Language Models: A Practical Perspective","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cheng Chen, Md Tahmid Rahman Laskar, Shashi Bhushan TN, Xue-Yong Fu","submitted_at":"2023-10-30T02:25:21Z","abstract_excerpt":"This paper studies how to effectively build meeting summarization systems for real-world usage using large language models (LLMs). For this purpose, we conduct an extensive evaluation and comparison of various closed-source and open-source LLMs, namely, GPT-4, GPT- 3.5, PaLM-2, and LLaMA-2. Our findings reveal that most closed-source LLMs are generally better in terms of performance. However, much smaller open-source models like LLaMA- 2 (7B and 13B) could still achieve performance comparable to the large closed-source models even in zero-shot scenarios. Considering the privacy concerns of clo"},"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":"2310.19233","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-30T02:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"8138d54c2e0087b31e333275ed3f675885bfa296686390c4915a93331bcd570c","abstract_canon_sha256":"282b413746e1c09ce77c4c442b58a3abf96d4bc423a65251d48beeceaaddaac1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:29.985110Z","signature_b64":"RJ7QQiRIwMuFnP8IPlGA/bu4QAmR3F2j6uw8p3e0XABwve8bhmmoe8kEDRPn0lE5vW5lnq/t4qQZgxAwpiD7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2866c6c47372bba2c0d12a1add03fa34b9819f08bb0ed0eb1bb3ef05a1b04ee","last_reissued_at":"2026-07-05T07:10:29.984623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:29.984623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Building Real-World Meeting Summarization Systems using Large Language Models: A Practical Perspective","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cheng Chen, Md Tahmid Rahman Laskar, Shashi Bhushan TN, Xue-Yong Fu","submitted_at":"2023-10-30T02:25:21Z","abstract_excerpt":"This paper studies how to effectively build meeting summarization systems for real-world usage using large language models (LLMs). For this purpose, we conduct an extensive evaluation and comparison of various closed-source and open-source LLMs, namely, GPT-4, GPT- 3.5, PaLM-2, and LLaMA-2. Our findings reveal that most closed-source LLMs are generally better in terms of performance. However, much smaller open-source models like LLaMA- 2 (7B and 13B) could still achieve performance comparable to the large closed-source models even in zero-shot scenarios. Considering the privacy concerns of clo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19233","kind":"arxiv","version":3},"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/2310.19233/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":"2310.19233","created_at":"2026-07-05T07:10:29.984683+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19233v3","created_at":"2026-07-05T07:10:29.984683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19233","created_at":"2026-07-05T07:10:29.984683+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KDGY3CHG4V3","created_at":"2026-07-05T07:10:29.984683+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KDGY3CHG4V3ULAN","created_at":"2026-07-05T07:10:29.984683+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KDGY3CH","created_at":"2026-07-05T07:10:29.984683+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16321","citing_title":"LLM-Based Multi-Agent Systems for Code Generation: A Multi-Vocal Literature Review","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN","json":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN.json","graph_json":"https://pith.science/api/pith-number/4KDGY3CHG4V3ULANCKQ23UB7UN/graph.json","events_json":"https://pith.science/api/pith-number/4KDGY3CHG4V3ULANCKQ23UB7UN/events.json","paper":"https://pith.science/paper/4KDGY3CH"},"agent_actions":{"view_html":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN","download_json":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN.json","view_paper":"https://pith.science/paper/4KDGY3CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19233&json=true","fetch_graph":"https://pith.science/api/pith-number/4KDGY3CHG4V3ULANCKQ23UB7UN/graph.json","fetch_events":"https://pith.science/api/pith-number/4KDGY3CHG4V3ULANCKQ23UB7UN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN/action/storage_attestation","attest_author":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN/action/author_attestation","sign_citation":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN/action/citation_signature","submit_replication":"https://pith.science/pith/4KDGY3CHG4V3ULANCKQ23UB7UN/action/replication_record"}},"created_at":"2026-07-05T07:10:29.984683+00:00","updated_at":"2026-07-05T07:10:29.984683+00:00"}