{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6YMNPFKDAPJCBVRZQLVF36EE4A","short_pith_number":"pith:6YMNPFKD","canonical_record":{"source":{"id":"1404.2041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-08T08:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"56b9e4a227f83c71203ec3dd9ae5768fc47fb88fabc980edece271366d3971ec","abstract_canon_sha256":"86af00ade49a216ac98c5868936fb975bba5a1641a7a0abfdcc84187de777ae5"},"schema_version":"1.0"},"canonical_sha256":"f618d7954303d220d63982ea5df884e006412a35851b2ba7f4874e55c42867e8","source":{"kind":"arxiv","id":"1404.2041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2041","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2041v2","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2041","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"6YMNPFKDAPJC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6YMNPFKDAPJCBVRZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6YMNPFKD","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6YMNPFKDAPJCBVRZQLVF36EE4A","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-08T08:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"56b9e4a227f83c71203ec3dd9ae5768fc47fb88fabc980edece271366d3971ec","abstract_canon_sha256":"86af00ade49a216ac98c5868936fb975bba5a1641a7a0abfdcc84187de777ae5"},"schema_version":"1.0"},"canonical_sha256":"f618d7954303d220d63982ea5df884e006412a35851b2ba7f4874e55c42867e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:43.204874Z","signature_b64":"PyYhWXlpsYwZ9e6ZD3l7pui4iX/Mqbpn99sTKnl5ZJ27FvLB1BthRkXzXw1pE5MhpVrwPwXfaJrdn3FSZ0Z/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f618d7954303d220d63982ea5df884e006412a35851b2ba7f4874e55c42867e8","last_reissued_at":"2026-05-18T01:55:43.204289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:43.204289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2041","source_version":2,"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-18T01:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGOgq/XqcgCkqjrYkJlIuabyaCRpnUQqgvQ4C36qUGwysuUhaamWswpqtiyhTB1bnJ75FI2oNIBp7Lt+4LdLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:32:06.606724Z"},"content_sha256":"0e6b81325020631f7925773e1ddadba3ae2353c8d64cc998929c0ac8352a8517","schema_version":"1.0","event_id":"sha256:0e6b81325020631f7925773e1ddadba3ae2353c8d64cc998929c0ac8352a8517"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6YMNPFKDAPJCBVRZQLVF36EE4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Computing an Equilibrium in Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hu Fu, Robert Kleinberg, Shahar Dobzinski","submitted_at":"2014-04-08T08:39:24Z","abstract_excerpt":"We study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the optimal one.\n  We show that when the valuations of the bidders are submodular, in many interesting settings (e.g., constant number of bidders, budget additive bidders) computing an equilibrium with good welfare is essentially as easy as computing, completely ignoring incentives issues, an allocation with good welfare. On the other hand, for subadditive valuatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2041","kind":"arxiv","version":2},"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-18T01:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uth4qtrT2B416SyZd3cFyeGD/PagMpYofeC1u4eMUHOeeu9rtM7RClWkmOP6iqTPUYrJMMsVnO1nawHjWQKVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:32:06.607378Z"},"content_sha256":"d2ce95470e6fd08005a41948dad7ffa263c04c64224835c25f6ce63186f02e83","schema_version":"1.0","event_id":"sha256:d2ce95470e6fd08005a41948dad7ffa263c04c64224835c25f6ce63186f02e83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YMNPFKDAPJCBVRZQLVF36EE4A/bundle.json","state_url":"https://pith.science/pith/6YMNPFKDAPJCBVRZQLVF36EE4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YMNPFKDAPJCBVRZQLVF36EE4A/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-07T08:32:06Z","links":{"resolver":"https://pith.science/pith/6YMNPFKDAPJCBVRZQLVF36EE4A","bundle":"https://pith.science/pith/6YMNPFKDAPJCBVRZQLVF36EE4A/bundle.json","state":"https://pith.science/pith/6YMNPFKDAPJCBVRZQLVF36EE4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YMNPFKDAPJCBVRZQLVF36EE4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6YMNPFKDAPJCBVRZQLVF36EE4A","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":"86af00ade49a216ac98c5868936fb975bba5a1641a7a0abfdcc84187de777ae5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-08T08:39:24Z","title_canon_sha256":"56b9e4a227f83c71203ec3dd9ae5768fc47fb88fabc980edece271366d3971ec"},"schema_version":"1.0","source":{"id":"1404.2041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2041","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2041v2","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2041","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"6YMNPFKDAPJC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6YMNPFKDAPJCBVRZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6YMNPFKD","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d2ce95470e6fd08005a41948dad7ffa263c04c64224835c25f6ce63186f02e83","target":"graph","created_at":"2026-05-18T01:55:43Z","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 study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the optimal one.\n  We show that when the valuations of the bidders are submodular, in many interesting settings (e.g., constant number of bidders, budget additive bidders) computing an equilibrium with good welfare is essentially as easy as computing, completely ignoring incentives issues, an allocation with good welfare. On the other hand, for subadditive valuatio","authors_text":"Hu Fu, Robert Kleinberg, Shahar Dobzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-08T08:39:24Z","title":"On the Complexity of Computing an Equilibrium in Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2041","kind":"arxiv","version":2},"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:0e6b81325020631f7925773e1ddadba3ae2353c8d64cc998929c0ac8352a8517","target":"record","created_at":"2026-05-18T01:55:43Z","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":"86af00ade49a216ac98c5868936fb975bba5a1641a7a0abfdcc84187de777ae5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-08T08:39:24Z","title_canon_sha256":"56b9e4a227f83c71203ec3dd9ae5768fc47fb88fabc980edece271366d3971ec"},"schema_version":"1.0","source":{"id":"1404.2041","kind":"arxiv","version":2}},"canonical_sha256":"f618d7954303d220d63982ea5df884e006412a35851b2ba7f4874e55c42867e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f618d7954303d220d63982ea5df884e006412a35851b2ba7f4874e55c42867e8","first_computed_at":"2026-05-18T01:55:43.204289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:43.204289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PyYhWXlpsYwZ9e6ZD3l7pui4iX/Mqbpn99sTKnl5ZJ27FvLB1BthRkXzXw1pE5MhpVrwPwXfaJrdn3FSZ0Z/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:43.204874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e6b81325020631f7925773e1ddadba3ae2353c8d64cc998929c0ac8352a8517","sha256:d2ce95470e6fd08005a41948dad7ffa263c04c64224835c25f6ce63186f02e83"],"state_sha256":"8cfe7a8c146b376ddd4ae6ad15e9063cb4234cbb4ae9b71072514df349389a8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFSXgwDJS6Fj9IEsTw83K/VK6ayS8SyMY35dg1PSsrM+aaZ69cbQiR8eWfCHqLeuQ2K6Utw37LFxUKDtNAWJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:32:06.610459Z","bundle_sha256":"6f15f057f720c791a7db17b6c446a581e380acff2d2552fd1ec159c276179b13"}}