{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RJSZNGHRICBBQVZF43I75ONVFZ","short_pith_number":"pith:RJSZNGHR","schema_version":"1.0","canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","source":{"kind":"arxiv","id":"2606.31457","version":1},"attestation_state":"computed","paper":{"title":"Learning Fair Allocation of Indivisible Items from Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David Kempe, Evi Micha, Xinyu Liu","submitted_at":"2026-06-30T10:34:40Z","abstract_excerpt":"We study a setting in which an algorithm must output a fair allocation of indivisible items while \"learning on the job\". More specifically, the algorithm is to output an allocation satisfying EF1, PROP1, or similar fairness notions; however, the algorithm initially has no information about the agents' valuations, and can only learn about them by (repeatedly) proposing an allocation, and obtaining feedback about a fairness violation in the allocation. Importantly, the observed fairness violation may be adversarially chosen. The algorithm's goal is to converge to a fair allocation in rounds poly"},"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":"2606.31457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-30T10:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"1e24cd29911df3b19f0cd57308f7c3da6f40831555d04692be302594cc235c20","abstract_canon_sha256":"553f9d4f75c255db00fac12be6f43644c0b1593317f98a92e7d0f473c803f23c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:03.926476Z","signature_b64":"xDWbM6s/k6qpV48S42guVx6/GHUA0tbFedpglGUZ4oHm6K6b7FwlU/ZvI/FTjlFEbeKx8u3qC3NlG5Ih+n8ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","last_reissued_at":"2026-07-01T01:18:03.925960Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:03.925960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Fair Allocation of Indivisible Items from Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David Kempe, Evi Micha, Xinyu Liu","submitted_at":"2026-06-30T10:34:40Z","abstract_excerpt":"We study a setting in which an algorithm must output a fair allocation of indivisible items while \"learning on the job\". More specifically, the algorithm is to output an allocation satisfying EF1, PROP1, or similar fairness notions; however, the algorithm initially has no information about the agents' valuations, and can only learn about them by (repeatedly) proposing an allocation, and obtaining feedback about a fairness violation in the allocation. Importantly, the observed fairness violation may be adversarially chosen. The algorithm's goal is to converge to a fair allocation in rounds poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31457","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/2606.31457/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":"2606.31457","created_at":"2026-07-01T01:18:03.926039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31457v1","created_at":"2026-07-01T01:18:03.926039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31457","created_at":"2026-07-01T01:18:03.926039+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJSZNGHRICBB","created_at":"2026-07-01T01:18:03.926039+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJSZNGHRICBBQVZF","created_at":"2026-07-01T01:18:03.926039+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJSZNGHR","created_at":"2026-07-01T01:18:03.926039+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/RJSZNGHRICBBQVZF43I75ONVFZ","json":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ.json","graph_json":"https://pith.science/api/pith-number/RJSZNGHRICBBQVZF43I75ONVFZ/graph.json","events_json":"https://pith.science/api/pith-number/RJSZNGHRICBBQVZF43I75ONVFZ/events.json","paper":"https://pith.science/paper/RJSZNGHR"},"agent_actions":{"view_html":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ","download_json":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ.json","view_paper":"https://pith.science/paper/RJSZNGHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31457&json=true","fetch_graph":"https://pith.science/api/pith-number/RJSZNGHRICBBQVZF43I75ONVFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RJSZNGHRICBBQVZF43I75ONVFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/action/storage_attestation","attest_author":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/action/author_attestation","sign_citation":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/action/citation_signature","submit_replication":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/action/replication_record"}},"created_at":"2026-07-01T01:18:03.926039+00:00","updated_at":"2026-07-01T01:18:03.926039+00:00"}