{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YVO27UUHLBOD2WJWVM7QSBAGOD","short_pith_number":"pith:YVO27UUH","schema_version":"1.0","canonical_sha256":"c55dafd287585c3d5936ab3f09040670c6528a142b7d150313b7fe79473bc39f","source":{"kind":"arxiv","id":"2105.11992","version":5},"attestation_state":"computed","paper":{"title":"A Simple Optimal Contention Resolution Scheme for Uniform Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danish Kashaev, Richard Santiago","submitted_at":"2021-05-25T14:55:37Z","abstract_excerpt":"Contention resolution schemes (or CR schemes), introduced by Chekuri, Vondrak and Zenklusen, are a class of randomized rounding algorithms for converting a fractional solution to a relaxation for a down-closed constraint family into an integer solution. A CR scheme takes a fractional point $x$ in a relaxation polytope, rounds each coordinate $x_i$ independently to get a possibly non-feasible set, and then drops some elements in order to satisfy the constraints. Intuitively, a contention resolution scheme is $c$-balanced if every element $i$ is selected with probability at least $c \\cdot x_i$.\n"},"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":"2105.11992","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-25T14:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"635930a4a6748b602539a8f6f03e20745c3d9208c0cb23bb8af4d94a9a652d73","abstract_canon_sha256":"6378d4926a07014f7262189f23d202d1fbb98f640104f542d5b43a8eef409057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:44.498588Z","signature_b64":"RUQHUzN98cit+9gviHvJizrWaUgdG+7s+TJAZOqqz+2qO9j2z+M4lKFytPBCeinArRd7kcyx0JS4e0HVvxlJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c55dafd287585c3d5936ab3f09040670c6528a142b7d150313b7fe79473bc39f","last_reissued_at":"2026-07-05T05:36:44.498171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:44.498171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Optimal Contention Resolution Scheme for Uniform Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danish Kashaev, Richard Santiago","submitted_at":"2021-05-25T14:55:37Z","abstract_excerpt":"Contention resolution schemes (or CR schemes), introduced by Chekuri, Vondrak and Zenklusen, are a class of randomized rounding algorithms for converting a fractional solution to a relaxation for a down-closed constraint family into an integer solution. A CR scheme takes a fractional point $x$ in a relaxation polytope, rounds each coordinate $x_i$ independently to get a possibly non-feasible set, and then drops some elements in order to satisfy the constraints. Intuitively, a contention resolution scheme is $c$-balanced if every element $i$ is selected with probability at least $c \\cdot x_i$.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11992","kind":"arxiv","version":5},"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/2105.11992/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":"2105.11992","created_at":"2026-07-05T05:36:44.498228+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.11992v5","created_at":"2026-07-05T05:36:44.498228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11992","created_at":"2026-07-05T05:36:44.498228+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVO27UUHLBOD","created_at":"2026-07-05T05:36:44.498228+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVO27UUHLBOD2WJW","created_at":"2026-07-05T05:36:44.498228+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVO27UUH","created_at":"2026-07-05T05:36:44.498228+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/YVO27UUHLBOD2WJWVM7QSBAGOD","json":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD.json","graph_json":"https://pith.science/api/pith-number/YVO27UUHLBOD2WJWVM7QSBAGOD/graph.json","events_json":"https://pith.science/api/pith-number/YVO27UUHLBOD2WJWVM7QSBAGOD/events.json","paper":"https://pith.science/paper/YVO27UUH"},"agent_actions":{"view_html":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD","download_json":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD.json","view_paper":"https://pith.science/paper/YVO27UUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.11992&json=true","fetch_graph":"https://pith.science/api/pith-number/YVO27UUHLBOD2WJWVM7QSBAGOD/graph.json","fetch_events":"https://pith.science/api/pith-number/YVO27UUHLBOD2WJWVM7QSBAGOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD/action/storage_attestation","attest_author":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD/action/author_attestation","sign_citation":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD/action/citation_signature","submit_replication":"https://pith.science/pith/YVO27UUHLBOD2WJWVM7QSBAGOD/action/replication_record"}},"created_at":"2026-07-05T05:36:44.498228+00:00","updated_at":"2026-07-05T05:36:44.498228+00:00"}