{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PWUUHTKLQXUVTAAYKEYA4WCDY2","short_pith_number":"pith:PWUUHTKL","schema_version":"1.0","canonical_sha256":"7da943cd4b85e959801851300e5843c6a913e2994e916087692a2861646f4745","source":{"kind":"arxiv","id":"2508.12549","version":1},"attestation_state":"computed","paper":{"title":"Group Fair Matchings using Convex Cost Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Anand Louis, Atasi Panda, Harsh Sharma, Prajakta Nimbhorkar","submitted_at":"2025-08-18T01:05:51Z","abstract_excerpt":"We consider the problem of assigning items to platforms where each item has a utility associated with each of the platforms to which it can be assigned. Each platform has a soft constraint over the total number of items it serves, modeled via a convex cost function. Additionally, items are partitioned into groups, and each platform also incurs group-specific convex cost over the number of items from each group that can be assigned to the platform. These costs promote group fairness by penalizing imbalances, yielding a soft variation of fairness notions introduced in prior work, such as Restric"},"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":"2508.12549","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-18T01:05:51Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"b329d7f07b34c2d1247d0e2d432069e18cdeb609b5be4ccf980797cf4258756d","abstract_canon_sha256":"b550234463b538f5fce5d548b1fee75fe18afec5a10071a603fee42d84d2b1d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:22.882446Z","signature_b64":"Wkel7yWVg36/Em5+kT0EBMIYjk0KBCgAabfjlm3hjbqZxHOljDXRO6Nxgd3xolUJXjDsFhIaY449014Fbs5MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7da943cd4b85e959801851300e5843c6a913e2994e916087692a2861646f4745","last_reissued_at":"2026-07-05T11:55:22.881908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:22.881908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Fair Matchings using Convex Cost Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Anand Louis, Atasi Panda, Harsh Sharma, Prajakta Nimbhorkar","submitted_at":"2025-08-18T01:05:51Z","abstract_excerpt":"We consider the problem of assigning items to platforms where each item has a utility associated with each of the platforms to which it can be assigned. Each platform has a soft constraint over the total number of items it serves, modeled via a convex cost function. Additionally, items are partitioned into groups, and each platform also incurs group-specific convex cost over the number of items from each group that can be assigned to the platform. These costs promote group fairness by penalizing imbalances, yielding a soft variation of fairness notions introduced in prior work, such as Restric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12549","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/2508.12549/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":"2508.12549","created_at":"2026-07-05T11:55:22.881998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12549v1","created_at":"2026-07-05T11:55:22.881998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12549","created_at":"2026-07-05T11:55:22.881998+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWUUHTKLQXUV","created_at":"2026-07-05T11:55:22.881998+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWUUHTKLQXUVTAAY","created_at":"2026-07-05T11:55:22.881998+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWUUHTKL","created_at":"2026-07-05T11:55:22.881998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2","json":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2.json","graph_json":"https://pith.science/api/pith-number/PWUUHTKLQXUVTAAYKEYA4WCDY2/graph.json","events_json":"https://pith.science/api/pith-number/PWUUHTKLQXUVTAAYKEYA4WCDY2/events.json","paper":"https://pith.science/paper/PWUUHTKL"},"agent_actions":{"view_html":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2","download_json":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2.json","view_paper":"https://pith.science/paper/PWUUHTKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12549&json=true","fetch_graph":"https://pith.science/api/pith-number/PWUUHTKLQXUVTAAYKEYA4WCDY2/graph.json","fetch_events":"https://pith.science/api/pith-number/PWUUHTKLQXUVTAAYKEYA4WCDY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2/action/storage_attestation","attest_author":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2/action/author_attestation","sign_citation":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2/action/citation_signature","submit_replication":"https://pith.science/pith/PWUUHTKLQXUVTAAYKEYA4WCDY2/action/replication_record"}},"created_at":"2026-07-05T11:55:22.881998+00:00","updated_at":"2026-07-05T11:55:22.881998+00:00"}