{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ABMSD23M4KNLNVT7LLESBVNULA","short_pith_number":"pith:ABMSD23M","schema_version":"1.0","canonical_sha256":"005921eb6ce29ab6d67f5ac920d5b4583c419ab444ead0463a9828e5bad0c18a","source":{"kind":"arxiv","id":"2209.07035","version":2},"attestation_state":"computed","paper":{"title":"Online Combinatorial Auctions for Resource Allocation with Supply Costs and Capacity Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Leon-Garcia, Danny H.K. Tsang, Xiaoqi Tan, Yuan Wu","submitted_at":"2022-09-15T04:15:39Z","abstract_excerpt":"We study a general online combinatorial auction problem in algorithmic mechanism design. A provider allocates multiple types of capacity-limited resources to customers that arrive in a sequential and arbitrary manner. Each customer has a private valuation function on bundles of resources that she can purchase (e.g., a combination of different resources such as CPU and RAM in cloud computing). The provider charges payment from customers who purchase a bundle of resources and incurs an increasing supply cost with respect to the totality of resources allocated. The goal is to maximize the social "},"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":"2209.07035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-09-15T04:15:39Z","cross_cats_sorted":[],"title_canon_sha256":"7c0c742e1c9d0d0d84c6cd0c63d8167d117a396803fc5f118867de369125ea70","abstract_canon_sha256":"58b3dfd5a7b420174581797a061c5436b68a9b06d3875e316453336a167d76e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:06.072724Z","signature_b64":"ZkoJztBBx0rO3M9jk1WfAmsbptRUtwxBTPvW3hnWdkOPTTcLe/qY/GxKzHSYfVLif0O8EODK3JR+XSUBfBwbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"005921eb6ce29ab6d67f5ac920d5b4583c419ab444ead0463a9828e5bad0c18a","last_reissued_at":"2026-07-05T06:58:06.072244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:06.072244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Combinatorial Auctions for Resource Allocation with Supply Costs and Capacity Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Leon-Garcia, Danny H.K. Tsang, Xiaoqi Tan, Yuan Wu","submitted_at":"2022-09-15T04:15:39Z","abstract_excerpt":"We study a general online combinatorial auction problem in algorithmic mechanism design. A provider allocates multiple types of capacity-limited resources to customers that arrive in a sequential and arbitrary manner. Each customer has a private valuation function on bundles of resources that she can purchase (e.g., a combination of different resources such as CPU and RAM in cloud computing). The provider charges payment from customers who purchase a bundle of resources and incurs an increasing supply cost with respect to the totality of resources allocated. The goal is to maximize the social "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.07035","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/2209.07035/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":"2209.07035","created_at":"2026-07-05T06:58:06.072300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.07035v2","created_at":"2026-07-05T06:58:06.072300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.07035","created_at":"2026-07-05T06:58:06.072300+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABMSD23M4KNL","created_at":"2026-07-05T06:58:06.072300+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABMSD23M4KNLNVT7","created_at":"2026-07-05T06:58:06.072300+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABMSD23M","created_at":"2026-07-05T06:58:06.072300+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/ABMSD23M4KNLNVT7LLESBVNULA","json":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA.json","graph_json":"https://pith.science/api/pith-number/ABMSD23M4KNLNVT7LLESBVNULA/graph.json","events_json":"https://pith.science/api/pith-number/ABMSD23M4KNLNVT7LLESBVNULA/events.json","paper":"https://pith.science/paper/ABMSD23M"},"agent_actions":{"view_html":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA","download_json":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA.json","view_paper":"https://pith.science/paper/ABMSD23M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.07035&json=true","fetch_graph":"https://pith.science/api/pith-number/ABMSD23M4KNLNVT7LLESBVNULA/graph.json","fetch_events":"https://pith.science/api/pith-number/ABMSD23M4KNLNVT7LLESBVNULA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA/action/storage_attestation","attest_author":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA/action/author_attestation","sign_citation":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA/action/citation_signature","submit_replication":"https://pith.science/pith/ABMSD23M4KNLNVT7LLESBVNULA/action/replication_record"}},"created_at":"2026-07-05T06:58:06.072300+00:00","updated_at":"2026-07-05T06:58:06.072300+00:00"}