{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XXFTJVMCI6A2BQ7VBB7F56IXLU","short_pith_number":"pith:XXFTJVMC","schema_version":"1.0","canonical_sha256":"bdcb34d5824781a0c3f5087e5ef9175d17d1478448646cc851bd07c1e6b685f7","source":{"kind":"arxiv","id":"2505.13824","version":2},"attestation_state":"computed","paper":{"title":"Online Resource Sharing: Better Robust Guarantees via Randomized Strategies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Daniel Hall, David X. Lin, \\'Eva Tardos, Giannis Fikioris, Siddhartha Banerjee","submitted_at":"2025-05-20T02:11:30Z","abstract_excerpt":"We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal utility (the highest achievable utility given their fair share of resources) robustly, i.e., under arbitrary behavior by the other agents. While this $1/2$-robustness guarantee has now been established under very different mechanisms, including pseudo-markets and dynamic max-min allocation, improving on it has appeared difficult.\n  In this work, we obtain the"},"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":"2505.13824","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-05-20T02:11:30Z","cross_cats_sorted":[],"title_canon_sha256":"06e0699cf950dca92d302b8594284b458790b0d6c2b69ee47b948e0736690d35","abstract_canon_sha256":"fa0977adde1030a89d57ec127c49b429d3a5ea1ea6c34ce95e25308b73ceb635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:14.142225Z","signature_b64":"UmWGaAwxPFLwFvl6mFz03+NZF0oUdeVr714/bOwviKEtdU0YCubXZkq4s+ABP+cRxRwr/62ikHxjCXCdIqlTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdcb34d5824781a0c3f5087e5ef9175d17d1478448646cc851bd07c1e6b685f7","last_reissued_at":"2026-07-05T11:09:14.141791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:14.141791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Resource Sharing: Better Robust Guarantees via Randomized Strategies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Daniel Hall, David X. Lin, \\'Eva Tardos, Giannis Fikioris, Siddhartha Banerjee","submitted_at":"2025-05-20T02:11:30Z","abstract_excerpt":"We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee $1/2$ of their ideal utility (the highest achievable utility given their fair share of resources) robustly, i.e., under arbitrary behavior by the other agents. While this $1/2$-robustness guarantee has now been established under very different mechanisms, including pseudo-markets and dynamic max-min allocation, improving on it has appeared difficult.\n  In this work, we obtain the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13824","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/2505.13824/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":"2505.13824","created_at":"2026-07-05T11:09:14.141846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13824v2","created_at":"2026-07-05T11:09:14.141846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13824","created_at":"2026-07-05T11:09:14.141846+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXFTJVMCI6A2","created_at":"2026-07-05T11:09:14.141846+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXFTJVMCI6A2BQ7V","created_at":"2026-07-05T11:09:14.141846+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXFTJVMC","created_at":"2026-07-05T11:09:14.141846+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/XXFTJVMCI6A2BQ7VBB7F56IXLU","json":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU.json","graph_json":"https://pith.science/api/pith-number/XXFTJVMCI6A2BQ7VBB7F56IXLU/graph.json","events_json":"https://pith.science/api/pith-number/XXFTJVMCI6A2BQ7VBB7F56IXLU/events.json","paper":"https://pith.science/paper/XXFTJVMC"},"agent_actions":{"view_html":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU","download_json":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU.json","view_paper":"https://pith.science/paper/XXFTJVMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13824&json=true","fetch_graph":"https://pith.science/api/pith-number/XXFTJVMCI6A2BQ7VBB7F56IXLU/graph.json","fetch_events":"https://pith.science/api/pith-number/XXFTJVMCI6A2BQ7VBB7F56IXLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU/action/storage_attestation","attest_author":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU/action/author_attestation","sign_citation":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU/action/citation_signature","submit_replication":"https://pith.science/pith/XXFTJVMCI6A2BQ7VBB7F56IXLU/action/replication_record"}},"created_at":"2026-07-05T11:09:14.141846+00:00","updated_at":"2026-07-05T11:09:14.141846+00:00"}