{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7Z66HO2ZMFSCLVNTWH4LXASFGX","short_pith_number":"pith:7Z66HO2Z","canonical_record":{"source":{"id":"1803.00494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-01T16:46:31Z","cross_cats_sorted":[],"title_canon_sha256":"13327285d9d8cd87ee7c194c63b7a19fc9cfabd4e4d935d335b8cfa6de5c7ff7","abstract_canon_sha256":"e84dc11485e50760f25d4359318c6fc4c677d92834fd4fbdba0495a3a54fbdce"},"schema_version":"1.0"},"canonical_sha256":"fe7de3bb59616425d5b3b1f8bb824535f38ec76ae79335b51d781cd27329d9f5","source":{"kind":"arxiv","id":"1803.00494","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00494","created_at":"2026-05-17T23:51:44Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00494v2","created_at":"2026-05-17T23:51:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00494","created_at":"2026-05-17T23:51:44Z"},{"alias_kind":"pith_short_12","alias_value":"7Z66HO2ZMFSC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7Z66HO2ZMFSCLVNT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7Z66HO2Z","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7Z66HO2ZMFSCLVNTWH4LXASFGX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-01T16:46:31Z","cross_cats_sorted":[],"title_canon_sha256":"13327285d9d8cd87ee7c194c63b7a19fc9cfabd4e4d935d335b8cfa6de5c7ff7","abstract_canon_sha256":"e84dc11485e50760f25d4359318c6fc4c677d92834fd4fbdba0495a3a54fbdce"},"schema_version":"1.0"},"canonical_sha256":"fe7de3bb59616425d5b3b1f8bb824535f38ec76ae79335b51d781cd27329d9f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:44.313355Z","signature_b64":"9VcA51zL+SoqRUhkoSDkYtWDnbSarpFEwk3xMXkKbEnGJNdceHufnH4ow2tsZt27WHOv7xA0PHJx3aAf1Ye2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7de3bb59616425d5b3b1f8bb824535f38ec76ae79335b51d781cd27329d9f5","last_reissued_at":"2026-05-17T23:51:44.312882Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:44.312882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00494","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-17T23:51:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCEJxi04rDFVfiiMN9wdjQ8kNN0cbqm8Eganuvkd3yRqmVGJlb9p9JWS5HdqrsAl20sAHtoGS5Id929CgykYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T15:47:19.577496Z"},"content_sha256":"c34714eb1b87d14fa5ddb30f36e930a612b7de7ba40e17260b677306a2a50476","schema_version":"1.0","event_id":"sha256:c34714eb1b87d14fa5ddb30f36e930a612b7de7ba40e17260b677306a2a50476"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7Z66HO2ZMFSCLVNTWH4LXASFGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Repeated Auctions under Heterogeneous Buyer Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Balasubramanian Sivan, Constantinos Daskalakis, Shipra Agrawal, Vahab Mirrokni","submitted_at":"2018-03-01T16:46:31Z","abstract_excerpt":"We study revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite lookahead, or some specific form of learning behavior. Is it possible to design mechanisms which are simultaneously optimal against a multitude of possible buyer behaviors? We answer this question by designing a simple state-based mechanism that is simultaneously approximately optimal against a $k$-lookahead buyer for all $k$, a buyer who is a no-regret lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00494","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-17T23:51:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GkFLBIQP5QuutTPDShVoIwFH5mjhXEMF+htAFuthjpCfspIi+rMJbCj9AYS54ZbzXbWEUSJpKXphWvHHy4VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T15:47:19.577852Z"},"content_sha256":"a845676f69b655c9c0e47984c60a03bf75e835b1db88d92243f1170762b96a8e","schema_version":"1.0","event_id":"sha256:a845676f69b655c9c0e47984c60a03bf75e835b1db88d92243f1170762b96a8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX/bundle.json","state_url":"https://pith.science/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX/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-20T15:47:19Z","links":{"resolver":"https://pith.science/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX","bundle":"https://pith.science/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX/bundle.json","state":"https://pith.science/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Z66HO2ZMFSCLVNTWH4LXASFGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7Z66HO2ZMFSCLVNTWH4LXASFGX","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":"e84dc11485e50760f25d4359318c6fc4c677d92834fd4fbdba0495a3a54fbdce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-01T16:46:31Z","title_canon_sha256":"13327285d9d8cd87ee7c194c63b7a19fc9cfabd4e4d935d335b8cfa6de5c7ff7"},"schema_version":"1.0","source":{"id":"1803.00494","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00494","created_at":"2026-05-17T23:51:44Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00494v2","created_at":"2026-05-17T23:51:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00494","created_at":"2026-05-17T23:51:44Z"},{"alias_kind":"pith_short_12","alias_value":"7Z66HO2ZMFSC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"7Z66HO2ZMFSCLVNT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"7Z66HO2Z","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a845676f69b655c9c0e47984c60a03bf75e835b1db88d92243f1170762b96a8e","target":"graph","created_at":"2026-05-17T23:51:44Z","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 revenue optimization in a repeated auction between a single seller and a single buyer. Traditionally, the design of repeated auctions requires strong modeling assumptions about the bidder behavior, such as it being myopic, infinite lookahead, or some specific form of learning behavior. Is it possible to design mechanisms which are simultaneously optimal against a multitude of possible buyer behaviors? We answer this question by designing a simple state-based mechanism that is simultaneously approximately optimal against a $k$-lookahead buyer for all $k$, a buyer who is a no-regret lea","authors_text":"Balasubramanian Sivan, Constantinos Daskalakis, Shipra Agrawal, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-01T16:46:31Z","title":"Robust Repeated Auctions under Heterogeneous Buyer Behavior"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00494","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:c34714eb1b87d14fa5ddb30f36e930a612b7de7ba40e17260b677306a2a50476","target":"record","created_at":"2026-05-17T23:51:44Z","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":"e84dc11485e50760f25d4359318c6fc4c677d92834fd4fbdba0495a3a54fbdce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-03-01T16:46:31Z","title_canon_sha256":"13327285d9d8cd87ee7c194c63b7a19fc9cfabd4e4d935d335b8cfa6de5c7ff7"},"schema_version":"1.0","source":{"id":"1803.00494","kind":"arxiv","version":2}},"canonical_sha256":"fe7de3bb59616425d5b3b1f8bb824535f38ec76ae79335b51d781cd27329d9f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe7de3bb59616425d5b3b1f8bb824535f38ec76ae79335b51d781cd27329d9f5","first_computed_at":"2026-05-17T23:51:44.312882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:44.312882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9VcA51zL+SoqRUhkoSDkYtWDnbSarpFEwk3xMXkKbEnGJNdceHufnH4ow2tsZt27WHOv7xA0PHJx3aAf1Ye2CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:44.313355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00494","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c34714eb1b87d14fa5ddb30f36e930a612b7de7ba40e17260b677306a2a50476","sha256:a845676f69b655c9c0e47984c60a03bf75e835b1db88d92243f1170762b96a8e"],"state_sha256":"0e94dfe1f4b96c1aba8e6343e84c1e0d08ce6ca71b5d2d548e3107482a41b84c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stc0WbczbaoOKdIAfmRptlfsx/pjZjHMK9TYckdnSxgrzHz0CC+qz1xyS3AXdJ8lex+5ncciODjgVJcKcGD6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T15:47:19.580002Z","bundle_sha256":"da5324bf6eca6d29ad1e6744bc28997d67388879e048534f176fcd57d9caffb3"}}