{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SFFZLNGMARVA7D4H3KYMLXWA4L","short_pith_number":"pith:SFFZLNGM","canonical_record":{"source":{"id":"1011.2413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-10T15:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"6449aa64ae8f86337f1d74c9ec59564bb979550497609759129942a89c338b8e","abstract_canon_sha256":"b970b8d7f37907b3e25872a7092bd18277ff16f8759eff580ea4594e7aa098e7"},"schema_version":"1.0"},"canonical_sha256":"914b95b4cc046a0f8f87dab0c5dec0e2f9cdc60061c2801bcea2c1544b611a6b","source":{"kind":"arxiv","id":"1011.2413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2413","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2413v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2413","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"SFFZLNGMARVA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SFFZLNGMARVA7D4H","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SFFZLNGM","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SFFZLNGMARVA7D4H3KYMLXWA4L","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-10T15:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"6449aa64ae8f86337f1d74c9ec59564bb979550497609759129942a89c338b8e","abstract_canon_sha256":"b970b8d7f37907b3e25872a7092bd18277ff16f8759eff580ea4594e7aa098e7"},"schema_version":"1.0"},"canonical_sha256":"914b95b4cc046a0f8f87dab0c5dec0e2f9cdc60061c2801bcea2c1544b611a6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.083290Z","signature_b64":"rfYlARMuZZdHf8Hu0G2qP+/yAZ7NZmg9P/UzGgvHbazKOWLaUQuYU5EiiYulGbujh+eo/rdMeK3nz5qWhFmxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"914b95b4cc046a0f8f87dab0c5dec0e2f9cdc60061c2801bcea2c1544b611a6b","last_reissued_at":"2026-05-18T02:23:37.082582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.082582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2413","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvuWC5CfcHClr2TlSDq5wkj220+vxo0IU8WSnMS4QByutafra/XARRgGF8K7ZHdooCTHtDZHpmwFhYOrBw8kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:10:48.700987Z"},"content_sha256":"66f13ae840bb686cb20970d4147fc31824d59cba0758348f528011bd80c0f7e4","schema_version":"1.0","event_id":"sha256:66f13ae840bb686cb20970d4147fc31824d59cba0758348f528011bd80c0f7e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SFFZLNGMARVA7D4H3KYMLXWA4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Auctions with Correlated Bidders are Easy","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":"2010-11-10T15:53:56Z","abstract_excerpt":"We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there exists an algorithm that finds the optimal randomized mechanism that runs in time polynomial in the size of the support. We leverage this result to show that in the oracle model introduced by Ronen and Saberi [FOCS'02], there exists a polynomial time truthful in expectation mechanism that provides a $(\\frac 3 2+\\epsilon)$-approximation to the revenue achievable by an optimal truthful-in-expectation mechanism, and a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2413","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qJX2gKz8HZ7u2q/ISMArpRtRjVX11kqSd2EevhGrBIUa4Dfst/d+qzpuWgXv2h3+avUmuqyptmP9sP1z2j8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:10:48.701663Z"},"content_sha256":"a9ce884bccbf9abdfd9936e0e431ace3ba9cd614d48245195faa8e587ece3a95","schema_version":"1.0","event_id":"sha256:a9ce884bccbf9abdfd9936e0e431ace3ba9cd614d48245195faa8e587ece3a95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFFZLNGMARVA7D4H3KYMLXWA4L/bundle.json","state_url":"https://pith.science/pith/SFFZLNGMARVA7D4H3KYMLXWA4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFFZLNGMARVA7D4H3KYMLXWA4L/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-07T07:10:48Z","links":{"resolver":"https://pith.science/pith/SFFZLNGMARVA7D4H3KYMLXWA4L","bundle":"https://pith.science/pith/SFFZLNGMARVA7D4H3KYMLXWA4L/bundle.json","state":"https://pith.science/pith/SFFZLNGMARVA7D4H3KYMLXWA4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFFZLNGMARVA7D4H3KYMLXWA4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SFFZLNGMARVA7D4H3KYMLXWA4L","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":"b970b8d7f37907b3e25872a7092bd18277ff16f8759eff580ea4594e7aa098e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-10T15:53:56Z","title_canon_sha256":"6449aa64ae8f86337f1d74c9ec59564bb979550497609759129942a89c338b8e"},"schema_version":"1.0","source":{"id":"1011.2413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2413","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2413v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2413","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"SFFZLNGMARVA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SFFZLNGMARVA7D4H","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SFFZLNGM","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:a9ce884bccbf9abdfd9936e0e431ace3ba9cd614d48245195faa8e587ece3a95","target":"graph","created_at":"2026-05-18T02:23:37Z","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 problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there exists an algorithm that finds the optimal randomized mechanism that runs in time polynomial in the size of the support. We leverage this result to show that in the oracle model introduced by Ronen and Saberi [FOCS'02], there exists a polynomial time truthful in expectation mechanism that provides a $(\\frac 3 2+\\epsilon)$-approximation to the revenue achievable by an optimal truthful-in-expectation mechanism, and a p","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":"2010-11-10T15:53:56Z","title":"Optimal Auctions with Correlated Bidders are Easy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2413","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:66f13ae840bb686cb20970d4147fc31824d59cba0758348f528011bd80c0f7e4","target":"record","created_at":"2026-05-18T02:23:37Z","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":"b970b8d7f37907b3e25872a7092bd18277ff16f8759eff580ea4594e7aa098e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-10T15:53:56Z","title_canon_sha256":"6449aa64ae8f86337f1d74c9ec59564bb979550497609759129942a89c338b8e"},"schema_version":"1.0","source":{"id":"1011.2413","kind":"arxiv","version":1}},"canonical_sha256":"914b95b4cc046a0f8f87dab0c5dec0e2f9cdc60061c2801bcea2c1544b611a6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"914b95b4cc046a0f8f87dab0c5dec0e2f9cdc60061c2801bcea2c1544b611a6b","first_computed_at":"2026-05-18T02:23:37.082582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.082582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rfYlARMuZZdHf8Hu0G2qP+/yAZ7NZmg9P/UzGgvHbazKOWLaUQuYU5EiiYulGbujh+eo/rdMeK3nz5qWhFmxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.083290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66f13ae840bb686cb20970d4147fc31824d59cba0758348f528011bd80c0f7e4","sha256:a9ce884bccbf9abdfd9936e0e431ace3ba9cd614d48245195faa8e587ece3a95"],"state_sha256":"0e801db471ccd5177272e079e0524da20cb9980fbab3605ce17c1515ea39b466"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FJIoDS1Au5I1jKIeq+CZv/TvbLrJD9SGZPyoNS/h4A/wnBVDiIqutDuERp1avZ4r4RvMkhIeMtHactxVVvCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:10:48.705985Z","bundle_sha256":"067cf8f6f9121b5c89535172cc30125d9bf2cbeff980c287c13c1d31569f7ef3"}}