{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QZN6FFDJ2E7GD4TZW5MRH3GCZ2","short_pith_number":"pith:QZN6FFDJ","schema_version":"1.0","canonical_sha256":"865be29469d13e61f279b75913ecc2ceb15599776b5702ba2308ab6e6a15fd14","source":{"kind":"arxiv","id":"2502.09521","version":1},"attestation_state":"computed","paper":{"title":"Forward-backward Contention Resolution Schemes for Fair Rationing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Calum MacRury, Cliff Stein, Will Ma","submitted_at":"2025-02-13T17:36:12Z","abstract_excerpt":"We use contention resolution schemes (CRS) to derive algorithms for the fair rationing of a single resource when agents have stochastic demands. We aim to provide ex-ante guarantees on the level of service provided to each agent, who may measure service in different ways (Type-I, II, or III), calling for CRS under different feasibility constraints (rank-1 matroid or knapsack). We are particularly interested in two-order CRS where the agents are equally likely to arrive in a known forward order or its reverse, which is motivated by online rationing at food banks.\n  In particular, we derive a tw"},"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":"2502.09521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-13T17:36:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b3ad4d217c7be051de5283796509e560c5d35e0b778391440a0f7d76c86be8a8","abstract_canon_sha256":"274d6cf58fcac835f7717fa9d7783ea0b4831774f8b5ae376dcb5b74545cd493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:58.846917Z","signature_b64":"NMirDGomiZUk0+KzLe8kBZZPtOcb7ZYSA7Y/vl5y7+ZYh5yhrtbiav0HNAwzpAnY4r4eluyjFFKHbv6J1+qNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865be29469d13e61f279b75913ecc2ceb15599776b5702ba2308ab6e6a15fd14","last_reissued_at":"2026-07-05T10:13:58.846446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:58.846446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forward-backward Contention Resolution Schemes for Fair Rationing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Calum MacRury, Cliff Stein, Will Ma","submitted_at":"2025-02-13T17:36:12Z","abstract_excerpt":"We use contention resolution schemes (CRS) to derive algorithms for the fair rationing of a single resource when agents have stochastic demands. We aim to provide ex-ante guarantees on the level of service provided to each agent, who may measure service in different ways (Type-I, II, or III), calling for CRS under different feasibility constraints (rank-1 matroid or knapsack). We are particularly interested in two-order CRS where the agents are equally likely to arrive in a known forward order or its reverse, which is motivated by online rationing at food banks.\n  In particular, we derive a tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09521","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/2502.09521/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":"2502.09521","created_at":"2026-07-05T10:13:58.846506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09521v1","created_at":"2026-07-05T10:13:58.846506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09521","created_at":"2026-07-05T10:13:58.846506+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZN6FFDJ2E7G","created_at":"2026-07-05T10:13:58.846506+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZN6FFDJ2E7GD4TZ","created_at":"2026-07-05T10:13:58.846506+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZN6FFDJ","created_at":"2026-07-05T10:13:58.846506+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/QZN6FFDJ2E7GD4TZW5MRH3GCZ2","json":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2.json","graph_json":"https://pith.science/api/pith-number/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/graph.json","events_json":"https://pith.science/api/pith-number/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/events.json","paper":"https://pith.science/paper/QZN6FFDJ"},"agent_actions":{"view_html":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2","download_json":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2.json","view_paper":"https://pith.science/paper/QZN6FFDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09521&json=true","fetch_graph":"https://pith.science/api/pith-number/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/action/storage_attestation","attest_author":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/action/author_attestation","sign_citation":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/action/citation_signature","submit_replication":"https://pith.science/pith/QZN6FFDJ2E7GD4TZW5MRH3GCZ2/action/replication_record"}},"created_at":"2026-07-05T10:13:58.846506+00:00","updated_at":"2026-07-05T10:13:58.846506+00:00"}