{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:55OYLQTJQBHS6N34RM7NUXSYPC","short_pith_number":"pith:55OYLQTJ","schema_version":"1.0","canonical_sha256":"ef5d85c269804f2f377c8b3eda5e58788f6cabb4922f73c954860525c77b6226","source":{"kind":"arxiv","id":"2403.05378","version":2},"attestation_state":"computed","paper":{"title":"Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Calum MacRury, Jingwei Zhang, Will Ma","submitted_at":"2024-03-08T15:11:22Z","abstract_excerpt":"In the Network Revenue Management (NRM) problem, products composed of up to L resources are sold to stochastically arriving customers. We take a randomized rounding approach to NRM, motivated by the modern tool of Online Contention Resolution Schemes (OCRS). The goal is to take a fractional solution to NRM that satisfies the resource constraints in expectation, and implement it in an online policy that satisfies the resource constraints with probability 1, while (approximately) preserving all of the sales that were prescribed by the fractional solution.\n  In NRM problems, customer substitution"},"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":"2403.05378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-03-08T15:11:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c64ac046971c65acb28d4f25afc6167a4cef9a16922cf11538e6a645ae480ddc","abstract_canon_sha256":"1e78f42c6d92d519b01c8b8829ed48eae0faf34bf49d6adb759675c93b8a2e3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:45.269295Z","signature_b64":"G4a1DLHWRtGEka3a4jnsZeUGhcX/87kyryZKcLC0VlS0df5Sw7xH/jW/mOdCRQfAxnajPXg2yDTiKFiJBpv5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef5d85c269804f2f377c8b3eda5e58788f6cabb4922f73c954860525c77b6226","last_reissued_at":"2026-07-05T09:45:45.268708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:45.268708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Calum MacRury, Jingwei Zhang, Will Ma","submitted_at":"2024-03-08T15:11:22Z","abstract_excerpt":"In the Network Revenue Management (NRM) problem, products composed of up to L resources are sold to stochastically arriving customers. We take a randomized rounding approach to NRM, motivated by the modern tool of Online Contention Resolution Schemes (OCRS). The goal is to take a fractional solution to NRM that satisfies the resource constraints in expectation, and implement it in an online policy that satisfies the resource constraints with probability 1, while (approximately) preserving all of the sales that were prescribed by the fractional solution.\n  In NRM problems, customer substitution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05378","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/2403.05378/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":"2403.05378","created_at":"2026-07-05T09:45:45.268778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05378v2","created_at":"2026-07-05T09:45:45.268778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05378","created_at":"2026-07-05T09:45:45.268778+00:00"},{"alias_kind":"pith_short_12","alias_value":"55OYLQTJQBHS","created_at":"2026-07-05T09:45:45.268778+00:00"},{"alias_kind":"pith_short_16","alias_value":"55OYLQTJQBHS6N34","created_at":"2026-07-05T09:45:45.268778+00:00"},{"alias_kind":"pith_short_8","alias_value":"55OYLQTJ","created_at":"2026-07-05T09:45:45.268778+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19278","citing_title":"Sequential Fair Allocation and Routing in Nonprofit Operations","ref_index":77,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC","json":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC.json","graph_json":"https://pith.science/api/pith-number/55OYLQTJQBHS6N34RM7NUXSYPC/graph.json","events_json":"https://pith.science/api/pith-number/55OYLQTJQBHS6N34RM7NUXSYPC/events.json","paper":"https://pith.science/paper/55OYLQTJ"},"agent_actions":{"view_html":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC","download_json":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC.json","view_paper":"https://pith.science/paper/55OYLQTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05378&json=true","fetch_graph":"https://pith.science/api/pith-number/55OYLQTJQBHS6N34RM7NUXSYPC/graph.json","fetch_events":"https://pith.science/api/pith-number/55OYLQTJQBHS6N34RM7NUXSYPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC/action/storage_attestation","attest_author":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC/action/author_attestation","sign_citation":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC/action/citation_signature","submit_replication":"https://pith.science/pith/55OYLQTJQBHS6N34RM7NUXSYPC/action/replication_record"}},"created_at":"2026-07-05T09:45:45.268778+00:00","updated_at":"2026-07-05T09:45:45.268778+00:00"}