{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HM7YOPV2LIYDCTZTJ4BINNU45P","short_pith_number":"pith:HM7YOPV2","schema_version":"1.0","canonical_sha256":"3b3f873eba5a30314f334f0286b69cebda0271ab15e87d44bc42ff6fb779475a","source":{"kind":"arxiv","id":"1704.06528","version":2},"attestation_state":"computed","paper":{"title":"Fairness in Resource Allocation and Slowed-down Dependent Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, David G. Harris, Khoa Trinh, Thomas Pensyl","submitted_at":"2017-04-21T13:21:25Z","abstract_excerpt":"We consider an issue of much current concern: could fairness, an issue that is already difficult to guarantee, worsen when algorithms run much of our lives? We consider this in the context of resource-allocation problems, we show that algorithms can guarantee certain types of fairness in a verifiable way. Our conceptual contribution is a simple approach to fairness in this context, which only requires that all users trust some public lottery. Our technical contributions are in ways to address the $k$-center and knapsack-center problems that arise in this context: we develop a novel dependent-r"},"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":"1704.06528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T13:21:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f1efc8c60008558c9155052e55b0e6921d3d2437afaf6b6728641b3c1e11dcb8","abstract_canon_sha256":"9ba6c299c7ad46952f51159dfa327c6c346adeb55cd59f8e5d93ab9094fc1425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:30.907332Z","signature_b64":"z0W8qJXtaTN3N0DHS9vvc6NsS/Oc/ZrWRRracyJpm3UEy1B1BEeSuMxthCJIWfe2kX7NjzeeAYlu3PTl7k9+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3f873eba5a30314f334f0286b69cebda0271ab15e87d44bc42ff6fb779475a","last_reissued_at":"2026-05-18T00:34:30.906811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:30.906811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness in Resource Allocation and Slowed-down Dependent Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, David G. Harris, Khoa Trinh, Thomas Pensyl","submitted_at":"2017-04-21T13:21:25Z","abstract_excerpt":"We consider an issue of much current concern: could fairness, an issue that is already difficult to guarantee, worsen when algorithms run much of our lives? We consider this in the context of resource-allocation problems, we show that algorithms can guarantee certain types of fairness in a verifiable way. Our conceptual contribution is a simple approach to fairness in this context, which only requires that all users trust some public lottery. Our technical contributions are in ways to address the $k$-center and knapsack-center problems that arise in this context: we develop a novel dependent-r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06528","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":""},"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":"1704.06528","created_at":"2026-05-18T00:34:30.906890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06528v2","created_at":"2026-05-18T00:34:30.906890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06528","created_at":"2026-05-18T00:34:30.906890+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM7YOPV2LIYD","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM7YOPV2LIYDCTZT","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM7YOPV2","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14296","citing_title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","ref_index":90,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P","json":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P.json","graph_json":"https://pith.science/api/pith-number/HM7YOPV2LIYDCTZTJ4BINNU45P/graph.json","events_json":"https://pith.science/api/pith-number/HM7YOPV2LIYDCTZTJ4BINNU45P/events.json","paper":"https://pith.science/paper/HM7YOPV2"},"agent_actions":{"view_html":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P","download_json":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P.json","view_paper":"https://pith.science/paper/HM7YOPV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06528&json=true","fetch_graph":"https://pith.science/api/pith-number/HM7YOPV2LIYDCTZTJ4BINNU45P/graph.json","fetch_events":"https://pith.science/api/pith-number/HM7YOPV2LIYDCTZTJ4BINNU45P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P/action/storage_attestation","attest_author":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P/action/author_attestation","sign_citation":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P/action/citation_signature","submit_replication":"https://pith.science/pith/HM7YOPV2LIYDCTZTJ4BINNU45P/action/replication_record"}},"created_at":"2026-05-18T00:34:30.906890+00:00","updated_at":"2026-05-18T00:34:30.906890+00:00"}