{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JYOWPJZSVKQF3VKVZZC7ETPUJU","short_pith_number":"pith:JYOWPJZS","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"},"canonical_sha256":"4e1d67a732aaa05dd555ce45f24df44d003309a319088c63e7074041b62c6b75","source":{"kind":"arxiv","id":"1312.0137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0137","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0137v1","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0137","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"JYOWPJZSVKQF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JYOWPJZSVKQF3VKV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JYOWPJZS","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JYOWPJZSVKQF3VKVZZC7ETPUJU","target":"record","payload":{"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"},"canonical_sha256":"4e1d67a732aaa05dd555ce45f24df44d003309a319088c63e7074041b62c6b75","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"},"source_kind":"arxiv","source_id":"1312.0137","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFQAfGcHI4H6NeOdyb03nGTjpFfHpA2ii0ng1HwKAhouP6jjm2Zfqv5fw9W7dGbQnbifuyJJ9TLPtlvmNIv1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:45:10.263890Z"},"content_sha256":"cba527187c520db9ba5d518d9cf28dfa2e6b98c8b60bb7ff6c28601e00778a86","schema_version":"1.0","event_id":"sha256:cba527187c520db9ba5d518d9cf28dfa2e6b98c8b60bb7ff6c28601e00778a86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JYOWPJZSVKQF3VKVZZC7ETPUJU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGZTWOgWG2Tiyh4p1CfPAoM7P3DmhtDMpd6lB/S+Sv8O6J1VtekxL6K6OedtCDjE3EtYA/oi5W/7vDrJfxGlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:45:10.264243Z"},"content_sha256":"ec5227faf9eab8c9f5d614b007eece1d5dbd1ae0f1aaec8121f4d378a1a8738f","schema_version":"1.0","event_id":"sha256:ec5227faf9eab8c9f5d614b007eece1d5dbd1ae0f1aaec8121f4d378a1a8738f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/bundle.json","state_url":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T00:45:10Z","links":{"resolver":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU","bundle":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/bundle.json","state":"https://pith.science/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYOWPJZSVKQF3VKVZZC7ETPUJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JYOWPJZSVKQF3VKVZZC7ETPUJU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"598b2caddf2adb3a6512d5732562aadefe891ae4e68977b531b169621bede8f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-30T18:41:54Z","title_canon_sha256":"32de2f6dbde53f5fea7a9045e93457d225b87c5d730085df49cc7cf0ba0221c1"},"schema_version":"1.0","source":{"id":"1312.0137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0137","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0137v1","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0137","created_at":"2026-05-18T03:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"JYOWPJZSVKQF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JYOWPJZSVKQF3VKV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JYOWPJZS","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:ec5227faf9eab8c9f5d614b007eece1d5dbd1ae0f1aaec8121f4d378a1a8738f","target":"graph","created_at":"2026-05-18T03:05:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Chaitanya Swamy, Khaled Elbassioni, Mahmoud Fouz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-30T18:41:54Z","title":"Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0137","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cba527187c520db9ba5d518d9cf28dfa2e6b98c8b60bb7ff6c28601e00778a86","target":"record","created_at":"2026-05-18T03:05:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"598b2caddf2adb3a6512d5732562aadefe891ae4e68977b531b169621bede8f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-30T18:41:54Z","title_canon_sha256":"32de2f6dbde53f5fea7a9045e93457d225b87c5d730085df49cc7cf0ba0221c1"},"schema_version":"1.0","source":{"id":"1312.0137","kind":"arxiv","version":1}},"canonical_sha256":"4e1d67a732aaa05dd555ce45f24df44d003309a319088c63e7074041b62c6b75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e1d67a732aaa05dd555ce45f24df44d003309a319088c63e7074041b62c6b75","first_computed_at":"2026-05-18T03:05:46.663815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:46.663815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B2Z7yxIEOdEt/boSeyKsMVAkKkoGjAW2/oeZQQ/fEZOf0CT080bbr1/GpmST9pY4d4MmOxxWRAmXFGppBfHZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:46.664473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cba527187c520db9ba5d518d9cf28dfa2e6b98c8b60bb7ff6c28601e00778a86","sha256:ec5227faf9eab8c9f5d614b007eece1d5dbd1ae0f1aaec8121f4d378a1a8738f"],"state_sha256":"6357499674ea2be0c4bacf85908e4e279b0056038810d511d2ff36c1cfc6437e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X83xJWEjMbTKMTprSxLYRp6MJD0O08+95kF4t9UjCzoBPXlgbJ9Lo4GEbkGYuGYvYvbH5Kmiwoslrg3mvAKoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T00:45:10.266301Z","bundle_sha256":"4d925c2647b51b04368c596622d1b7cd217f46d16c629ebe0d97a457f334f14b"}}