{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FGXWMQZTFPWJY4AT7PX4NGAS4H","short_pith_number":"pith:FGXWMQZT","schema_version":"1.0","canonical_sha256":"29af6643332bec9c7013fbefc69812e1f4c7ac147cc972cb5bc95d0cef493d07","source":{"kind":"arxiv","id":"1704.03547","version":1},"attestation_state":"computed","paper":{"title":"On Simultaneous Two-player Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jieming Mao, Mark Braverman, S. Matthew Weinberg","submitted_at":"2017-04-11T21:44:15Z","abstract_excerpt":"We consider the following communication problem: Alice and Bob each have some valuation functions $v_1(\\cdot)$ and $v_2(\\cdot)$ over subsets of $m$ items, and their goal is to partition the items into $S, \\bar{S}$ in a way that maximizes the welfare, $v_1(S) + v_2(\\bar{S})$. We study both the allocation problem, which asks for a welfare-maximizing partition and the decision problem, which asks whether or not there exists a partition guaranteeing certain welfare, for binary XOS valuations. For interactive protocols with $poly(m)$ communication, a tight 3/4-approximation is known for both [Fei06"},"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":"1704.03547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-11T21:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"15f0099f1ee1aef1e26f9ac2649f73081d8ec5758c9684e0e09a4edf74cf8ffe","abstract_canon_sha256":"c91baf89d6a261f5f93a536bf8017537a42c7c89550a86734229b817b6d3f142"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:27.495916Z","signature_b64":"hOcwP/VfESxA7NaXd16DooIdGlWk4Bm6Bcf4ln2vY8KpVSxurfn83S9LjliJUBd2LjSbQsHCiaWIpfvDMScpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29af6643332bec9c7013fbefc69812e1f4c7ac147cc972cb5bc95d0cef493d07","last_reissued_at":"2026-05-18T00:46:27.495239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:27.495239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Simultaneous Two-player Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jieming Mao, Mark Braverman, S. Matthew Weinberg","submitted_at":"2017-04-11T21:44:15Z","abstract_excerpt":"We consider the following communication problem: Alice and Bob each have some valuation functions $v_1(\\cdot)$ and $v_2(\\cdot)$ over subsets of $m$ items, and their goal is to partition the items into $S, \\bar{S}$ in a way that maximizes the welfare, $v_1(S) + v_2(\\bar{S})$. We study both the allocation problem, which asks for a welfare-maximizing partition and the decision problem, which asks whether or not there exists a partition guaranteeing certain welfare, for binary XOS valuations. For interactive protocols with $poly(m)$ communication, a tight 3/4-approximation is known for both [Fei06"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03547","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":"1704.03547","created_at":"2026-05-18T00:46:27.495365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03547v1","created_at":"2026-05-18T00:46:27.495365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03547","created_at":"2026-05-18T00:46:27.495365+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGXWMQZTFPWJ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGXWMQZTFPWJY4AT","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGXWMQZT","created_at":"2026-05-18T12:31:15.632608+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/FGXWMQZTFPWJY4AT7PX4NGAS4H","json":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H.json","graph_json":"https://pith.science/api/pith-number/FGXWMQZTFPWJY4AT7PX4NGAS4H/graph.json","events_json":"https://pith.science/api/pith-number/FGXWMQZTFPWJY4AT7PX4NGAS4H/events.json","paper":"https://pith.science/paper/FGXWMQZT"},"agent_actions":{"view_html":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H","download_json":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H.json","view_paper":"https://pith.science/paper/FGXWMQZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03547&json=true","fetch_graph":"https://pith.science/api/pith-number/FGXWMQZTFPWJY4AT7PX4NGAS4H/graph.json","fetch_events":"https://pith.science/api/pith-number/FGXWMQZTFPWJY4AT7PX4NGAS4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/action/storage_attestation","attest_author":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/action/author_attestation","sign_citation":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/action/citation_signature","submit_replication":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/action/replication_record"}},"created_at":"2026-05-18T00:46:27.495365+00:00","updated_at":"2026-05-18T00:46:27.495365+00:00"}