{"as_of":"2026-08-12T09:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5996e5f40fdb1facec1566c604b5c885e3600431babbc857dc6c6a0fc5d3bff4","coverage":[{"denominator":136,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:03:27.213453Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.22911/citation-record","integrity":"/paper/2506.22911/integrity","json":"/paper/2506.22911/citation-record.json","paper":"/paper/2506.22911"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:18.656340Z","title":"Towards data auctions with externalities","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:18.656340Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f6a78c1bc270fa0316824c9cb18326a1408f0a656e1efb0138f2fd39796cad32","observation_id":"57102e47-07a0-4150-8eb0-e73ed813ea3f","resolution":{"observed_at":"2026-08-06T22:03:18.656340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:18.753284Z","title":"Automated design of robust mecha- nisms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:18.753284Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:647561c3c038128a3c76c001dcac5ba51f003470c6efe1ee619a868ad95712e5","observation_id":"9933a6d4-892f-4799-86d6-1176d1d1c0df","resolution":{"observed_at":"2026-08-06T22:03:18.753284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:18.832867Z","title":"Backpropagation and stochastic gradient descent method","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:18.832867Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:3e84bb671fd206a01d8c71bee4edc95236580252ac227b5df981f9ce12f29a96","observation_id":"e04777cb-c2ce-4239-9eb0-fe2f499edff1","resolution":{"observed_at":"2026-08-06T22:03:18.832867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:18.894484Z","title":"Input convex neural networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:18.894484Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:8985d4318db37c8b6c937a7a7c1148e176f31de4eb2ea1c557eccee6af7751e9","observation_id":"27f2512e-4196-4d47-a2e8-3b638cc35e98","resolution":{"observed_at":"2026-08-06T22:03:18.894484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:18.935783Z","title":"Near-optimal max-affine estimators for convex regression","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:18.935783Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:053e6d44e222d98f18e1cd9ab6c965304ce31ae09f25362f0d41f18d5eb66295","observation_id":"5031d63b-1d47-4060-ae5c-ccfc2b3b9abd","resolution":{"observed_at":"2026-08-06T22:03:18.935783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.022044Z","title":"Sample complexity of automated mechanism design","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.022044Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9a590692de2351ae0063ae91eb21922f59c4468ec147f44ba574874f915fcb15","observation_id":"8553bc7d-2a80-4436-a6cf-61a9501db2a9","resolution":{"observed_at":"2026-08-06T22:03:19.022044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.083459Z","title":"MAC advice for facility loca- tion mechanism design","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.083459Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9dd3146273fb01335419ed7675cbdde6b090f409ad0f3125228d7bdcc71e0702","observation_id":"109808fa-8a06-40e7-9045-fb8d3d6ba908","resolution":{"observed_at":"2026-08-06T22:03:19.083459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.139165Z","title":"Universal approximation bounds for superpositions of a sigmoidal func- tion","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.139165Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:30c6024cbe8ef376dbc567f38768e8ff19025dd82c585ac49e8d5df92466f8b8","observation_id":"2a448ba1-bc40-4b43-a573-dda93216307d","resolution":{"observed_at":"2026-08-06T22:03:19.139165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.180273Z","title":"Dynamic programming","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.180273Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:becf7eb9f8a4967770c7d882fa5f3bebde6cf4b1dcc683a9d8a58d703cdef7a4","observation_id":"f65c3bde-f4cd-403b-add1-4002e1c19551","resolution":{"observed_at":"2026-08-06T22:03:19.180273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.252516Z","title":"The curse of highly variable functions for local kernel machines","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.252516Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:70db3f155fb60087ef4d0308e25921010ea23c4529fd9a93879c5c0d6cc6864e","observation_id":"d953f4b1-0dd5-4c79-9876-9989801436de","resolution":{"observed_at":"2026-08-06T22:03:19.252516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.299557Z","title":"Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.299557Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:006e2780ee0ac4f1b13fe2462d21bc52c6e7adf9cb21890714c024c5e556f9bf","observation_id":"e1183996-5e50-488f-864d-c615b7cb428c","resolution":{"observed_at":"2026-08-06T22:03:19.299557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.329007Z","title":"Welfare and profit maximization with production costs","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.329007Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:3a14f5e1cc4e15110fd115a7b8ac48d7fcc4deefae976367ae797fccfb3d15c2","observation_id":"e4e44873-e310-4d4e-b341-be7af078900c","resolution":{"observed_at":"2026-08-06T22:03:19.329007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.368815Z","title":"Large-scale machine learning with stochastic gradient descent","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.368815Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:c500c2ab4487e3db84c5a50b2ab70ef30db63ee6538ed0aa6772c8b4c71ba35f","observation_id":"91a7bd91-eeb2-4b90-bce6-4db9e5840b61","resolution":{"observed_at":"2026-08-06T22:03:19.368815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.441664Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.441664Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:cc82e2812c8bba9a61a1f8fd521c7248de3fb336a0b84b40f5c7a43c0da81fee","observation_id":"a268b65a-2737-4803-923b-0480759fab43","resolution":{"observed_at":"2026-08-06T22:03:19.441664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.527986Z","title":"An Introduction to the Theory of Mechanism Design","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.527986Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:32943af9b89754faa4ba50d06ef34e06d5c3c46718fdea683ea762c58d3a1311","observation_id":"77f8dc4a-f05d-4cbc-936d-bedddeb73354","resolution":{"observed_at":"2026-08-06T22:03:19.527986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.592789Z","title":"Optimal multi-dimensional mechanism design: Reducing revenue to welfare maximization","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.592789Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:db96e1da7d42fcf7409066201048805865e338dddc9a0cf6fc3d94947cc48a67","observation_id":"dfed6679-c798-470e-a0fa-d9e12598583c","resolution":{"observed_at":"2026-08-06T22:03:19.592789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.641861Z","title":"Log-sum-exp neural net- works and posynomial models for convex and log-log-convex data","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.641861Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:676094ae84e2c69d5422b1cf4509fbedb5faf2b26cef9c2ac2b7e6674e009599","observation_id":"2600b9bb-d826-4f35-a4b8-65c1de008c94","resolution":{"observed_at":"2026-08-06T22:03:19.641861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.683782Z","title":"Truthful implementation and preference aggregation in restricted domains","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.683782Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:889fa1241d315b3a0027c5204ba867ff28f9aafb86a34c288987f8e7ad4b54a6","observation_id":"83ee5b39-2457-4835-b4bd-7a3e02fa8e76","resolution":{"observed_at":"2026-08-06T22:03:19.683782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.727408Z","title":"Mechanism Design for Facility Location Problem: A Survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.727408Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:0163c9f6183aa0dcfa6987a0fc7da7dece9aa213a9d0139b58ac876e8b9b2c58","observation_id":"26e51296-4403-45eb-be76-3b432c48ae5a","resolution":{"observed_at":"2026-08-06T22:03:19.727408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.779438Z","title":"Optimal competitive auctions","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.779438Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:7bd2633e01a9a0388fe9da3f80dc5cf39070c24d833e907c30da2c0b97c11cb5","observation_id":"4cb9130e-c0d3-4f25-8b56-daf5ce4dbf21","resolution":{"observed_at":"2026-08-06T22:03:19.779438Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.836931Z","title":"The complexity of optimal multidimensional pricing","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.836931Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:1b46576531d828c9566cf3ef83b3cd1be3ad7666ea52a517596104679419566b","observation_id":"275b6d4c-3646-4ed6-a04c-d72eee03310a","resolution":{"observed_at":"2026-08-06T22:03:19.836931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.891159Z","title":"Strategy-proofness and “median voters","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.891159Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:14310e74048957a8d326d374110fe8fe8cfda20719b8ed876d330eb5b8c5ed2a","observation_id":"55ce1b74-2f13-484f-afc0-3c207d50aa03","resolution":{"observed_at":"2026-08-06T22:03:19.891159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.922615Z","title":"Multipart pricing of public goods","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.922615Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:30ba6a6385e250822163d5823dfcbe2d8d665dff3ef24fb77a906bf20217e358","observation_id":"b1fd6a1c-c126-4930-aa9c-ba6a4d72022c","resolution":{"observed_at":"2026-08-06T22:03:19.922615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:19.966918Z","title":"Incremental mechanism design","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:19.966918Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:8d7c1284fb18a437f2971a2f15ea67b74751ae1e5ab3eaa626a44ee8026d0c6d","observation_id":"01c0499f-e87b-4c8b-96d8-aa4199122453","resolution":{"observed_at":"2026-08-06T22:03:19.966918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.007287Z","title":"Differentiable economics for ran- domized affine maximizer auctions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.007287Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:01ee3d8eed928046c003c6e57dd8db175fa853ef495d83a52472273fa2b64cba","observation_id":"b76e8258-4412-4a13-adc5-8924536a4684","resolution":{"observed_at":"2026-08-06T22:03:20.007287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.055673Z","title":"Automated design of affine maximizer mechanisms in dynamic set- tings","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.055673Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:392f92f1a49dd73b580cfda8eaeaf30f97066969c06795f82e97c95c1d0520f9","observation_id":"f0e9e74b-79ab-4245-b973-2e161f84e9b3","resolution":{"observed_at":"2026-08-06T22:03:20.055673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.102661Z","title":"Certifying strategyproof auction networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.102661Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:7044f26ba2c6feddd9db1fd21df65c8215ddd32d12a3623a4abeff195d46e2d4","observation_id":"5613cbca-513d-4b88-8b74-d0e13ce3cba1","resolution":{"observed_at":"2026-08-06T22:03:20.102661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09129","last_updated":"2024-02-14T12:27:54Z","snapshot_observed_at":"2026-07-06T17:30:00.589378Z","submitted_at":"2024-02-14T12:27:54Z","title":"Optimal Automated Market Makers: Differentiable Economics and Strong Duality","version":1},"cited_work":{"arxiv_id":"2402.09129","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.09129","snapshot_observed_at":"2026-08-06T22:03:31.674561Z","title":"Optimal Automated Market Makers: Differentiable Economics and Strong Duality","venue":"cs.GT","work_id":"8e178e3b-6116-4af4-b646-0fd2d91f19e6","year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.189465Z"},"links":{"cited_paper":"/paper/2402.09129","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:d467744c0356120a69ff9c282cac9a1ef8d92ab12273a256fc25a6b4d3246a13","observation_id":"7588f277-fe1b-430a-ad32-3d5119eb6689","resolution":{"observed_at":"2026-08-06T22:03:31.707115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.274425Z","title":"Learning revenue-maximizing auctions with differentiable matching","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.274425Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:8ff836173f88f3be266884aa1e396a2d41f7022d72569e544b0419efcb849159","observation_id":"7a6a0215-c7fb-4f2a-9b89-9d0434edc277","resolution":{"observed_at":"2026-08-06T22:03:20.274425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.278416Z","title":"Approximation by superpositions of a sigmoidal function","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.278416Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:2870cb1705671aad22115dde927880ba2d4927a098e655094034509769b8cc90","observation_id":"42c4d617-3a1b-463f-8413-df0558621710","resolution":{"observed_at":"2026-08-06T22:03:20.278416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.281671Z","title":"Strong duality for a multiple-good monopolist","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.281671Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:909d2b4a668331eeb8932bd2366dfe4b831eaf2f001c72369c58e0e61c165be0","observation_id":"76620333-305d-4373-adb3-29141635fb82","resolution":{"observed_at":"2026-08-06T22:03:20.281671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.355577Z","title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.355577Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:07f1e3b75eedb7c9ad0da1d732fa12fd651c404914b36d842f7da9d22ed23e11","observation_id":"e987b88f-bc1b-4c00-90fd-52b24a4b26fc","resolution":{"observed_at":"2026-08-06T22:03:20.355577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.573746Z","title":"Continuity properties of Paretian utility","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.573746Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9e864713ebedb33f9dd06d993a789da059f7d09da5ef015c67d32996b43e6270","observation_id":"5febc184-bc6a-48e4-ac69-01484fdfa0eb","resolution":{"observed_at":"2026-08-06T22:03:20.573746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-07-06T19:53:17.024873Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.13513","snapshot_observed_at":"2026-08-06T22:03:20.716950Z","title":"Procurement Auctions via Approximately Optimal Submodular Opti- mization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.716950Z"},"links":{"cited_paper":"/paper/2411.13513","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9f6aca6e1485726140b0a4d422def9177a12ea42a37a02d3e479011c25bd7011","observation_id":"53a96779-0ea2-4f5e-a62a-5df93b8c06ca","resolution":{"observed_at":"2026-08-06T22:03:20.716950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:20.835149Z","title":"A context-integrated transformer-based neural network for auction design","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:20.835149Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:d9773f84107777247c6b4676e531db5751ebcf6dc1a70c50cb2d6b89ac139823","observation_id":"c07f3f6d-e474-47af-a2d0-4bfb2607c753","resolution":{"observed_at":"2026-08-06T22:03:20.835149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.004956Z","title":"A scalable neural network for DSIC affine maximizer auction design","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.004956Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:ff07fdc63c8904c2f3c1334ab49468a4f524cce8f69cf57dee34ce4a9404882f","observation_id":"59b4249d-e197-4cbc-97e2-c298546c9a81","resolution":{"observed_at":"2026-08-06T22:03:21.004956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.182497Z","title":"Mechanism design for large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.182497Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:121df11bf6f9c8812029ac3206c90097d59d154bf6339bee5b499183ba877ae3","observation_id":"e1831598-7d6a-4973-8bf6-5e3c3d231c81","resolution":{"observed_at":"2026-08-06T22:03:21.182497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.07679","last_updated":"2016-04-04T11:27:36Z","snapshot_observed_at":"2026-08-03T08:37:56.722087Z","submitted_at":"2015-12-24T01:31:40Z","title":"Deep Reinforcement Learning in Large Discrete Action Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.07679","snapshot_observed_at":"2026-08-06T22:03:21.282748Z","title":"Deep reinforcement learning in large discrete action spaces","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.282748Z"},"links":{"cited_paper":"/paper/1512.07679","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f2629c32d6e79fef1709968d8b1ad2170f9690bcd31a72659ee8e78781f7f78d","observation_id":"5bb7bc22-329b-4af5-9955-cbcbd679854f","resolution":{"observed_at":"2026-08-06T22:03:21.282748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.396221Z","title":"Optimal auctions through deep learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.396221Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:0f732969e89a1abba9d24be9eec4fa75f8e5210c733dcdada77bf0fb0f593626","observation_id":"d546b0d9-6032-477a-bca6-82cbeb7e0c03","resolution":{"observed_at":"2026-08-06T22:03:21.396221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.549822Z","title":"Optimal auctions through deep learning: Advances in differentiable economics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.549822Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:a464e12fd9d26b6b8eab76fc063a3f9437d2f7ca27cdbf75fcb48e6ab1670d7d","observation_id":"97a7b71f-2bc1-4e33-9d7c-14f1a296e33a","resolution":{"observed_at":"2026-08-06T22:03:21.549822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.659417Z","title":"Reverse Auction Relinquishing Broadcast Spectrum Rights","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.659417Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:36eb92edec7cb74e0fed6a43ee73b6c67aa26e1c4eeefd25c54fff6616b2c7c7","observation_id":"a60fa36e-4ebe-4c74-9521-8f9a523d43d3","resolution":{"observed_at":"2026-08-06T22:03:21.659417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.693297Z","title":"College admissions and the stability of marriage","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.693297Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:29a83bc6dee18a6c9d05aedf8cb60647406a1225ff443b2af400f278ea9da2bb","observation_id":"314d7992-7345-49b6-8d83-d00c9eaf0c1c","resolution":{"observed_at":"2026-08-06T22:03:21.693297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.800313Z","title":"Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.800313Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9d5fb823be9e02f2c545cdd6754f4dbf3e61d4033b710534ebfcde26a4dc17bd","observation_id":"13352a68-0fef-48ae-8a52-170c61b4fdb8","resolution":{"observed_at":"2026-08-06T22:03:21.800313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.873613Z","title":"Reverse auctions are different from auctions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.873613Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:ae680c4ca6404ffd256952d94d0e893b45116a712430a8390c1fa3d21545d9c9","observation_id":"f4752200-7fb1-4a3b-9de7-49d4f04aba6c","resolution":{"observed_at":"2026-08-06T22:03:21.873613Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:21.977981Z","title":"Duality and optimality of auctions for uniform distributions","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:21.977981Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:84b696e0bde382cb1dc23ef12552ed467344859ad4e323cbbfcb75ef3a01aa15","observation_id":"b4ef0632-2829-4f5b-a63a-6bb49d99a0f8","resolution":{"observed_at":"2026-08-06T22:03:21.977981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.053658Z","title":"Manipulation of voting schemes: a general result","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.053658Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f83d5057c3070a36e9fc9d0859b11376cc445da25909980a8f5897070fa5f87c","observation_id":"e7414f70-2694-49ea-837c-15fdf3deb8f1","resolution":{"observed_at":"2026-08-06T22:03:22.053658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.141193Z","title":"Competitive auctions for multiple digital goods","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.141193Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:7d9b7d31a8cbcdbf4ce9f7301c4de8d51e3268fc0819b658389fec3845c22b95","observation_id":"4f6ccd96-8f13-46aa-a718-e21bcd3f6e4d","resolution":{"observed_at":"2026-08-06T22:03:22.141193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.234620Z","title":"A lower bound on the competitive ratio of truthful auctions","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.234620Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:24eb0077a5215d00d7df157bffb7c99d5d28e41dec70e3685b9a156b5742826e","observation_id":"d14259cb-9f59-43cb-b941-dd063be670ac","resolution":{"observed_at":"2026-08-06T22:03:22.234620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.347124Z","title":"Deep learning for multi- facility location mechanism design","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.347124Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:7d2eee5dcb64d2913d9b6549c77dcc55ed94325c54860704c659b005b55b3b9f","observation_id":"3bdab74b-647e-45b8-afdd-e110217df94f","resolution":{"observed_at":"2026-08-06T22:03:22.347124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.436303Z","title":"Deep Learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.436303Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:2bfc5ee856f48e9918a4f8e1ccc2bbbe36ab0fa09792bd94e59119cd804b8210","observation_id":"5258b0e7-45c0-4eae-8435-5a85d04d4104","resolution":{"observed_at":"2026-08-06T22:03:22.436303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.507627Z","title":"Approximation guarantees of Median Mechanism in Rd","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.507627Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:a2e201fbee4b4dc3484f8399b6837462998abe107d8ef8ec62f23913d9a30fb0","observation_id":"430a34aa-c9f5-40f1-aa13-124151e7bb41","resolution":{"observed_at":"2026-08-06T22:03:22.507627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.617858Z","title":"Incentives in teams","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.617858Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:53cc7bcc55bebadee99057fde6b587f2f6022cb4bbf5a9c5a53fe088b916b4cb","observation_id":"f63f7dfb-eb01-40bf-9a17-dab415e51199","resolution":{"observed_at":"2026-08-06T22:03:22.617858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.704343Z","title":"Settling the sample complexity of single- parameter revenue maximization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.704343Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:e09b5e7f0a8e1b83a9ad5233e6e11595f5163e6c3fecea08d371c4b66ebe6c7e","observation_id":"5b914a3f-312f-4460-9a8d-42c26db8f75e","resolution":{"observed_at":"2026-08-06T22:03:22.704343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.817309Z","title":"Computationally feasible automated mechanism design: General approach and case studies","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.817309Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:ff18ac284821a59f89342cf22fcd5589e9d12ccfdafaf86de1ff014eeb9bc836","observation_id":"8fbd5680-4c7b-44cb-a8ed-70b816e838a4","resolution":{"observed_at":"2026-08-06T22:03:22.817309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:22.955541Z","title":"Optimizing affine maximizer auctions via linear programming: an application to revenue maximizing mechanism design for zero-day exploits markets","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:22.955541Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f5bc505452daa817d059f7563a2f142bd8e74f18fe5769384918985a47c8acfb","observation_id":"0586909e-08ae-4f0e-aada-cd315e926e80","resolution":{"observed_at":"2026-08-06T22:03:22.955541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:23.091781Z","title":"Prior-Independent Auctions for Heterogeneous Bidders","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.091781Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:dd3619e6d73219b967b51ae3a37c16475c7c2bfe7d43f7d5cfc4de0f5d573eaf","observation_id":"53fa4dae-a350-472e-a315-c5362b82f2df","resolution":{"observed_at":"2026-08-06T22:03:23.091781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:23.190298Z","title":"Automated on- line mechanism design and prophet inequalities","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.190298Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:2eafc3c27f11c0a33e8ed489b1d6f54956cf080ffb97844bad6adfdeb8944820","observation_id":"5df34d58-7e08-49f6-b8d3-172eb45dd3b4","resolution":{"observed_at":"2026-08-06T22:03:23.190298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:23.297814Z","title":"Straightforward individual incentive compatibility in large economies","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.297814Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f251de5d35703eee8a84ac3bdf859ad7224293a445517e870d8cc815c18cbf3f","observation_id":"8c8728d7-f23c-4dfa-878e-28e301d9d615","resolution":{"observed_at":"2026-08-06T22:03:23.297814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:23.404589Z","title":"Universal approximation of symmetric and anti-symmetric functions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.404589Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:36b567b85869253ef142dd0fb43317f6b7dbc75f475102b0cbbfe537b63b8bf0","observation_id":"51ebbfde-645c-43b3-b4f2-1fa159cf288b","resolution":{"observed_at":"2026-08-06T22:03:23.404589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:23.514389Z","title":"Profit maximization in mechanism design","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.514389Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:4b0a2825fa160daec4c254efed5120cd3a9ba52dc60a7b508cb5b6af955d47ad","observation_id":"6e4510f6-f578-4c5e-8924-2381b24ff546","resolution":{"observed_at":"2026-08-06T22:03:23.514389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.08415","last_updated":"2023-06-06T01:53:32Z","snapshot_observed_at":"2026-07-06T05:01:27.910364Z","submitted_at":"2016-06-27T19:20:40Z","title":"Gaussian Error Linear Units (GELUs)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.08415","snapshot_observed_at":"2026-08-06T22:03:23.631653Z","title":"Gaussian Error Linear Units (GELUs)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.631653Z"},"links":{"cited_paper":"/paper/1606.08415","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:a23ca140ee7e482e6a2187a4b562b91748095112140f8d97001c8ea52668005c","observation_id":"6bb739bb-d0f9-4d5a-9f8d-febfb358d084","resolution":{"observed_at":"2026-08-06T22:03:23.631653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:49.761062Z","title":"Welfare maximization with production costs: A primal dual approach","venue":null,"work_id":"f279a860-0751-4cc0-9baf-ea1bd09b76df","year":2019},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.734138Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:ae5cdedd6742a2a0daaaff965475a6ceade8b513e64c0b9c9a88ffdf11c1e09e","observation_id":"b25b6e4d-f007-4bda-a621-4500af4b4706","resolution":{"observed_at":"2026-08-06T22:03:49.863067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:49.483255Z","title":"Optimal-er auctions through attention","venue":null,"work_id":"9a8af79f-2b20-4a45-9467-c9237199f9de","year":2022},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.804975Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:5a2d3f942440a1f85b7eedc9af24c55eb8cb535c53c209b40cd41a5769d34dce","observation_id":"c6721c6f-079b-4441-a05c-4af4b738fa13","resolution":{"observed_at":"2026-08-06T22:03:49.636386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:49.286470Z","title":"Posted Price Mechanisms for Online Allocation with Disec- onomies of Scale","venue":null,"work_id":"ad048823-afdf-4c45-96d3-dd9a7cee5979","year":2025},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.913680Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:fae27652497df6a137faf1bcc22d39fc0a9c9c9b7cb3d1aa71d5a9615d36107a","observation_id":"ef2e18dc-215a-47bb-8d47-37c859266f96","resolution":{"observed_at":"2026-08-06T22:03:49.379759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:49.004443Z","title":"An Online Intelligent Task Pricing Mechanism Based on Reverse Auction in Mobile Crowdsensing Networks for the Internet of Things","venue":null,"work_id":"bf680600-856d-41df-97f1-9b77da21b61e","year":2021},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:23.992501Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:e67c650d41917d1da37948904e72a488e0ea0577365d6870606f8411f11f133e","observation_id":"e34f5530-84c6-4701-8182-bb20ba1223dc","resolution":{"observed_at":"2026-08-06T22:03:49.112564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:48.739802Z","title":"Estimation of particle transmission by random sampling","venue":null,"work_id":"d29e8ffa-05f9-4dd5-95f2-8bf79ab91d0e","year":1951},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.073807Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:003fd767294cb951e4ff333d157075576ea4ffe355d314e39cc50b4d4613311d","observation_id":"e17d3687-e1d4-423b-bfe6-549cc9bf8502","resolution":{"observed_at":"2026-08-06T22:03:48.880579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:48.472214Z","title":"Parameterized convex universal approximators for decision- making problems","venue":null,"work_id":"4a02cd71-edc2-47b8-9038-c45b721a0c1b","year":2022},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.140249Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:e4a157ca1d8caf71cac59615af11ffe9e8e88856eada60715efa36df6ecd764f","observation_id":"c93494be-dc5e-429e-973b-0ed2e68c4b29","resolution":{"observed_at":"2026-08-06T22:03:48.590802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-06T22:03:24.218228Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.218228Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:b694a0358d09f55e7f72a5ff5580b475429e275b7c90fd349e0b9910bd7c7914","observation_id":"b8ed81b5-07d6-4219-8ef8-0d51daa396ec","resolution":{"observed_at":"2026-08-06T22:03:24.218228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:48.209504Z","title":"Bayesian estimates of equation system parameters: an application of integration by Monte Carlo","venue":null,"work_id":"e886b455-4c04-41aa-b5d8-f8dfc1fd34ac","year":1978},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.303036Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:4a572ef1f5db5c5e0c17156a944b4c62900dcfaf716a151c89350c0c866f68ba","observation_id":"4cb63ce5-d980-4203-b61a-bf9aea8f1d68","resolution":{"observed_at":"2026-08-06T22:03:48.340250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:47.831342Z","title":"Total-cost procurement auctions: Impact of suppliers’ cost adjustments on auction format choice","venue":null,"work_id":"27f89ec0-0e12-492f-b652-79b058aa7ccd","year":2009},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.371591Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:2f5c711c942b091b19934dd31471193c18d39f693db0078e114971c541c09c25","observation_id":"1b0f7ec0-904c-4c77-9e65-1ad33ea11f51","resolution":{"observed_at":"2026-08-06T22:03:48.012487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:47.498586Z","title":"Faster first-order methods for extensive-form game solving","venue":null,"work_id":"86fe6da8-0f05-46fd-b6c3-37933eb55202","year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.473727Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:00bef92e6f0a90eaaf8adba2b412330ab1468ff928b077911f11ede849bc1848","observation_id":"6cc72ebd-f118-4784-b233-1d7c8b37a6a4","resolution":{"observed_at":"2026-08-06T22:03:47.710679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:47.224174Z","title":"Towards a characterization of truthful combi- natorial auctions","venue":null,"work_id":"24b10fea-bad6-454c-a10c-9427f96b4834","year":null},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.565841Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:2f3f30a528e41196f67778faf72645324e38e9172d02e652e6133490b0fa5699","observation_id":"cfbfe6c9-4b61-4b4a-831f-16d4759af485","resolution":{"observed_at":"2026-08-06T22:03:47.388967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:46.703125Z","title":"Two simplified proofs for Roberts’ theorem","venue":null,"work_id":"3084ed37-b812-4b0e-8631-57b2e4aa23ca","year":2009},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.741994Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:eeabbaadbca0dab00edf841eaaf6a6f96ee9c565d12a6a30be6bc8587b878659","observation_id":"f949a3ae-ef4f-41e1-a9d3-6d93edba9319","resolution":{"observed_at":"2026-08-06T22:03:46.824269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:46.374588Z","title":"Truthful and near-optimal mechanism design via linear programming","venue":null,"work_id":"dca8a544-740f-492e-a6dd-17811175bd7f","year":2011},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.834317Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:b4faec10c2cc5e0f64f62c3daad43544b080b8c8cf7ab153d9ae01f02d8d3794","observation_id":"4e8a7139-734b-4a8f-9c46-c232d294cfff","resolution":{"observed_at":"2026-08-06T22:03:46.502859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:46.051694Z","title":"Deep learning","venue":null,"work_id":"7f8b4376-03f2-4a49-9d46-a538bf98e9ed","year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:24.917310Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9a56d24f443a8b00bff391dde5156c028003444ec3ee2add1f354ef2cddf3ef9","observation_id":"6676b129-9c08-4de0-b955-0c7148d22cef","resolution":{"observed_at":"2026-08-06T22:03:46.175708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:45.765315Z","title":"Set transformer: A framework for attention-based permutation-invariant neural networks","venue":null,"work_id":"f556cfb2-7dce-47f8-b8b3-c50a6587aab4","year":2019},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.028023Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:04890f561c7484d9eb4f1b765f997727a120e3cf16455d09406a0218a13f39d9","observation_id":"def9fba6-91ba-4c11-acbb-bdb14e4c8d72","resolution":{"observed_at":"2026-08-06T22:03:45.916232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:45.480167Z","title":"Approximating revenue-maximizing combi- natorial auctions","venue":null,"work_id":"dfc31c8e-2bcc-47e3-8c80-94129852ecb8","year":2005},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.081299Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f1933c9696af9e4d051a5d279aac479becd54085daee70017d3e7b7e0ac4a619","observation_id":"189d8397-9c54-440c-80d6-452f0a2f6dcf","resolution":{"observed_at":"2026-08-06T22:03:45.606448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:45.183013Z","title":"Bundling as an optimal selling mechanism for a multiple-good monopolist","venue":null,"work_id":"d2326d77-d27d-4fd2-b789-5276e0df6722","year":2006},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.157008Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:4b1ef62fc39aa3db9b0ba6230ddb735a4bdc6c17a68bdd206386cda8ab9e78f9","observation_id":"9c840a5e-5613-4f26-adda-3703ae0cf455","resolution":{"observed_at":"2026-08-06T22:03:45.356308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:44.880523Z","title":"Microeconomic theory","venue":null,"work_id":"8d639aa7-4498-4809-8e17-8420d9fc03b7","year":1995},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.236568Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:1108c7ad8b5d86cac55d85acce768c5b4a2af0c17517396da56035f71c4dbc9f","observation_id":"3bac1c1f-ec92-4795-b0fe-9f625261225a","resolution":{"observed_at":"2026-08-06T22:03:45.061301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:44.465591Z","title":"The maximum numbers of faces of a convex polytope","venue":null,"work_id":"ff9c132e-a86c-45bb-b1d1-4eb364e0a80d","year":1970},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.327173Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:78a6f6a69510381ff383770bec39b0cd16451960f7dd5fd523232c9f21eaee98","observation_id":"dabb16a4-eaf4-4589-b730-b4d29409548a","resolution":{"observed_at":"2026-08-06T22:03:44.643715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:44.123305Z","title":"Equation of state calculations by fast computing machines","venue":null,"work_id":"deea7841-46ed-4aeb-ae8a-0f134311428d","year":1953},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.414799Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:ba928520026b4a9c03e08812e5cb92428012ff330cac15b917ffba7005468aa3","observation_id":"0cd149c2-179c-4d44-9637-867c465d9bf9","resolution":{"observed_at":"2026-08-06T22:03:44.336076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:43.868529Z","title":"Envelope theorems for arbitrary choice sets","venue":null,"work_id":"bfa71969-c008-4abf-a7f4-fb749ee38fbf","year":2002},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.512515Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:12dfc00629e41403f5a017b518fd08510e7f18ef694c918f6fdfeb9264ebae53","observation_id":"e8c13b39-5543-46f1-b6b7-529825804047","resolution":{"observed_at":"2026-08-06T22:03:43.988280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:43.557589Z","title":"A theory of auctions and competitive bidding","venue":null,"work_id":"1fbf6ba2-8532-4bde-ba7c-3bc180cd4106","year":1982},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.598799Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:efee7eb89b45425b1905304a3aef454e48c14b29be8122089d8578d6c6f555b6","observation_id":"b17486ce-7d8f-4ce7-bc77-89b29dbb995b","resolution":{"observed_at":"2026-08-06T22:03:43.707633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:43.178741Z","title":"On strategy-proofness and single peakedness","venue":null,"work_id":"c77ab6f5-5a81-4b20-9368-3de2fc0a98e2","year":1980},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.732090Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:b2f2fede614a65ba0b1356cb12e9c636c4745b2e66fe3e5abdb11a057be99c16","observation_id":"148936be-4ad2-4267-9c81-c8221ea77ed9","resolution":{"observed_at":"2026-08-06T22:03:43.365450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:42.834683Z","title":"Incentive compatibility and the bargaining problem","venue":null,"work_id":"21e558a3-9003-47d5-9e84-c1388beff4cc","year":1979},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.832642Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f9f308b5ca54abf61fe9e98ec707491a46974789f312040148320dfae3173155","observation_id":"58fa8d15-8c99-4df3-87d2-03f4913cc44b","resolution":{"observed_at":"2026-08-06T22:03:42.996823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:42.571956Z","title":"Optimal auction design","venue":null,"work_id":"e9d6fad4-ca5e-4839-b377-4d88165c2546","year":1981},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.916118Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:45257d9483676ca9665e6c5c7df9a890b448f3700b343f34a1ec498cd0e07eec","observation_id":"57ca2496-7631-4420-b933-b92d5a39b709","resolution":{"observed_at":"2026-08-06T22:03:42.688261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:42.269023Z","title":"Automated mech- anism design without money via machine learning","venue":null,"work_id":"bb32f98c-9ac3-45c9-943c-04f91221b57e","year":2016},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:25.996076Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:2669f7bf7f196d22a2021eca9ba07b555052331166203736555712233db10cfc","observation_id":"f2b62b12-b57e-47c7-830a-277b7ff65739","resolution":{"observed_at":"2026-08-06T22:03:42.454373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:41.960114Z","title":"Affine maximizers in domains with selfish valuations","venue":null,"work_id":"cbdf8ff3-2f58-48e2-a028-d664a6227afd","year":2015},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.076449Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:73648298237c202c615a5055f90604e9b96e63fe527d4482ba768e1161053efa","observation_id":"9674d893-5d9d-43dd-8d93-c6757ff486d7","resolution":{"observed_at":"2026-08-06T22:03:42.091491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:41.637994Z","title":"Sur une g´ en´ eralisation des int´ egrales de MJ Radon","venue":null,"work_id":"4b2edcb1-c26d-483e-b290-3ad8204bdb64","year":1930},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.185405Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:f71225bd1f25d310bbda1346c1f21d951891d251533540e73993efcabd80f074","observation_id":"dc29035f-6744-45f0-9f23-49ba1daf3d17","resolution":{"observed_at":"2026-08-06T22:03:41.773789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:41.387550Z","title":"Algorithmic Game Theory","venue":null,"work_id":"5e6c6a13-51a3-42da-ab65-ac2a8976afd1","year":2007},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.267657Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:b8addff8fc622b509a334d65b9a831f2ea6eeab214bce0f8cc00ed13a006900d","observation_id":"886d0fed-c6d9-41f4-8abf-cbd2ed2e02e6","resolution":{"observed_at":"2026-08-06T22:03:41.505796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:41.140251Z","title":"Optimal mechanism for selling two goods","venue":null,"work_id":"cab245e4-c611-42d0-ae98-e041e7f68b99","year":2011},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.353455Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:ad67b16c12b4121a17af89060dad5a356b6cb7c3585b8d71e5ee51017c1479af","observation_id":"584dfe81-c43c-4761-9d89-371c69d6dab0","resolution":{"observed_at":"2026-08-06T22:03:41.250654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:40.828075Z","title":"Preferencenet: Encoding human preferences in auction design with deep learning","venue":null,"work_id":"2ecca6ce-f237-4f90-9dee-af8b3913d245","year":2021},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.426354Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:43fd86125ac3396bbad013091e1d76219841edace1edfa499fb2c172cb81aa0a","observation_id":"4ade873e-8565-4a46-8267-555bbb49dee5","resolution":{"observed_at":"2026-08-06T22:03:40.960148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:40.552501Z","title":"Why and when can deep-but not shallow-networks avoid the curse of dimensionality: a review","venue":null,"work_id":"f5248d59-fdb8-4b49-94d3-838669e33fbf","year":2017},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.541082Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:3c013d8943112e79daf330f919de9b3b96354f06c26fbdc9a2ef6d08c477d0a1","observation_id":"8f190efa-73b7-485b-9f5a-9aee51abc9f1","resolution":{"observed_at":"2026-08-06T22:03:40.680453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:40.235524Z","title":"Benefits of permutation-equivariance in auction mechanisms","venue":null,"work_id":"d1fc258a-c5a6-49ce-bd60-af9bf765102f","year":2022},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.623014Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:1099558fcdd9aa5143e7b431156365bb1c80aeb1511ce18ef879a71475e75de6","observation_id":"250766bd-ad59-429f-a75a-a76cbf2c58ef","resolution":{"observed_at":"2026-08-06T22:03:40.393667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05684","last_updated":"2021-10-25T15:45:41Z","snapshot_observed_at":"2026-08-10T16:20:42.667216Z","submitted_at":"2020-06-10T06:45:20Z","title":"Auction learning as a two-player game","version":4},"cited_work":{"arxiv_id":"2006.05684","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.05684","snapshot_observed_at":"2026-08-06T22:03:31.388053Z","title":"Auction learning as a two-player game","venue":"cs.GT","work_id":"acd95252-6a05-49fe-b26b-7ee8085b4d3e","year":2020},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.709583Z"},"links":{"cited_paper":"/paper/2006.05684","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:a5afeb519a565fab19d83c0189901b1d76a78626e07315b99160eebf3ff3db34","observation_id":"e6e161fe-97aa-4d86-93a2-98695f067020","resolution":{"observed_at":"2026-08-06T22:03:31.531506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:40.003212Z","title":"Auction Learning as a Two-Player Game","venue":null,"work_id":"faa8a012-1598-4637-96b0-621c9e1ff457","year":2021},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.805352Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:7e3419d4406f31ee9adbff29d2a19c3e9d9dc486688f375d4d9df897d23de77c","observation_id":"a0ce2fd4-f2b8-4ae2-a153-8258c0f7feb3","resolution":{"observed_at":"2026-08-06T22:03:40.116497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:39.596895Z","title":"A permutation-equivariant neural network architecture for auction de- sign","venue":null,"work_id":"c8d7468d-936f-4577-bb05-87bf93911bde","year":2021},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:26.922879Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:66eb6047d1d673273f24ef216c881682cb29ee2c8ed92f8e185e320b8f70e91e","observation_id":"facaccac-745d-49ea-8e6b-e1271ad372ca","resolution":{"observed_at":"2026-08-06T22:03:39.764959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03427","last_updated":"2023-11-15T00:01:54Z","snapshot_observed_at":"2026-08-07T06:56:26.567027Z","submitted_at":"2021-07-07T18:22:11Z","title":"Deep Learning for Two-Sided Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03427","snapshot_observed_at":"2026-08-06T22:03:27.031927Z","title":"Deep learning for two-sided matching","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:27.031927Z"},"links":{"cited_paper":"/paper/2107.03427","citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:224f79b8dd6548b6a0250ba206a64931d40632234bd8fc6993fa5caef0b70d25","observation_id":"65e9af19-9bff-4393-8d4d-8560418118eb","resolution":{"observed_at":"2026-08-06T22:03:27.031927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:39.289237Z","title":"url: https : / / www","venue":null,"work_id":"8227eb2a-652e-4a71-a140-773c9227bd55","year":2025},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:27.126296Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:9681f90b05de306d1a2874ca2ea6c1de76ee5868879073b95f6a52aae44199cf","observation_id":"599a11f6-2c2b-4caa-a647-cb7e23cee919","resolution":{"observed_at":"2026-08-06T22:03:39.412386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:03:39.025351Z","title":"Exponential convergence of Langevin distribu- tions and their discrete approximations","venue":null,"work_id":"624522ad-5bcc-419c-81e0-57f383647cf8","year":1996},"citing_paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-06T22:03:27.213453Z"},"links":{"citing_paper":"/paper/2506.22911"},"observation_digest":"sha256:13028d789cd7446c327c5d31fb26fc25e3b6cd41e41f0453af9024b0f30daf03","observation_id":"54e00091-90d5-43f5-ae17-08c186330608","resolution":{"observed_at":"2026-08-06T22:03:39.156536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22911","last_updated":"2025-06-28T14:50:29Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-10T14:52:30.599827Z","submitted_at":"2025-06-28T14:50:29Z","title":"Learning Truthful Mechanisms without Discretization"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":61,"verified_exact":2,"verified_fuzzy":36},"total_outbound_references":136},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 136 outbound references and 0 inbound Pith citation observations for arXiv:2506.22911."}