{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HYUONQMFQF3737YYRU4YREDYJX","short_pith_number":"pith:HYUONQMF","schema_version":"1.0","canonical_sha256":"3e28e6c1858177fdff188d398890784dc9ca8f9cba235215076e8864e5a6161c","source":{"kind":"arxiv","id":"2203.16804","version":1},"attestation_state":"computed","paper":{"title":"BRIO: Bringing Order to Abstractive Summarization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dragomir Radev, Graham Neubig, Pengfei Liu, Yixin Liu","submitted_at":"2022-03-31T05:19:38Z","abstract_excerpt":"Abstractive summarization models are commonly trained using maximum likelihood estimation, which assumes a deterministic (one-point) target distribution in which an ideal model will assign all the probability mass to the reference summary. This assumption may lead to performance degradation during inference, where the model needs to compare several system-generated (candidate) summaries that have deviated from the reference summary. To address this problem, we propose a novel training paradigm which assumes a non-deterministic distribution so that different candidate summaries are assigned pro"},"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":"2203.16804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-03-31T05:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"f99d2b9adf4924034d7dcbfe71e25ec13eb4afefef9fbd3d5d826319e509cb24","abstract_canon_sha256":"0d8a7e13567c11adbb597c5ac45e5c2371e22f748db3e0d9116df7d4ff485738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:28.144082Z","signature_b64":"DTgvSvryZSYnvj8ymq9JCiKZNC12bXs980+pxeSMWrNVjfRjxF32phauc71ve3ax6WObP1pAh+8udbOYzNF9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e28e6c1858177fdff188d398890784dc9ca8f9cba235215076e8864e5a6161c","last_reissued_at":"2026-07-05T04:10:28.143599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:28.143599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BRIO: Bringing Order to Abstractive Summarization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dragomir Radev, Graham Neubig, Pengfei Liu, Yixin Liu","submitted_at":"2022-03-31T05:19:38Z","abstract_excerpt":"Abstractive summarization models are commonly trained using maximum likelihood estimation, which assumes a deterministic (one-point) target distribution in which an ideal model will assign all the probability mass to the reference summary. This assumption may lead to performance degradation during inference, where the model needs to compare several system-generated (candidate) summaries that have deviated from the reference summary. To address this problem, we propose a novel training paradigm which assumes a non-deterministic distribution so that different candidate summaries are assigned pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.16804","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/2203.16804/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":"2203.16804","created_at":"2026-07-05T04:10:28.143656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.16804v1","created_at":"2026-07-05T04:10:28.143656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.16804","created_at":"2026-07-05T04:10:28.143656+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYUONQMFQF37","created_at":"2026-07-05T04:10:28.143656+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYUONQMFQF3737YY","created_at":"2026-07-05T04:10:28.143656+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYUONQMF","created_at":"2026-07-05T04:10:28.143656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17200","citing_title":"Calibrating Model-Based Evaluation Metrics for Summarization","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17197","citing_title":"Learning to Control Summaries with Score Ranking","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX","json":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX.json","graph_json":"https://pith.science/api/pith-number/HYUONQMFQF3737YYRU4YREDYJX/graph.json","events_json":"https://pith.science/api/pith-number/HYUONQMFQF3737YYRU4YREDYJX/events.json","paper":"https://pith.science/paper/HYUONQMF"},"agent_actions":{"view_html":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX","download_json":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX.json","view_paper":"https://pith.science/paper/HYUONQMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.16804&json=true","fetch_graph":"https://pith.science/api/pith-number/HYUONQMFQF3737YYRU4YREDYJX/graph.json","fetch_events":"https://pith.science/api/pith-number/HYUONQMFQF3737YYRU4YREDYJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX/action/storage_attestation","attest_author":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX/action/author_attestation","sign_citation":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX/action/citation_signature","submit_replication":"https://pith.science/pith/HYUONQMFQF3737YYRU4YREDYJX/action/replication_record"}},"created_at":"2026-07-05T04:10:28.143656+00:00","updated_at":"2026-07-05T04:10:28.143656+00:00"}