{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KCXIZ7IJDFW6Z46RQMVF76MBHF","short_pith_number":"pith:KCXIZ7IJ","schema_version":"1.0","canonical_sha256":"50ae8cfd09196decf3d1832a5ff9813959d4519efac1161f16627f24d998fd7c","source":{"kind":"arxiv","id":"2309.04269","version":1},"attestation_state":"computed","paper":{"title":"From Sparse to Dense: GPT-4 Summarization with Chain of Density Prompting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Fabbri, Eric Lehman, Faisal Ladhak, Griffin Adams, No\\'emie Elhadad","submitted_at":"2023-09-08T11:31:08Z","abstract_excerpt":"Selecting the ``right'' amount of information to include in a summary is a difficult task. A good summary should be detailed and entity-centric without being overly dense and hard to follow. To better understand this tradeoff, we solicit increasingly dense GPT-4 summaries with what we refer to as a ``Chain of Density'' (CoD) prompt. Specifically, GPT-4 generates an initial entity-sparse summary before iteratively incorporating missing salient entities without increasing the length. Summaries generated by CoD are more abstractive, exhibit more fusion, and have less of a lead bias than GPT-4 sum"},"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":"2309.04269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-09-08T11:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"d055fa83d104d427a3cec05c55fc8fb3e2a756e4ce69a2576e967b8fcbcf0a5a","abstract_canon_sha256":"4003b67d83db41b9ec3f44a4c5d1e52f686387dc33e5f1594ad790f52d3e2878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:57.480501Z","signature_b64":"voqmMm0qNNbc11yHrcg6ZVpSQJSOadz2DEIxVYMHwq0GtjgIzIj3fypecVoLiCheHHsTzrWQUNH+QGUD3m1qBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ae8cfd09196decf3d1832a5ff9813959d4519efac1161f16627f24d998fd7c","last_reissued_at":"2026-07-05T06:48:57.480008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:57.480008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Sparse to Dense: GPT-4 Summarization with Chain of Density Prompting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Fabbri, Eric Lehman, Faisal Ladhak, Griffin Adams, No\\'emie Elhadad","submitted_at":"2023-09-08T11:31:08Z","abstract_excerpt":"Selecting the ``right'' amount of information to include in a summary is a difficult task. A good summary should be detailed and entity-centric without being overly dense and hard to follow. To better understand this tradeoff, we solicit increasingly dense GPT-4 summaries with what we refer to as a ``Chain of Density'' (CoD) prompt. Specifically, GPT-4 generates an initial entity-sparse summary before iteratively incorporating missing salient entities without increasing the length. Summaries generated by CoD are more abstractive, exhibit more fusion, and have less of a lead bias than GPT-4 sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04269","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.04269/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":"2309.04269","created_at":"2026-07-05T06:48:57.480069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.04269v1","created_at":"2026-07-05T06:48:57.480069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04269","created_at":"2026-07-05T06:48:57.480069+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCXIZ7IJDFW6","created_at":"2026-07-05T06:48:57.480069+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCXIZ7IJDFW6Z46R","created_at":"2026-07-05T06:48:57.480069+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCXIZ7IJ","created_at":"2026-07-05T06:48:57.480069+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21785","citing_title":"Comparing Learning Paradigms for Egocentric Video Summarization","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF","json":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF.json","graph_json":"https://pith.science/api/pith-number/KCXIZ7IJDFW6Z46RQMVF76MBHF/graph.json","events_json":"https://pith.science/api/pith-number/KCXIZ7IJDFW6Z46RQMVF76MBHF/events.json","paper":"https://pith.science/paper/KCXIZ7IJ"},"agent_actions":{"view_html":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF","download_json":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF.json","view_paper":"https://pith.science/paper/KCXIZ7IJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.04269&json=true","fetch_graph":"https://pith.science/api/pith-number/KCXIZ7IJDFW6Z46RQMVF76MBHF/graph.json","fetch_events":"https://pith.science/api/pith-number/KCXIZ7IJDFW6Z46RQMVF76MBHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF/action/storage_attestation","attest_author":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF/action/author_attestation","sign_citation":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF/action/citation_signature","submit_replication":"https://pith.science/pith/KCXIZ7IJDFW6Z46RQMVF76MBHF/action/replication_record"}},"created_at":"2026-07-05T06:48:57.480069+00:00","updated_at":"2026-07-05T06:48:57.480069+00:00"}