{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTXBCYPLJXVSPUT2NF3AKZP3EW","short_pith_number":"pith:MTXBCYPL","schema_version":"1.0","canonical_sha256":"64ee1161eb4deb27d27a69760565fb258a43de42fc48836bb920049773eba80e","source":{"kind":"arxiv","id":"1804.08172","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Profit with Convex Costs in the Random-order Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Marco Molinaro, Ruta Mehta","submitted_at":"2018-04-22T21:07:54Z","abstract_excerpt":"Suppose a set of requests arrives online: each request gives some value $v_i$ if accepted, but requires using some amount of each of $d$ resources. Our cost is a convex function of the vector of total utilization of these $d$ resources. Which requests should be accept to maximize our profit, i.e., the sum of values of the accepted demands, minus the convex cost?\n  We consider this problem in the random-order a.k.a. secretary model, and show an $O(d)$-competitive algorithm for the case where the convex cost function is also supermodular. If the set of accepted demands must also be independent i"},"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":"1804.08172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-22T21:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"8fa49614ebddb2d2d1044765dd0836e80cca2d0c7743e6c5fd547eacdabf0b0d","abstract_canon_sha256":"9ba161158e953d80a771ff14dd824c5b3a580e748d9bd0824351fa68e7777fae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:49.313177Z","signature_b64":"sEWOrehf0M5M8JKrsH4BTwsvOL6j5orRwYUijPp7XxekqawmK/bKDM2vwAzUlkTnzWaZCqtnC8B5imG96FjGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ee1161eb4deb27d27a69760565fb258a43de42fc48836bb920049773eba80e","last_reissued_at":"2026-05-18T00:17:49.312557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:49.312557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Profit with Convex Costs in the Random-order Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Marco Molinaro, Ruta Mehta","submitted_at":"2018-04-22T21:07:54Z","abstract_excerpt":"Suppose a set of requests arrives online: each request gives some value $v_i$ if accepted, but requires using some amount of each of $d$ resources. Our cost is a convex function of the vector of total utilization of these $d$ resources. Which requests should be accept to maximize our profit, i.e., the sum of values of the accepted demands, minus the convex cost?\n  We consider this problem in the random-order a.k.a. secretary model, and show an $O(d)$-competitive algorithm for the case where the convex cost function is also supermodular. If the set of accepted demands must also be independent i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08172","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":""},"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":"1804.08172","created_at":"2026-05-18T00:17:49.312652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08172v1","created_at":"2026-05-18T00:17:49.312652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08172","created_at":"2026-05-18T00:17:49.312652+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTXBCYPLJXVS","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTXBCYPLJXVSPUT2","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTXBCYPL","created_at":"2026-05-18T12:32:40.477152+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/MTXBCYPLJXVSPUT2NF3AKZP3EW","json":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW.json","graph_json":"https://pith.science/api/pith-number/MTXBCYPLJXVSPUT2NF3AKZP3EW/graph.json","events_json":"https://pith.science/api/pith-number/MTXBCYPLJXVSPUT2NF3AKZP3EW/events.json","paper":"https://pith.science/paper/MTXBCYPL"},"agent_actions":{"view_html":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW","download_json":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW.json","view_paper":"https://pith.science/paper/MTXBCYPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08172&json=true","fetch_graph":"https://pith.science/api/pith-number/MTXBCYPLJXVSPUT2NF3AKZP3EW/graph.json","fetch_events":"https://pith.science/api/pith-number/MTXBCYPLJXVSPUT2NF3AKZP3EW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW/action/storage_attestation","attest_author":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW/action/author_attestation","sign_citation":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW/action/citation_signature","submit_replication":"https://pith.science/pith/MTXBCYPLJXVSPUT2NF3AKZP3EW/action/replication_record"}},"created_at":"2026-05-18T00:17:49.312652+00:00","updated_at":"2026-05-18T00:17:49.312652+00:00"}