{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VJJMETZ3CYIQYQLJRISBMOA6LZ","short_pith_number":"pith:VJJMETZ3","schema_version":"1.0","canonical_sha256":"aa52c24f3b16110c41698a2416381e5e66bd26f3a0865d81aa5794c5cfafc80f","source":{"kind":"arxiv","id":"1611.07605","version":1},"attestation_state":"computed","paper":{"title":"Optimal Pricing for Submodular Valuations with Bounded Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi, Takanori Maehara, Yasushi Kawase","submitted_at":"2016-11-23T02:18:10Z","abstract_excerpt":"The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want to purchase a combination of the items. The seller wants to sell his items for the highest possible prices, and each buyer wants to maximize his utility (i.e., valuation minus payment) as long as his payment does not exceed his budget. The optimal pricing problem seeks a price of each item and an assignment of items to buyers such that every buyer achieves the maximum utility under the prices. The goal of the problem"},"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":"1611.07605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-23T02:18:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"25ed4808802bdb3d4b52df7b1327d88384a2b34cf129c9ace48ae1f1ebf7f13e","abstract_canon_sha256":"f26c757ba72394f1abbcb08fdb635f601fda4cf3a41fa150de5460f8cb0abef3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:00.346387Z","signature_b64":"8/1mAWpMggzbfsxElp3pMvnD6MDs4q95Fl08xYGeJzP3x/ffRN30USWqTWkI3Q4ZEbRGhLT63+A4UuMJJVC0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa52c24f3b16110c41698a2416381e5e66bd26f3a0865d81aa5794c5cfafc80f","last_reissued_at":"2026-05-18T00:57:00.345832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:00.345832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Pricing for Submodular Valuations with Bounded Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi, Takanori Maehara, Yasushi Kawase","submitted_at":"2016-11-23T02:18:10Z","abstract_excerpt":"The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want to purchase a combination of the items. The seller wants to sell his items for the highest possible prices, and each buyer wants to maximize his utility (i.e., valuation minus payment) as long as his payment does not exceed his budget. The optimal pricing problem seeks a price of each item and an assignment of items to buyers such that every buyer achieves the maximum utility under the prices. The goal of the problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07605","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":"1611.07605","created_at":"2026-05-18T00:57:00.345924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07605v1","created_at":"2026-05-18T00:57:00.345924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07605","created_at":"2026-05-18T00:57:00.345924+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJJMETZ3CYIQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJJMETZ3CYIQYQLJ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJJMETZ3","created_at":"2026-05-18T12:30:48.956258+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/VJJMETZ3CYIQYQLJRISBMOA6LZ","json":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ.json","graph_json":"https://pith.science/api/pith-number/VJJMETZ3CYIQYQLJRISBMOA6LZ/graph.json","events_json":"https://pith.science/api/pith-number/VJJMETZ3CYIQYQLJRISBMOA6LZ/events.json","paper":"https://pith.science/paper/VJJMETZ3"},"agent_actions":{"view_html":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ","download_json":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ.json","view_paper":"https://pith.science/paper/VJJMETZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07605&json=true","fetch_graph":"https://pith.science/api/pith-number/VJJMETZ3CYIQYQLJRISBMOA6LZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VJJMETZ3CYIQYQLJRISBMOA6LZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ/action/storage_attestation","attest_author":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ/action/author_attestation","sign_citation":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ/action/citation_signature","submit_replication":"https://pith.science/pith/VJJMETZ3CYIQYQLJRISBMOA6LZ/action/replication_record"}},"created_at":"2026-05-18T00:57:00.345924+00:00","updated_at":"2026-05-18T00:57:00.345924+00:00"}