{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SDJYIZYBCPH2ZKFR5Q4GWOGQ3J","short_pith_number":"pith:SDJYIZYB","canonical_record":{"source":{"id":"1906.03286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-07T18:29:16Z","cross_cats_sorted":[],"title_canon_sha256":"31d9bad122880a6143d5f2650ae653b724b12d15adc50e8979bc094df4965a82","abstract_canon_sha256":"11d2f6ffeb69aff57de42349fc9754297eac66b06f008156a1f0431b2de4a5f5"},"schema_version":"1.0"},"canonical_sha256":"90d384670113cfaca8b1ec386b38d0da6a6c6b0b6b00d8c09b96887318eb6b77","source":{"kind":"arxiv","id":"1906.03286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03286","created_at":"2026-05-17T23:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03286v1","created_at":"2026-05-17T23:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03286","created_at":"2026-05-17T23:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"SDJYIZYBCPH2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SDJYIZYBCPH2ZKFR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SDJYIZYB","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SDJYIZYBCPH2ZKFR5Q4GWOGQ3J","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-07T18:29:16Z","cross_cats_sorted":[],"title_canon_sha256":"31d9bad122880a6143d5f2650ae653b724b12d15adc50e8979bc094df4965a82","abstract_canon_sha256":"11d2f6ffeb69aff57de42349fc9754297eac66b06f008156a1f0431b2de4a5f5"},"schema_version":"1.0"},"canonical_sha256":"90d384670113cfaca8b1ec386b38d0da6a6c6b0b6b00d8c09b96887318eb6b77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:48.905392Z","signature_b64":"B0WwQZbzbXOEQ6FmoXICeaIj54dfKY5DLXJGz/hW9nVkBdN6hSGNzbQ2hBL3VdJupmHSGJALuwYxbg8AxW28Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d384670113cfaca8b1ec386b38d0da6a6c6b0b6b00d8c09b96887318eb6b77","last_reissued_at":"2026-05-17T23:43:48.904709Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:48.904709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03286","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-17T23:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyhCtxWb2eoKfjHRvc4MuWyhnSkNdqOhJ2cXDqwIHHJE4FBgHsQnMSRR2RaGykSYluZ2aRGhonc3O7l5CPz7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:50:53.505375Z"},"content_sha256":"a996b7f81d485dbab977b973c291abc5678158c13c45c186c4ad1e76ed66f0b0","schema_version":"1.0","event_id":"sha256:a996b7f81d485dbab977b973c291abc5678158c13c45c186c4ad1e76ed66f0b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SDJYIZYBCPH2ZKFR5Q4GWOGQ3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic First Price Auctions Robust to Heterogeneous Buyers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Balasubramanian Sivan, Eric Balkanski, Shipra Agrawal, Vahab Mirrokni","submitted_at":"2019-06-07T18:29:16Z","abstract_excerpt":"We study dynamic mechanisms for optimizing revenue in repeated auctions, that are robust to heterogeneous forward-looking and learning behavior of the buyers. Typically it is assumed that the buyers are either all myopic or are all infinite lookahead, and that buyers understand and trust the mechanism. These assumptions raise the following question: is it possible to design approximately revenue optimal mechanisms when the buyer pool is heterogeneous? Facing a heterogeneous population of buyers with an unknown mixture of $k$-lookahead buyers, myopic buyers, no-regret-learners and no-policy-reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03286","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-17T23:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlaB6gqAjR5ZzmIgt8BG5UublFiurFoEisliFmXOq3+yoVKTcX1x85cOSOjZ3cICPJksN4vxkdDTdadq4cSICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:50:53.505936Z"},"content_sha256":"286a69cca7f27797bfaa5fbd3e555be3cda2534ea55ec69f832ecb189331d411","schema_version":"1.0","event_id":"sha256:286a69cca7f27797bfaa5fbd3e555be3cda2534ea55ec69f832ecb189331d411"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J/bundle.json","state_url":"https://pith.science/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J/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-05T05:50:53Z","links":{"resolver":"https://pith.science/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J","bundle":"https://pith.science/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J/bundle.json","state":"https://pith.science/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDJYIZYBCPH2ZKFR5Q4GWOGQ3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SDJYIZYBCPH2ZKFR5Q4GWOGQ3J","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":"11d2f6ffeb69aff57de42349fc9754297eac66b06f008156a1f0431b2de4a5f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-07T18:29:16Z","title_canon_sha256":"31d9bad122880a6143d5f2650ae653b724b12d15adc50e8979bc094df4965a82"},"schema_version":"1.0","source":{"id":"1906.03286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03286","created_at":"2026-05-17T23:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03286v1","created_at":"2026-05-17T23:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03286","created_at":"2026-05-17T23:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"SDJYIZYBCPH2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SDJYIZYBCPH2ZKFR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SDJYIZYB","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:286a69cca7f27797bfaa5fbd3e555be3cda2534ea55ec69f832ecb189331d411","target":"graph","created_at":"2026-05-17T23:43:48Z","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 dynamic mechanisms for optimizing revenue in repeated auctions, that are robust to heterogeneous forward-looking and learning behavior of the buyers. Typically it is assumed that the buyers are either all myopic or are all infinite lookahead, and that buyers understand and trust the mechanism. These assumptions raise the following question: is it possible to design approximately revenue optimal mechanisms when the buyer pool is heterogeneous? Facing a heterogeneous population of buyers with an unknown mixture of $k$-lookahead buyers, myopic buyers, no-regret-learners and no-policy-reg","authors_text":"Balasubramanian Sivan, Eric Balkanski, Shipra Agrawal, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-07T18:29:16Z","title":"Dynamic First Price Auctions Robust to Heterogeneous Buyers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03286","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:a996b7f81d485dbab977b973c291abc5678158c13c45c186c4ad1e76ed66f0b0","target":"record","created_at":"2026-05-17T23:43:48Z","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":"11d2f6ffeb69aff57de42349fc9754297eac66b06f008156a1f0431b2de4a5f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-07T18:29:16Z","title_canon_sha256":"31d9bad122880a6143d5f2650ae653b724b12d15adc50e8979bc094df4965a82"},"schema_version":"1.0","source":{"id":"1906.03286","kind":"arxiv","version":1}},"canonical_sha256":"90d384670113cfaca8b1ec386b38d0da6a6c6b0b6b00d8c09b96887318eb6b77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90d384670113cfaca8b1ec386b38d0da6a6c6b0b6b00d8c09b96887318eb6b77","first_computed_at":"2026-05-17T23:43:48.904709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:48.904709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0WwQZbzbXOEQ6FmoXICeaIj54dfKY5DLXJGz/hW9nVkBdN6hSGNzbQ2hBL3VdJupmHSGJALuwYxbg8AxW28Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:48.905392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a996b7f81d485dbab977b973c291abc5678158c13c45c186c4ad1e76ed66f0b0","sha256:286a69cca7f27797bfaa5fbd3e555be3cda2534ea55ec69f832ecb189331d411"],"state_sha256":"04ba1c1819bed8728ac109f6de8e72968b38427770ce834f505395f45527864f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4/PCDzI5MH3s8BJGGndxU54v2Z2ol4/XE1xJttx8VYjvqJeNsVy3eJ4JiNzZ6GT5N0ETAZusizpNBXSGNEEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:50:53.508820Z","bundle_sha256":"8827bc586c66b45c9b558084e62cfb48a0b73fddfcdfb642c5b3f6a6f0167085"}}