{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JYOWPJZSVKQF3VKVZZC7ETPUJU","short_pith_number":"pith:JYOWPJZS","schema_version":"1.0","canonical_sha256":"4e1d67a732aaa05dd555ce45f24df44d003309a319088c63e7074041b62c6b75","source":{"kind":"arxiv","id":"1312.0137","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chaitanya Swamy, Khaled Elbassioni, Mahmoud Fouz","submitted_at":"2013-11-30T18:41:54Z","abstract_excerpt":"We consider {\\em profit-maximization} problems for {\\em combinatorial auctions} with {\\em non-single minded valuation functions} and {\\em limited supply}.\n  We obtain fairly general results that relate the approximability of the profit-maximization problem to that of the corresponding {\\em social-welfare-maximization} (SWM) problem, which is the problem of finding an allocation $(S_1,\\ldots,S_n)$ satisfying the capacity constraints that has maximum total value $\\sum_j v_j(S_j)$. For {\\em subadditive valuations} (and hence {\\em submodular, XOS valuations}), we obtain a solution with profit $\\OP"},"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":"1312.0137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-30T18:41:54Z","cross_cats_sorted":[],"title_canon_sha256":"32de2f6dbde53f5fea7a9045e93457d225b87c5d730085df49cc7cf0ba0221c1","abstract_canon_sha256":"598b2caddf2adb3a6512d5732562aadefe891ae4e68977b531b169621bede8f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:46.664473Z","signature_b64":"B2Z7yxIEOdEt/boSeyKsMVAkKkoGjAW2/oeZQQ/fEZOf0CT080bbr1/GpmST9pY4d4MmOxxWRAmXFGppBfHZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e1d67a732aaa05dd555ce45f24df44d003309a319088c63e7074041b62c6b75","last_reissued_at":"2026-05-18T03:05:46.663815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:46.663815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chaitanya Swamy, Khaled Elbassioni, Mahmoud Fouz","submitted_at":"2013-11-30T18:41:54Z","abstract_excerpt":"We consider {\\em profit-maximization} problems for {\\em combinatorial auctions} with {\\em non-single minded valuation functions} and {\\em limited supply}.\n  We obtain fairly general results that relate the approximability of the profit-maximization problem to that of the corresponding {\\em social-welfare-maximization} (SWM) problem, which is the problem of finding an allocation $(S_1,\\ldots,S_n)$ satisfying the capacity constraints that has maximum total value $\\sum_j v_j(S_j)$. For {\\em subadditive valuations} (and hence {\\em submodular, XOS valuations}), we obtain a solution with profit $\\OP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0137","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":"1312.0137","created_at":"2026-05-18T03:05:46.663925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0137v1","created_at":"2026-05-18T03:05:46.663925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0137","created_at":"2026-05-18T03:05:46.663925+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYOWPJZSVKQF","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYOWPJZSVKQF3VKV","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYOWPJZS","created_at":"2026-05-18T12:27:49.015174+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/JYOWPJZSVKQF3VKVZZC7ETPUJU","json":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU.json","graph_json":"https://pith.science/api/pith-number/JYOWPJZSVKQF3VKVZZC7ETPUJU/graph.json","events_json":"https://pith.science/api/pith-number/JYOWPJZSVKQF3VKVZZC7ETPUJU/events.json","paper":"https://pith.science/paper/JYOWPJZS"},"agent_actions":{"view_html":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU","download_json":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU.json","view_paper":"https://pith.science/paper/JYOWPJZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0137&json=true","fetch_graph":"https://pith.science/api/pith-number/JYOWPJZSVKQF3VKVZZC7ETPUJU/graph.json","fetch_events":"https://pith.science/api/pith-number/JYOWPJZSVKQF3VKVZZC7ETPUJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/action/storage_attestation","attest_author":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/action/author_attestation","sign_citation":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/action/citation_signature","submit_replication":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/action/replication_record"}},"created_at":"2026-05-18T03:05:46.663925+00:00","updated_at":"2026-05-18T03:05:46.663925+00:00"}