{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HEMHWAS3VSRDKQWTRPQQARUURB","short_pith_number":"pith:HEMHWAS3","schema_version":"1.0","canonical_sha256":"39187b025baca23542d38be1004694887888bb98b09f3445309d3026a7e87a88","source":{"kind":"arxiv","id":"1309.7955","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for the Max-Buying Problem with Limited Supply","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Cristina G. Fernandes, Rafael C. S. Schouery","submitted_at":"2013-09-30T18:45:23Z","abstract_excerpt":"We consider the Max-Buying Problem with Limited Supply, in which there are $n$ items, with $C_i$ copies of each item $i$, and $m$ bidders such that every bidder $b$ has valuation $v_{ib}$ for item $i$. The goal is to find a pricing $p$ and an allocation of items to bidders that maximizes the profit, where every item is allocated to at most $C_i$ bidders, every bidder receives at most one item and if a bidder $b$ receives item $i$ then $p_i \\leq v_{ib}$. Briest and Krysta presented a 2-approximation for this problem and Aggarwal et al. presented a 4-approximation for the Price Ladder variant wh"},"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":"1309.7955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-09-30T18:45:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9bddde1fd43a40861479edd45d4aeca83a440b2e1d8d83116376ba21c6885646","abstract_canon_sha256":"6de3ee3b4864b57beb9bd2e9d27fc317af69c1b4f7483df239e88fc65af15061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:47.731400Z","signature_b64":"P+krqtSJxdpFIcpcr59GmZlogtJj6vrKYF9dBqpsR5QDNpqLr9oLMK340pylG9EN30vHX1Nw84fjfGpsx8SXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39187b025baca23542d38be1004694887888bb98b09f3445309d3026a7e87a88","last_reissued_at":"2026-05-18T03:11:47.730688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:47.730688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for the Max-Buying Problem with Limited Supply","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Cristina G. Fernandes, Rafael C. S. Schouery","submitted_at":"2013-09-30T18:45:23Z","abstract_excerpt":"We consider the Max-Buying Problem with Limited Supply, in which there are $n$ items, with $C_i$ copies of each item $i$, and $m$ bidders such that every bidder $b$ has valuation $v_{ib}$ for item $i$. The goal is to find a pricing $p$ and an allocation of items to bidders that maximizes the profit, where every item is allocated to at most $C_i$ bidders, every bidder receives at most one item and if a bidder $b$ receives item $i$ then $p_i \\leq v_{ib}$. Briest and Krysta presented a 2-approximation for this problem and Aggarwal et al. presented a 4-approximation for the Price Ladder variant wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7955","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":"1309.7955","created_at":"2026-05-18T03:11:47.730797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7955v1","created_at":"2026-05-18T03:11:47.730797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7955","created_at":"2026-05-18T03:11:47.730797+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEMHWAS3VSRD","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEMHWAS3VSRDKQWT","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEMHWAS3","created_at":"2026-05-18T12:27:46.883200+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/HEMHWAS3VSRDKQWTRPQQARUURB","json":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB.json","graph_json":"https://pith.science/api/pith-number/HEMHWAS3VSRDKQWTRPQQARUURB/graph.json","events_json":"https://pith.science/api/pith-number/HEMHWAS3VSRDKQWTRPQQARUURB/events.json","paper":"https://pith.science/paper/HEMHWAS3"},"agent_actions":{"view_html":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB","download_json":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB.json","view_paper":"https://pith.science/paper/HEMHWAS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7955&json=true","fetch_graph":"https://pith.science/api/pith-number/HEMHWAS3VSRDKQWTRPQQARUURB/graph.json","fetch_events":"https://pith.science/api/pith-number/HEMHWAS3VSRDKQWTRPQQARUURB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB/action/storage_attestation","attest_author":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB/action/author_attestation","sign_citation":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB/action/citation_signature","submit_replication":"https://pith.science/pith/HEMHWAS3VSRDKQWTRPQQARUURB/action/replication_record"}},"created_at":"2026-05-18T03:11:47.730797+00:00","updated_at":"2026-05-18T03:11:47.730797+00:00"}