{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YLS55TFDTIYOSWUUVNJFRJTRHH","short_pith_number":"pith:YLS55TFD","canonical_record":{"source":{"id":"1511.01411","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-04T17:39:30Z","cross_cats_sorted":["cs.AI","cs.CC","cs.LG"],"title_canon_sha256":"4348191573f77a4ffb382738db1b552686996ea4e79ae5abb5a3af68756ff562","abstract_canon_sha256":"862610b724b9f0272c3b4828a363cf1964d71bd899ee9b1dd0a0c83f4d09f73f"},"schema_version":"1.0"},"canonical_sha256":"c2e5decca39a30e95a94ab5258a67139ea1d659df728320746a1230cc8648ea1","source":{"kind":"arxiv","id":"1511.01411","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01411","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01411v6","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01411","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"YLS55TFDTIYO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YLS55TFDTIYOSWUU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YLS55TFD","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YLS55TFDTIYOSWUUVNJFRJTRHH","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01411","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-04T17:39:30Z","cross_cats_sorted":["cs.AI","cs.CC","cs.LG"],"title_canon_sha256":"4348191573f77a4ffb382738db1b552686996ea4e79ae5abb5a3af68756ff562","abstract_canon_sha256":"862610b724b9f0272c3b4828a363cf1964d71bd899ee9b1dd0a0c83f4d09f73f"},"schema_version":"1.0"},"canonical_sha256":"c2e5decca39a30e95a94ab5258a67139ea1d659df728320746a1230cc8648ea1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:37.098912Z","signature_b64":"LK/wVufpcG9TrKiY2YiumBzgt9NHCxLkqpIlmZyN93VctZCO4aVDFdxiJWz6AvlX2ipIJlfRS87QM+tCsp4wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e5decca39a30e95a94ab5258a67139ea1d659df728320746a1230cc8648ea1","last_reissued_at":"2026-05-18T01:17:37.098002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:37.098002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01411","source_version":6,"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:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFDrd4KhXjQcyxpk4vp5uA0RmCXjpTLPj6UFiWPC4a+wdAgMeJ4AW+G6EkZ7ukT4PruOmmEFSYDw/NkmJ6nwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:36:33.107211Z"},"content_sha256":"43e1a1bf68caccc1fd3acbfe687ba8fa2cfa8faa70982a153eba790ba5a0eed7","schema_version":"1.0","event_id":"sha256:43e1a1bf68caccc1fd3acbfe687ba8fa2cfa8faa70982a153eba790ba5a0eed7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YLS55TFDTIYOSWUUVNJFRJTRHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning in Auctions: Regret is Hard, Envy is Easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.LG"],"primary_cat":"cs.GT","authors_text":"Constantinos Daskalakis, Vasilis Syrgkanis","submitted_at":"2015-11-04T17:39:30Z","abstract_excerpt":"A line of recent work provides welfare guarantees of simple combinatorial auction formats, such as selling m items via simultaneous second price auctions (SiSPAs) (Christodoulou et al. 2008, Bhawalkar and Roughgarden 2011, Feldman et al. 2013). These guarantees hold even when the auctions are repeatedly executed and players use no-regret learning algorithms. Unfortunately, off-the-shelf no-regret algorithms for these auctions are computationally inefficient as the number of actions is exponential. We show that this obstacle is insurmountable: there are no polynomial-time no-regret algorithms f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01411","kind":"arxiv","version":6},"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:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6u9vOFWYrIEuhaYN2OdM9DV5UIWrxXcRgU3MqOsdWPjrkFAGFgrnURnEvpUWm8oEEvhkdhwBRQoh39ZQpyjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:36:33.107945Z"},"content_sha256":"04c8722318c97126217ddd3482448a896e4228ae7c59ee2eab0c6293c906fc0f","schema_version":"1.0","event_id":"sha256:04c8722318c97126217ddd3482448a896e4228ae7c59ee2eab0c6293c906fc0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLS55TFDTIYOSWUUVNJFRJTRHH/bundle.json","state_url":"https://pith.science/pith/YLS55TFDTIYOSWUUVNJFRJTRHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLS55TFDTIYOSWUUVNJFRJTRHH/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-05-27T11:36:33Z","links":{"resolver":"https://pith.science/pith/YLS55TFDTIYOSWUUVNJFRJTRHH","bundle":"https://pith.science/pith/YLS55TFDTIYOSWUUVNJFRJTRHH/bundle.json","state":"https://pith.science/pith/YLS55TFDTIYOSWUUVNJFRJTRHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLS55TFDTIYOSWUUVNJFRJTRHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YLS55TFDTIYOSWUUVNJFRJTRHH","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":"862610b724b9f0272c3b4828a363cf1964d71bd899ee9b1dd0a0c83f4d09f73f","cross_cats_sorted":["cs.AI","cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-04T17:39:30Z","title_canon_sha256":"4348191573f77a4ffb382738db1b552686996ea4e79ae5abb5a3af68756ff562"},"schema_version":"1.0","source":{"id":"1511.01411","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01411","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01411v6","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01411","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"YLS55TFDTIYO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YLS55TFDTIYOSWUU","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YLS55TFD","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:04c8722318c97126217ddd3482448a896e4228ae7c59ee2eab0c6293c906fc0f","target":"graph","created_at":"2026-05-18T01:17: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":"A line of recent work provides welfare guarantees of simple combinatorial auction formats, such as selling m items via simultaneous second price auctions (SiSPAs) (Christodoulou et al. 2008, Bhawalkar and Roughgarden 2011, Feldman et al. 2013). These guarantees hold even when the auctions are repeatedly executed and players use no-regret learning algorithms. Unfortunately, off-the-shelf no-regret algorithms for these auctions are computationally inefficient as the number of actions is exponential. We show that this obstacle is insurmountable: there are no polynomial-time no-regret algorithms f","authors_text":"Constantinos Daskalakis, Vasilis Syrgkanis","cross_cats":["cs.AI","cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-04T17:39:30Z","title":"Learning in Auctions: Regret is Hard, Envy is Easy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01411","kind":"arxiv","version":6},"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:43e1a1bf68caccc1fd3acbfe687ba8fa2cfa8faa70982a153eba790ba5a0eed7","target":"record","created_at":"2026-05-18T01:17: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":"862610b724b9f0272c3b4828a363cf1964d71bd899ee9b1dd0a0c83f4d09f73f","cross_cats_sorted":["cs.AI","cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-04T17:39:30Z","title_canon_sha256":"4348191573f77a4ffb382738db1b552686996ea4e79ae5abb5a3af68756ff562"},"schema_version":"1.0","source":{"id":"1511.01411","kind":"arxiv","version":6}},"canonical_sha256":"c2e5decca39a30e95a94ab5258a67139ea1d659df728320746a1230cc8648ea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e5decca39a30e95a94ab5258a67139ea1d659df728320746a1230cc8648ea1","first_computed_at":"2026-05-18T01:17:37.098002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:37.098002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LK/wVufpcG9TrKiY2YiumBzgt9NHCxLkqpIlmZyN93VctZCO4aVDFdxiJWz6AvlX2ipIJlfRS87QM+tCsp4wDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:37.098912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01411","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43e1a1bf68caccc1fd3acbfe687ba8fa2cfa8faa70982a153eba790ba5a0eed7","sha256:04c8722318c97126217ddd3482448a896e4228ae7c59ee2eab0c6293c906fc0f"],"state_sha256":"e9be4a9a274776ba36cefb7c9f6c05a88b4dc5b54067f5a4290d2120cfcae8c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lLlngyJ1YziRwgr5P7TU5KsqGGFvHVyA7/QfQnzT1brbYUucAgmUjQ0j02xv4/BD5Cc1paA96LcBuGG0k6aBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:36:33.111103Z","bundle_sha256":"593cf551a72475bddddb16710e66294dcb4477e5ea00fccaa28e28617eb2ce8f"}}