{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GVVLPU2TQENZFFAIX5BB6PFGO6","short_pith_number":"pith:GVVLPU2T","schema_version":"1.0","canonical_sha256":"356ab7d353811b929408bf421f3ca67793741d0efaedcd3e863129ce7b7d741d","source":{"kind":"arxiv","id":"2406.14784","version":1},"attestation_state":"computed","paper":{"title":"Active Learning for Fair and Stable Online Allocations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.OT"],"primary_cat":"cs.LG","authors_text":"Mohit Tawarmalani, Riddhiman Bhattacharya, Thanh Nguyen, Will Wei Sun","submitted_at":"2024-06-20T23:23:23Z","abstract_excerpt":"We explore an active learning approach for dynamic fair resource allocation problems. Unlike previous work that assumes full feedback from all agents on their allocations, we consider feedback from a select subset of agents at each epoch of the online resource allocation process. Despite this restriction, our proposed algorithms provide regret bounds that are sub-linear in number of time-periods for various measures that include fairness metrics commonly used in resource allocation problems and stability considerations in matching mechanisms. The key insight of our algorithms lies in adaptivel"},"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":"2406.14784","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-20T23:23:23Z","cross_cats_sorted":["stat.OT"],"title_canon_sha256":"b693d93996a316dc8a549d36eab370674eb999b6dd9537d507e6cd313958ce84","abstract_canon_sha256":"d2d0d1092dea536967a7a5f4e21c1c0129af7db9161e628bd6ac577bd10ec1f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:08.357226Z","signature_b64":"aJKT+s9QRSVETTltTkbrcMYBO6v40FE37KtNvCNO9i8pbRarS+VY3XbauNusl05C/H9CkMZGWpmjl8hy/CB+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"356ab7d353811b929408bf421f3ca67793741d0efaedcd3e863129ce7b7d741d","last_reissued_at":"2026-07-05T08:35:08.356751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:08.356751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Learning for Fair and Stable Online Allocations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.OT"],"primary_cat":"cs.LG","authors_text":"Mohit Tawarmalani, Riddhiman Bhattacharya, Thanh Nguyen, Will Wei Sun","submitted_at":"2024-06-20T23:23:23Z","abstract_excerpt":"We explore an active learning approach for dynamic fair resource allocation problems. Unlike previous work that assumes full feedback from all agents on their allocations, we consider feedback from a select subset of agents at each epoch of the online resource allocation process. Despite this restriction, our proposed algorithms provide regret bounds that are sub-linear in number of time-periods for various measures that include fairness metrics commonly used in resource allocation problems and stability considerations in matching mechanisms. The key insight of our algorithms lies in adaptivel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14784","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/2406.14784/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":"2406.14784","created_at":"2026-07-05T08:35:08.356810+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.14784v1","created_at":"2026-07-05T08:35:08.356810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14784","created_at":"2026-07-05T08:35:08.356810+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVVLPU2TQENZ","created_at":"2026-07-05T08:35:08.356810+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVVLPU2TQENZFFAI","created_at":"2026-07-05T08:35:08.356810+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVVLPU2T","created_at":"2026-07-05T08:35:08.356810+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/GVVLPU2TQENZFFAIX5BB6PFGO6","json":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6.json","graph_json":"https://pith.science/api/pith-number/GVVLPU2TQENZFFAIX5BB6PFGO6/graph.json","events_json":"https://pith.science/api/pith-number/GVVLPU2TQENZFFAIX5BB6PFGO6/events.json","paper":"https://pith.science/paper/GVVLPU2T"},"agent_actions":{"view_html":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6","download_json":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6.json","view_paper":"https://pith.science/paper/GVVLPU2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.14784&json=true","fetch_graph":"https://pith.science/api/pith-number/GVVLPU2TQENZFFAIX5BB6PFGO6/graph.json","fetch_events":"https://pith.science/api/pith-number/GVVLPU2TQENZFFAIX5BB6PFGO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6/action/storage_attestation","attest_author":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6/action/author_attestation","sign_citation":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6/action/citation_signature","submit_replication":"https://pith.science/pith/GVVLPU2TQENZFFAIX5BB6PFGO6/action/replication_record"}},"created_at":"2026-07-05T08:35:08.356810+00:00","updated_at":"2026-07-05T08:35:08.356810+00:00"}