{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G7YK2XREB5EMNFQW6XOOV2D5XH","short_pith_number":"pith:G7YK2XRE","schema_version":"1.0","canonical_sha256":"37f0ad5e240f48c69616f5dceae87db9fb5c2f63ad541d015be2ae87a4ed58db","source":{"kind":"arxiv","id":"2606.18679","version":2},"attestation_state":"computed","paper":{"title":"Fair Online Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Andrea Lodi, Christopher En, Gonzalo Mu\\~noz, Yuri Faenza","submitted_at":"2026-06-17T04:31:19Z","abstract_excerpt":"We study the problem of fair online resource allocation, motivated by applications such as refugee resettlement and airline scheduling, where agents arrive sequentially and must be assigned to facilities with limited capacities. We introduce a model that maximizes the overall welfare subject to resource constraints and a Lipschitz fairness requirement, which ensures that similar agents arriving in the same batch receive similar expected outcomes. We first analyze the offline problem, proving that the value of the optimal fair allocation is at least an $\\Omega(1/\\gamma)$ fraction of the optimal"},"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.18679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-17T04:31:19Z","cross_cats_sorted":["cs.GT","cs.LG","math.OC"],"title_canon_sha256":"73d9596f4d406a46d98588067ffb37f264abefe6a8cf94df28edf95fe5152ab7","abstract_canon_sha256":"37bc09603c958073c8ee9dc6666cbc30599b0b115428fd2a3ae092b7850fc66f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:22.228866Z","signature_b64":"84m6aOM/ldryiiYwasU4YQzL0z5B/qyg/qU3HneKXkVak5cgvPEce38+vaVBVQrPisS714/1ikORyEjpM3hZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f0ad5e240f48c69616f5dceae87db9fb5c2f63ad541d015be2ae87a4ed58db","last_reissued_at":"2026-06-19T16:12:22.228517Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:22.228517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Online Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Andrea Lodi, Christopher En, Gonzalo Mu\\~noz, Yuri Faenza","submitted_at":"2026-06-17T04:31:19Z","abstract_excerpt":"We study the problem of fair online resource allocation, motivated by applications such as refugee resettlement and airline scheduling, where agents arrive sequentially and must be assigned to facilities with limited capacities. We introduce a model that maximizes the overall welfare subject to resource constraints and a Lipschitz fairness requirement, which ensures that similar agents arriving in the same batch receive similar expected outcomes. We first analyze the offline problem, proving that the value of the optimal fair allocation is at least an $\\Omega(1/\\gamma)$ fraction of the optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18679","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/2606.18679/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.18679","created_at":"2026-06-19T16:12:22.228578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18679v2","created_at":"2026-06-19T16:12:22.228578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18679","created_at":"2026-06-19T16:12:22.228578+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7YK2XREB5EM","created_at":"2026-06-19T16:12:22.228578+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7YK2XREB5EMNFQW","created_at":"2026-06-19T16:12:22.228578+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7YK2XRE","created_at":"2026-06-19T16:12:22.228578+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/G7YK2XREB5EMNFQW6XOOV2D5XH","json":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH.json","graph_json":"https://pith.science/api/pith-number/G7YK2XREB5EMNFQW6XOOV2D5XH/graph.json","events_json":"https://pith.science/api/pith-number/G7YK2XREB5EMNFQW6XOOV2D5XH/events.json","paper":"https://pith.science/paper/G7YK2XRE"},"agent_actions":{"view_html":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH","download_json":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH.json","view_paper":"https://pith.science/paper/G7YK2XRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18679&json=true","fetch_graph":"https://pith.science/api/pith-number/G7YK2XREB5EMNFQW6XOOV2D5XH/graph.json","fetch_events":"https://pith.science/api/pith-number/G7YK2XREB5EMNFQW6XOOV2D5XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH/action/storage_attestation","attest_author":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH/action/author_attestation","sign_citation":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH/action/citation_signature","submit_replication":"https://pith.science/pith/G7YK2XREB5EMNFQW6XOOV2D5XH/action/replication_record"}},"created_at":"2026-06-19T16:12:22.228578+00:00","updated_at":"2026-06-19T16:12:22.228578+00:00"}