{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FGXWMQZTFPWJY4AT7PX4NGAS4H","short_pith_number":"pith:FGXWMQZT","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"},"canonical_sha256":"29af6643332bec9c7013fbefc69812e1f4c7ac147cc972cb5bc95d0cef493d07","source":{"kind":"arxiv","id":"1704.03547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03547","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03547v1","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03547","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"pith_short_12","alias_value":"FGXWMQZTFPWJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGXWMQZTFPWJY4AT","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGXWMQZT","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FGXWMQZTFPWJY4AT7PX4NGAS4H","target":"record","payload":{"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"},"canonical_sha256":"29af6643332bec9c7013fbefc69812e1f4c7ac147cc972cb5bc95d0cef493d07","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"},"source_kind":"arxiv","source_id":"1704.03547","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-18T00:46:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unUKB8yyHGj27H6CxFJ2bnzljut2Jl3cxJC6e/k9dofE58JSyva/mN6kPgEqxsYXnkJD7DzddJkiB2SM65nMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:42:06.052155Z"},"content_sha256":"92c393446b79cf5c7fd5dd57ecab2c4ffe8e986b7f9b76095136ef718d6f4fb1","schema_version":"1.0","event_id":"sha256:92c393446b79cf5c7fd5dd57ecab2c4ffe8e986b7f9b76095136ef718d6f4fb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FGXWMQZTFPWJY4AT7PX4NGAS4H","target":"graph","payload":{"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"},"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-18T00:46:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtsktHSIlppi5knfbuaGJUtgIgXhL41fDZTtlJHum3ASEXT1rGot+M+2VXHPdNd4GJALrYvP+tIpapZzhAq6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:42:06.052862Z"},"content_sha256":"47cbfdd94d1843dea49d2137d4a912a4c6e29e74cae0b861f25ae77ea2df2bb9","schema_version":"1.0","event_id":"sha256:47cbfdd94d1843dea49d2137d4a912a4c6e29e74cae0b861f25ae77ea2df2bb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/bundle.json","state_url":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/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-11T22:42:06Z","links":{"resolver":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H","bundle":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/bundle.json","state":"https://pith.science/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGXWMQZTFPWJY4AT7PX4NGAS4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FGXWMQZTFPWJY4AT7PX4NGAS4H","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":"c91baf89d6a261f5f93a536bf8017537a42c7c89550a86734229b817b6d3f142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-11T21:44:15Z","title_canon_sha256":"15f0099f1ee1aef1e26f9ac2649f73081d8ec5758c9684e0e09a4edf74cf8ffe"},"schema_version":"1.0","source":{"id":"1704.03547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03547","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03547v1","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03547","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"pith_short_12","alias_value":"FGXWMQZTFPWJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGXWMQZTFPWJY4AT","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGXWMQZT","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:47cbfdd94d1843dea49d2137d4a912a4c6e29e74cae0b861f25ae77ea2df2bb9","target":"graph","created_at":"2026-05-18T00:46:27Z","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 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","authors_text":"Jieming Mao, Mark Braverman, S. Matthew Weinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-11T21:44:15Z","title":"On Simultaneous Two-player Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03547","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:92c393446b79cf5c7fd5dd57ecab2c4ffe8e986b7f9b76095136ef718d6f4fb1","target":"record","created_at":"2026-05-18T00:46:27Z","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":"c91baf89d6a261f5f93a536bf8017537a42c7c89550a86734229b817b6d3f142","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-11T21:44:15Z","title_canon_sha256":"15f0099f1ee1aef1e26f9ac2649f73081d8ec5758c9684e0e09a4edf74cf8ffe"},"schema_version":"1.0","source":{"id":"1704.03547","kind":"arxiv","version":1}},"canonical_sha256":"29af6643332bec9c7013fbefc69812e1f4c7ac147cc972cb5bc95d0cef493d07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29af6643332bec9c7013fbefc69812e1f4c7ac147cc972cb5bc95d0cef493d07","first_computed_at":"2026-05-18T00:46:27.495239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:27.495239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hOcwP/VfESxA7NaXd16DooIdGlWk4Bm6Bcf4ln2vY8KpVSxurfn83S9LjliJUBd2LjSbQsHCiaWIpfvDMScpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:27.495916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c393446b79cf5c7fd5dd57ecab2c4ffe8e986b7f9b76095136ef718d6f4fb1","sha256:47cbfdd94d1843dea49d2137d4a912a4c6e29e74cae0b861f25ae77ea2df2bb9"],"state_sha256":"a4eba56291add71d0a07d4d1d34a7d519e4601eb6be6f84051e6b19f8e73f0f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/91aIEIWdFzeBgEXdZlB+YCj4rYV2wL2plX+MKajl3Zgae3w1bQXCGViR7YcYL7v+B55yaS4Fkv0KybxXhpfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:42:06.057014Z","bundle_sha256":"44fc00aaeb6123fe1363c5793615bca470c7ad6eea8ccfc2003d493b209b9555"}}