{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3MI4D32MKK4YA6DTWERB5Y5JHG","short_pith_number":"pith:3MI4D32M","canonical_record":{"source":{"id":"2006.05684","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-06-10T06:45:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9a7325b49703305cd292a6c76e8dbba1861450a20b6826e239ec8744875ba454","abstract_canon_sha256":"7db6b6a8b80f18c58480327e51065350686fe94559df7648e8e47463323a806a"},"schema_version":"1.0"},"canonical_sha256":"db11c1ef4c52b9807873b1221ee3a939a3c4710dde003f5463612c20ea9d6807","source":{"kind":"arxiv","id":"2006.05684","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05684","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05684v4","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05684","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"3MI4D32MKK4Y","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"3MI4D32MKK4YA6DT","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"3MI4D32M","created_at":"2026-07-05T03:25:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3MI4D32MKK4YA6DTWERB5Y5JHG","target":"record","payload":{"canonical_record":{"source":{"id":"2006.05684","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-06-10T06:45:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9a7325b49703305cd292a6c76e8dbba1861450a20b6826e239ec8744875ba454","abstract_canon_sha256":"7db6b6a8b80f18c58480327e51065350686fe94559df7648e8e47463323a806a"},"schema_version":"1.0"},"canonical_sha256":"db11c1ef4c52b9807873b1221ee3a939a3c4710dde003f5463612c20ea9d6807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:10.374881Z","signature_b64":"6TJwYFC96yOv7NtGY+1LH4fHen6pfUPbqabrPA8EXcOorsfRjc+js9mQnDxA1k5jzPyzRkzyDE6ujxbTOsvJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db11c1ef4c52b9807873b1221ee3a939a3c4710dde003f5463612c20ea9d6807","last_reissued_at":"2026-07-05T03:25:10.374368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:10.374368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.05684","source_version":4,"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-07-05T03:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etE0E3j6D7alM+bSrN9cBuUbnziUsSnc6LA+nRRt9LnkhSXOvqUiAcUhqunIq8uCK3uVdOVlQv1Eu53L74rgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:12:27.204029Z"},"content_sha256":"f352aa431a0439cdf53911cbd45c2c016feba47adb39ea7bd09bd314e7528329","schema_version":"1.0","event_id":"sha256:f352aa431a0439cdf53911cbd45c2c016feba47adb39ea7bd09bd314e7528329"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3MI4D32MKK4YA6DTWERB5Y5JHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Auction learning as a two-player game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Jad Rahme, Samy Jelassi, S. Matthew Weinberg","submitted_at":"2020-06-10T06:45:20Z","abstract_excerpt":"Designing an incentive compatible auction that maximizes expected revenue is a central problem in Auction Design. While theoretical approaches to the problem have hit some limits, a recent research direction initiated by Duetting et al. (2019) consists in building neural network architectures to find optimal auctions. We propose two conceptual deviations from their approach which result in enhanced performance. First, we use recent results in theoretical auction design (Rubinstein and Weinberg, 2018) to introduce a time-independent Lagrangian. This not only circumvents the need for an expensiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05684","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.05684/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xb//BtRTLMPUMDUEyj2iBoMjjSTG3/jVA2cNIXT5C8Jy1GnFMtfGqgGWXOfkKHNGbScNq7c+5U3OPL5Gf9o1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:12:27.204567Z"},"content_sha256":"a15f4ab1a34791300d7bfb9915d001e282179d6bddd936c9ab24b549bae28987","schema_version":"1.0","event_id":"sha256:a15f4ab1a34791300d7bfb9915d001e282179d6bddd936c9ab24b549bae28987"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MI4D32MKK4YA6DTWERB5Y5JHG/bundle.json","state_url":"https://pith.science/pith/3MI4D32MKK4YA6DTWERB5Y5JHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MI4D32MKK4YA6DTWERB5Y5JHG/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-08-08T13:12:27Z","links":{"resolver":"https://pith.science/pith/3MI4D32MKK4YA6DTWERB5Y5JHG","bundle":"https://pith.science/pith/3MI4D32MKK4YA6DTWERB5Y5JHG/bundle.json","state":"https://pith.science/pith/3MI4D32MKK4YA6DTWERB5Y5JHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MI4D32MKK4YA6DTWERB5Y5JHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3MI4D32MKK4YA6DTWERB5Y5JHG","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":"7db6b6a8b80f18c58480327e51065350686fe94559df7648e8e47463323a806a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-06-10T06:45:20Z","title_canon_sha256":"9a7325b49703305cd292a6c76e8dbba1861450a20b6826e239ec8744875ba454"},"schema_version":"1.0","source":{"id":"2006.05684","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05684","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05684v4","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05684","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"3MI4D32MKK4Y","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"3MI4D32MKK4YA6DT","created_at":"2026-07-05T03:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"3MI4D32M","created_at":"2026-07-05T03:25:10Z"}],"graph_snapshots":[{"event_id":"sha256:a15f4ab1a34791300d7bfb9915d001e282179d6bddd936c9ab24b549bae28987","target":"graph","created_at":"2026-07-05T03:25:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.05684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Designing an incentive compatible auction that maximizes expected revenue is a central problem in Auction Design. While theoretical approaches to the problem have hit some limits, a recent research direction initiated by Duetting et al. (2019) consists in building neural network architectures to find optimal auctions. We propose two conceptual deviations from their approach which result in enhanced performance. First, we use recent results in theoretical auction design (Rubinstein and Weinberg, 2018) to introduce a time-independent Lagrangian. This not only circumvents the need for an expensiv","authors_text":"Jad Rahme, Samy Jelassi, S. Matthew Weinberg","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-06-10T06:45:20Z","title":"Auction learning as a two-player game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05684","kind":"arxiv","version":4},"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:f352aa431a0439cdf53911cbd45c2c016feba47adb39ea7bd09bd314e7528329","target":"record","created_at":"2026-07-05T03:25:10Z","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":"7db6b6a8b80f18c58480327e51065350686fe94559df7648e8e47463323a806a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-06-10T06:45:20Z","title_canon_sha256":"9a7325b49703305cd292a6c76e8dbba1861450a20b6826e239ec8744875ba454"},"schema_version":"1.0","source":{"id":"2006.05684","kind":"arxiv","version":4}},"canonical_sha256":"db11c1ef4c52b9807873b1221ee3a939a3c4710dde003f5463612c20ea9d6807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db11c1ef4c52b9807873b1221ee3a939a3c4710dde003f5463612c20ea9d6807","first_computed_at":"2026-07-05T03:25:10.374368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:25:10.374368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TJwYFC96yOv7NtGY+1LH4fHen6pfUPbqabrPA8EXcOorsfRjc+js9mQnDxA1k5jzPyzRkzyDE6ujxbTOsvJAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:25:10.374881Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.05684","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f352aa431a0439cdf53911cbd45c2c016feba47adb39ea7bd09bd314e7528329","sha256:a15f4ab1a34791300d7bfb9915d001e282179d6bddd936c9ab24b549bae28987"],"state_sha256":"01f0e82675f764e4a436230ccf8754f0b3657d3f504115c7f68e44588a705feb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pGzPYHULsJCDfDa7SbJ4SZ/Vkz43U1n9RCapBxCBKrDCZOZ+j54R/si9jzwUzse0a9fT6hxNvEv0JDjFOgnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:12:27.207878Z","bundle_sha256":"beae238b579ff00f5386ae56ef1e14d057156bc284c07f82b68b51bb9d2070d2"}}