{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5TA7EX6TEAQ4RPRI45WG52EAR2","short_pith_number":"pith:5TA7EX6T","schema_version":"1.0","canonical_sha256":"ecc1f25fd32021c8be28e76c6ee8808e99048725e9c9144f2388fe1d66dfa2de","source":{"kind":"arxiv","id":"2412.08795","version":2},"attestation_state":"computed","paper":{"title":"Coverage-based Fairness in Multi-document Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Haoyuan Li, Rui Zhang, Snigdha Chaturvedi, Yusen Zhang","submitted_at":"2024-12-11T22:01:30Z","abstract_excerpt":"Fairness in multi-document summarization (MDS) measures whether a system can generate a summary fairly representing information from documents with different social attribute values. Fairness in MDS is crucial since a fair summary can offer readers a comprehensive view. Previous works focus on quantifying summary-level fairness using Proportional Representation, a fairness measure based on Statistical Parity. However, Proportional Representation does not consider redundancy in input documents and overlooks corpus-level unfairness. In this work, we propose a new summary-level fairness measure, "},"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":"2412.08795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-12-11T22:01:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"db6c4c58cb15ae2cb882c2c095258313688ffd34e613192cd8502b15decec5b6","abstract_canon_sha256":"2b314948ecc772a14e9577c1a39bd6abc1c3edeeab1d8272860c5576edafb217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:39.936795Z","signature_b64":"+LnxVaVBJqMR6bU0GPDuU/LLHqpf+tePuXWVNSpbZyWNGPKHlFf1c/ECPyaz7jUIGGQiF6vb9SAXnnz28v2PBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc1f25fd32021c8be28e76c6ee8808e99048725e9c9144f2388fe1d66dfa2de","last_reissued_at":"2026-07-05T10:38:39.936308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:39.936308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coverage-based Fairness in Multi-document Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Haoyuan Li, Rui Zhang, Snigdha Chaturvedi, Yusen Zhang","submitted_at":"2024-12-11T22:01:30Z","abstract_excerpt":"Fairness in multi-document summarization (MDS) measures whether a system can generate a summary fairly representing information from documents with different social attribute values. Fairness in MDS is crucial since a fair summary can offer readers a comprehensive view. Previous works focus on quantifying summary-level fairness using Proportional Representation, a fairness measure based on Statistical Parity. However, Proportional Representation does not consider redundancy in input documents and overlooks corpus-level unfairness. In this work, we propose a new summary-level fairness measure, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08795","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/2412.08795/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":"2412.08795","created_at":"2026-07-05T10:38:39.936372+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.08795v2","created_at":"2026-07-05T10:38:39.936372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08795","created_at":"2026-07-05T10:38:39.936372+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TA7EX6TEAQ4","created_at":"2026-07-05T10:38:39.936372+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TA7EX6TEAQ4RPRI","created_at":"2026-07-05T10:38:39.936372+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TA7EX6T","created_at":"2026-07-05T10:38:39.936372+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07479","citing_title":"Improving Fairness of Large Language Models in Multi-document Summarization","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2","json":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2.json","graph_json":"https://pith.science/api/pith-number/5TA7EX6TEAQ4RPRI45WG52EAR2/graph.json","events_json":"https://pith.science/api/pith-number/5TA7EX6TEAQ4RPRI45WG52EAR2/events.json","paper":"https://pith.science/paper/5TA7EX6T"},"agent_actions":{"view_html":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2","download_json":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2.json","view_paper":"https://pith.science/paper/5TA7EX6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.08795&json=true","fetch_graph":"https://pith.science/api/pith-number/5TA7EX6TEAQ4RPRI45WG52EAR2/graph.json","fetch_events":"https://pith.science/api/pith-number/5TA7EX6TEAQ4RPRI45WG52EAR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2/action/storage_attestation","attest_author":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2/action/author_attestation","sign_citation":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2/action/citation_signature","submit_replication":"https://pith.science/pith/5TA7EX6TEAQ4RPRI45WG52EAR2/action/replication_record"}},"created_at":"2026-07-05T10:38:39.936372+00:00","updated_at":"2026-07-05T10:38:39.936372+00:00"}