{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WHHVJDXVCFOL5FSZ3T5QIDVIEL","short_pith_number":"pith:WHHVJDXV","canonical_record":{"source":{"id":"2003.01497","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-02T00:37:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d858c6b11524f13d26ff657e39fdf34edec38946f37ac8fb31e5f4fd6c0b1571","abstract_canon_sha256":"ebeac8d66b8ff6712c13903897f83ba3f4039621e7d259b0f78e1e1904f2a081"},"schema_version":"1.0"},"canonical_sha256":"b1cf548ef5115cbe9659dcfb040ea822d1e710c8980db14d525b9b98d0588265","source":{"kind":"arxiv","id":"2003.01497","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.01497","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"2003.01497v4","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01497","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"WHHVJDXVCFOL","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"WHHVJDXVCFOL5FSZ","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"WHHVJDXV","created_at":"2026-07-05T03:25:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WHHVJDXVCFOL5FSZ3T5QIDVIEL","target":"record","payload":{"canonical_record":{"source":{"id":"2003.01497","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-02T00:37:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d858c6b11524f13d26ff657e39fdf34edec38946f37ac8fb31e5f4fd6c0b1571","abstract_canon_sha256":"ebeac8d66b8ff6712c13903897f83ba3f4039621e7d259b0f78e1e1904f2a081"},"schema_version":"1.0"},"canonical_sha256":"b1cf548ef5115cbe9659dcfb040ea822d1e710c8980db14d525b9b98d0588265","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:09.698676Z","signature_b64":"kxvMQ0JjcNZEoCKTBM1FnBCNgPNxjCbSIK/5VuRLiOVdWY0ishki+Yu/xwqnPsG/nORuqj1q5QbQkOx5es6RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1cf548ef5115cbe9659dcfb040ea822d1e710c8980db14d525b9b98d0588265","last_reissued_at":"2026-07-05T03:25:09.698165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:09.698165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.01497","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czqTVqJrkUvCNQYJT4uDRx8Ss2+SETwBiDd1Z9zQeWWIFcCOBOEZU+hOrOarT9ZmkAKZYP92+DlHuq2MBHuKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:33:04.390478Z"},"content_sha256":"b11c49cd80a6c0da7793cce16f5cfb1107f5c097f837fbe3a11425f2acb4526c","schema_version":"1.0","event_id":"sha256:b11c49cd80a6c0da7793cce16f5cfb1107f5c097f837fbe3a11425f2acb4526c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WHHVJDXVCFOL5FSZ3T5QIDVIEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Permutation-Equivariant Neural Network Architecture For Auction Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Jad Rahme, Joan Bruna, Samy Jelassi, S. Matthew Weinberg","submitted_at":"2020-03-02T00:37:36Z","abstract_excerpt":"Designing an incentive compatible auction that maximizes expected revenue is a central problem in Auction Design. Theoretical approaches to the problem have hit some limits in the past decades and analytical solutions are known for only a few simple settings. Computational approaches to the problem through the use of LPs have their own set of limitations. Building on the success of deep learning, a new approach was recently proposed by Duetting et al. (2019) in which the auction is modeled by a feed-forward neural network and the design problem is framed as a learning problem. The neural archi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01497","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/2003.01497/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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apHLrz7hIeyUIytuOAa/8tMecMMqQDkHSyXgVGA+d/kO6siZUyIwewxUiN97M9Ade69lfGF6clqrz7Flc1t0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:33:04.391470Z"},"content_sha256":"b4711cf082eb7fa511634b2d3107ab13def4aa27b536af4728ce21c446ffed3c","schema_version":"1.0","event_id":"sha256:b4711cf082eb7fa511634b2d3107ab13def4aa27b536af4728ce21c446ffed3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL/bundle.json","state_url":"https://pith.science/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL/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-08T19:33:04Z","links":{"resolver":"https://pith.science/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL","bundle":"https://pith.science/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL/bundle.json","state":"https://pith.science/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHHVJDXVCFOL5FSZ3T5QIDVIEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WHHVJDXVCFOL5FSZ3T5QIDVIEL","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":"ebeac8d66b8ff6712c13903897f83ba3f4039621e7d259b0f78e1e1904f2a081","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-02T00:37:36Z","title_canon_sha256":"d858c6b11524f13d26ff657e39fdf34edec38946f37ac8fb31e5f4fd6c0b1571"},"schema_version":"1.0","source":{"id":"2003.01497","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.01497","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"2003.01497v4","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01497","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"WHHVJDXVCFOL","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"pith_short_16","alias_value":"WHHVJDXVCFOL5FSZ","created_at":"2026-07-05T03:25:09Z"},{"alias_kind":"pith_short_8","alias_value":"WHHVJDXV","created_at":"2026-07-05T03:25:09Z"}],"graph_snapshots":[{"event_id":"sha256:b4711cf082eb7fa511634b2d3107ab13def4aa27b536af4728ce21c446ffed3c","target":"graph","created_at":"2026-07-05T03:25:09Z","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/2003.01497/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. Theoretical approaches to the problem have hit some limits in the past decades and analytical solutions are known for only a few simple settings. Computational approaches to the problem through the use of LPs have their own set of limitations. Building on the success of deep learning, a new approach was recently proposed by Duetting et al. (2019) in which the auction is modeled by a feed-forward neural network and the design problem is framed as a learning problem. The neural archi","authors_text":"Jad Rahme, Joan Bruna, Samy Jelassi, S. Matthew Weinberg","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-02T00:37:36Z","title":"A Permutation-Equivariant Neural Network Architecture For Auction Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01497","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:b11c49cd80a6c0da7793cce16f5cfb1107f5c097f837fbe3a11425f2acb4526c","target":"record","created_at":"2026-07-05T03:25:09Z","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":"ebeac8d66b8ff6712c13903897f83ba3f4039621e7d259b0f78e1e1904f2a081","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-03-02T00:37:36Z","title_canon_sha256":"d858c6b11524f13d26ff657e39fdf34edec38946f37ac8fb31e5f4fd6c0b1571"},"schema_version":"1.0","source":{"id":"2003.01497","kind":"arxiv","version":4}},"canonical_sha256":"b1cf548ef5115cbe9659dcfb040ea822d1e710c8980db14d525b9b98d0588265","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1cf548ef5115cbe9659dcfb040ea822d1e710c8980db14d525b9b98d0588265","first_computed_at":"2026-07-05T03:25:09.698165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:25:09.698165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kxvMQ0JjcNZEoCKTBM1FnBCNgPNxjCbSIK/5VuRLiOVdWY0ishki+Yu/xwqnPsG/nORuqj1q5QbQkOx5es6RCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:25:09.698676Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.01497","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11c49cd80a6c0da7793cce16f5cfb1107f5c097f837fbe3a11425f2acb4526c","sha256:b4711cf082eb7fa511634b2d3107ab13def4aa27b536af4728ce21c446ffed3c"],"state_sha256":"0b0e794db96001dd76e62cd613240b47aa1bde69c7c6368f13f67f4871d8190a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aap9HjnYD8y0FKhjnumdd0vwy9+dFOyawau2EWeLeBN6nvbHPPLE2yHu8hGxS2bcs1ANBn7hewbQlQNVgor+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:33:04.398824Z","bundle_sha256":"c9175f22d65a25e1529ea36f19913dfc6b9a45e7e9ef3c738090399228b5ddaa"}}