{"as_of":"2026-08-20T18:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98f636765a7e0d1d9ead32e5e8daf4bbb5a32a31e525bc64fff6687b4665018a","coverage":[{"denominator":84,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":84,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:27:20.105728Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:03:20.716950Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T04:55:56.198677Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","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-16T15:11:59.169505Z","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:91514ce13e9b04cef5cd85543066f9b5b1168842ade8644a9ee8f6e68d72ea6e","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":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"cited_work":{"arxiv_id":"2411.13513","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.13513","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.13513 , year=","venue":null,"work_id":"6b43b662-e0d7-4ea7-92a5-7d16b6c2913a","year":null},"citing_paper":{"arxiv_id":"2605.06711","last_updated":"2026-05-06T22:12:46Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-06T22:12:46Z","title":"Pricing, Matching, and Bundling: an Equilibrium Analysis of Online Platforms","version":1},"reference_index":207,"source":"arxiv_source","source_observed_at":"2026-05-11T01:00:26.562282Z"},"links":{"cited_paper":"/paper/2411.13513","citing_paper":"/paper/2605.06711"},"observation_digest":"sha256:02666157837821ba995b905f8d8d9616077a63521f9f6c7e65b484fe9b5ce617","observation_id":"ba511367-7c89-4dd3-a6ce-c0fc36e0a8b7","resolution":{"observed_at":"2026-05-11T04:55:56.202582Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.13513/citation-record","integrity":"/paper/2411.13513/integrity","json":"/paper/2411.13513/citation-record.json","paper":"/paper/2411.13513"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:27:19.739735Z","title":"Budget-feasible mechanism design for non- monotone submodular objectives: Offline and online","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.739735Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:e744e3c03e784561d7adcc3fc371ec54b0f312b93d19dafd5da7f23394be6707","observation_id":"cfda2087-c529-4e9c-9b9b-09c481c9cf58","resolution":{"observed_at":"2026-08-12T16:27:19.739735Z","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-12T16:27:19.744791Z","title":"Mechanism design for crowdsourcing: An optimal 1- 1/e competitive budget-feasible mechanism for large markets","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.744791Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:bb9dabf4137621fac1c99dd1cd417df12658fce1035c800b576bb833ea17220c","observation_id":"dc3a5b86-1aa9-4f07-bd46-5f165e763b14","resolution":{"observed_at":"2026-08-12T16:27:19.744791Z","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-12T16:27:19.749376Z","title":"Frugal path mechanisms.ACM Transactions on Algorithms (TALG), 3(1):1–22, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.749376Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:d9890adceebfeb886f5b6be5a895eb5418116b4dda856e1c84fbf13bc61ebf4b","observation_id":"fc447c2d-5d4f-47d7-95ad-f7d99ca70d4f","resolution":{"observed_at":"2026-08-12T16:27:19.749376Z","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-12T16:27:19.754027Z","title":"Deterministic budget-feasible clock auctions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.754027Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:ba90180a384f663216f2a5b397d6ff78b542d5abc08d3cb458619602fd850223","observation_id":"20995da9-42e0-42aa-ba2f-5df2e2b3f259","resolution":{"observed_at":"2026-08-12T16:27:19.754027Z","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-12T16:27:21.267663Z","title":"Bayesian Incentive Compatibility via Fractional Assignments","venue":null,"work_id":"0c0f6b8c-d147-4144-9488-4577fde111e8","year":2011},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.758602Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:0780ce98f784e4ca4f7b7ea685f0102c04ba40fc37c2a1f7a7e4e4b8b0bcae8b","observation_id":"bddea676-1df9-44c5-8092-91dad0d4c627","resolution":{"observed_at":"2026-08-12T16:27:21.272719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.253913Z","title":"Budget feasible mechanism design: from prior-free to bayesian","venue":null,"work_id":"67088375-dca5-4151-bb50-c99a42993e3f","year":2012},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.762998Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:fee57072393319b56bf5eba1ae63310496b5d442853e1b55b8d5ff96ebe7036f","observation_id":"af5d73f3-ca36-4461-b502-27dd51a4edd8","resolution":{"observed_at":"2026-08-12T16:27:21.258584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.239634Z","title":"Worst-case mechanism design via bayesian analysis","venue":null,"work_id":"e4c34116-f535-4059-b7e1-6055389da36f","year":2017},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.767947Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:c2f187303e09515a513ee7ea89f1b445debb2600c7f41cb7b5183020eab0210c","observation_id":"912a3663-3049-418f-ae07-e98bbb1e4d31","resolution":{"observed_at":"2026-08-12T16:27:21.244290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.225729Z","title":"Industrial procurement auctions","venue":null,"work_id":"18cc0b09-8d10-4f6d-9c4e-6a62bc410bdb","year":2006},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.772277Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a951f3943a58b0fdc65ff2460e18201b71db104d7b116cfcd180cfbe1e9d9eee","observation_id":"a9f2a05b-3934-47fb-86aa-d3d27dbdb11f","resolution":{"observed_at":"2026-08-12T16:27:21.229980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.212024Z","title":"(almost) efficient mechanisms for bilateral trading.Games and Economic Behavior, 130:369–383, 2021","venue":null,"work_id":"dfc29542-94fc-4d71-a500-f07662590002","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.776816Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:36c1f48b1e64d9bfa5a2bfe551e74962fe0bff0f140c852903df6e072304ed38","observation_id":"1b72bc9f-7b22-4642-8e7a-c1ce7df93fd8","resolution":{"observed_at":"2026-08-12T16:27:21.216519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.198072Z","title":"Approximating gains-from-trade in bilateral trading","venue":null,"work_id":"02ac08c5-8385-4172-8a80-e9c6a8ef0fa1","year":2016},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.781152Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:737e2c495f534a209abf3c8e7a8cc51e811c8657bea83e6886ff40fcae6200ec","observation_id":"16963dc4-fc71-4800-9ef9-c2bf9a0ac0c2","resolution":{"observed_at":"2026-08-12T16:27:21.202631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.183670Z","title":"Approximating gains from trade in two-sided markets via simple mechanisms","venue":null,"work_id":"da6967b9-7b9f-4dd6-b785-5aa1689569d9","year":2017},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.785545Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:3bc7cb6631b08d3108dda94afbadb1eb12b7a1203e559e51ffde503a9cd997b4","observation_id":"be573ae8-bb82-4af8-abce-9b266156de59","resolution":{"observed_at":"2026-08-12T16:27:21.188348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.170113Z","title":"Government procurement solutions, 2024","venue":null,"work_id":"3cc5821b-99ed-46db-a369-d1f5bc517807","year":2024},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.789943Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:88717d064b3f172d3ae2fe73b2e850db0fa0c36c4499acd11736a37690b986b3","observation_id":"9f7a13cd-b318-4865-85b5-e1a9de5fca2b","resolution":{"observed_at":"2026-08-12T16:27:21.174354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.155890Z","title":"An algorithmic characterization of multi-dimensional mechanisms","venue":null,"work_id":"478691e9-fb21-416f-8dcb-080101a57fc0","year":2012},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.794112Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:432141d1eca34099e78c7da3438ec67bea846a11be70c217f3c74a2bd68621bc","observation_id":"c90c46c4-5666-4cb5-9081-66f5b8d5beb2","resolution":{"observed_at":"2026-08-12T16:27:21.160709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.142034Z","title":"Optimalmulti-dimensionalmechanism design: Reducing revenue to welfare maximization","venue":null,"work_id":"0291c43f-c8d0-486b-a0ed-cb05c3d88c33","year":2012},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.798512Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a375885d1d80721fc4b1cfc2e756bbf23e2f2441220441e11644dc9b681dbfd7","observation_id":"33b9e0e5-217a-4dad-ab16-ec691154cbd9","resolution":{"observed_at":"2026-08-12T16:27:21.146635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.127809Z","title":"Reducing revenue to welfare maximization: Approximation algorithms and other generalizations","venue":null,"work_id":"f5249c0a-9469-4f16-8740-94e3ae7fbed8","year":2013},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.803104Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:e95a850d6708d8d1d6c96c11d970f071d6955b7d633e97020752bb9fe4ed49ef","observation_id":"a39ddc35-96b3-44b7-9cd5-44d7f670d322","resolution":{"observed_at":"2026-08-12T16:27:21.132490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.113682Z","title":"Understanding incentives: Mechanism designbecomesalgorithmdesign","venue":null,"work_id":"24688aef-edf6-4ddb-a466-ff9be7141baf","year":2013},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.807442Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:be400fd8ade66c59c32b495338d518a96cea3494c949cb5f15b2fe1d75c31878","observation_id":"b28c4389-087c-47f1-9c5a-808b33a8e0e0","resolution":{"observed_at":"2026-08-12T16:27:21.118192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.100162Z","title":"On multi-dimensional gains from trade maximization","venue":null,"work_id":"7ff669a1-c553-47b4-9484-18e9f474a4ec","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.811759Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:b8eec837806b6cb619f166c29e9d9987e6284c0ad6089747388cec79fdf5cff2","observation_id":"503086f9-0035-4ce8-90b8-5fc5ee96b173","resolution":{"observed_at":"2026-08-12T16:27:21.104546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.086552Z","title":"Auctions for structured procurement","venue":null,"work_id":"a8af9b2e-ec97-48e2-b294-383f3a1589ec","year":2008},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.816220Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:b790b49f7652ea6ce20597c47870bfd8201b9494b7c21723ba00e66c02d4fdcc","observation_id":"192a17d2-edcf-41f2-b3d7-43dfe6d08349","resolution":{"observed_at":"2026-08-12T16:27:21.090899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.071756Z","title":"On the limits of black-box reductions in mechanism design","venue":null,"work_id":"39eb588b-75ad-41b4-bafd-05fd711af2db","year":2012},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.820692Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:60962513ef04c730ca31db75123eadade4349803a1e4fa8d7c21d9dfa99e92d5","observation_id":"28ef63da-e2e5-4aa7-938b-16f2625b4ad2","resolution":{"observed_at":"2026-08-12T16:27:21.076433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.057816Z","title":"On the approximability of budget feasible mechanisms","venue":null,"work_id":"d021e2bb-96f7-4fc2-b089-d4cab6335316","year":2011},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.824803Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:828b0f3efb20ee14c2f925952d5ac00cb029d13b4a035ce44404403eccf975f7","observation_id":"49de3d76-06d8-4f08-8d4d-d4b38d6518d0","resolution":{"observed_at":"2026-08-12T16:27:21.062441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.043606Z","title":"Multipart pricing of public goods.Public choice, 11(1):17–33, 1971","venue":null,"work_id":"1e2c1084-8324-4d5b-9fd8-e2b0b3df0c44","year":1971},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.829160Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:dd175ec0d20e0269fb0ca16744ced5d53ab844b6ce5588a66d5f332ba96299c8","observation_id":"072346fb-f94b-47f0-80a7-5fda85e90486","resolution":{"observed_at":"2026-08-12T16:27:21.048498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.029583Z","title":"Approximately efficient double auctions with strong budget balance","venue":null,"work_id":"7638045f-b774-4fec-8587-d74877f14376","year":2016},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.833536Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:8500a69e4548a4ab3ace8c9775c7cd0727c4b45e57830f8d61419b6c895aa9b2","observation_id":"ff63dab7-48ce-4726-a88e-a692a0a06940","resolution":{"observed_at":"2026-08-12T16:27:21.034085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.016262Z","title":"Approximately efficient two-sided combinatorial auctions.ACM Transactions on Economics and Computation (TEAC), 8(1):1–29, 2020","venue":null,"work_id":"700543e5-fbf5-4b8b-8d56-40e45d6a7b87","year":2020},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.837760Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:9414514df16a9705101927a88465912416c2c42313e34dc2251863651ef852b9","observation_id":"e965251b-a068-49dd-a869-5f13788f47e5","resolution":{"observed_at":"2026-08-12T16:27:21.020513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:21.002337Z","title":"Approximately efficient bilateral trade","venue":null,"work_id":"08671e6e-2581-48d6-af49-4e4ac0f472fe","year":2022},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.842070Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:57ee73ff54a92aaa35bf2276839dbb7aa9b251c7e53942a7483a673ce06be726","observation_id":"6d442f33-fda2-45d0-9cf4-a28d8a4c18f1","resolution":{"observed_at":"2026-08-12T16:27:21.006904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.988321Z","title":"Cambridge University Press, 2006","venue":null,"work_id":"75d90a51-1133-40b8-af1c-745d9832ab7c","year":2006},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.846449Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a00acc434dabc9f7f1fa1f458e20ba0cc5e64b6b4da8b4839a6e31c82ab39feb","observation_id":"60ab939d-7a7d-4d42-bf6e-a5c7bcb0e93c","resolution":{"observed_at":"2026-08-12T16:27:20.992982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.974742Z","title":"Mechanisms for complement-free procurement","venue":null,"work_id":"257b04cb-f16f-4f5b-af63-5bfed901d44c","year":2011},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.850639Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:1de57f848e00bebe57edb39c8d9636da3c34c65e426f0a68072d5766ff3577a3","observation_id":"aadedcd7-eb28-4f6e-99ff-00cbfeba9305","resolution":{"observed_at":"2026-08-12T16:27:20.979170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.960716Z","title":"Bernoulli factories and black-box reductions in mechanism design","venue":null,"work_id":"cdd76121-540a-4035-95d9-181d3370a14c","year":2017},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.854937Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:8caefb2261277fa49aba8b1d3e79b3085555d7ded68d28decf82c7c8b6b1f13c","observation_id":"bc758076-26b3-4010-80b9-99bb0746f91c","resolution":{"observed_at":"2026-08-12T16:27:20.965287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.945819Z","title":"Optimal and differen- tially private data acquisition: Central and local mechanisms.Operations Research, 2023","venue":null,"work_id":"6f8f2da0-f70e-4f67-8395-a37e7a54b9e1","year":2023},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.859344Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:b735cd1230585cf62879e91524c30389431ba0a9fc74b116e50cac1a5a0e5760","observation_id":"fcab7727-5a9a-4d15-982d-61da7c6700d7","resolution":{"observed_at":"2026-08-12T16:27:20.951416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.931003Z","title":"Improved approximation to first-best gains-from-trade","venue":null,"work_id":"8b07d4d3-a941-42fe-bbca-818eb207cc8b","year":2022},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.863566Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:8014ab3f4bde4e8b0e02cd6874e035a4b00264f5e1368cf04c24660bff1f716f","observation_id":"0e57861f-de54-4106-a9a7-7352c5814fea","resolution":{"observed_at":"2026-08-12T16:27:20.936117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.917234Z","title":"A combinatorial allocation mechanism with penalties for banner advertising","venue":null,"work_id":"b5fec19f-ba98-461d-a8e8-eea37d130c0e","year":2008},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.867621Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:9ed479f93d8056f547c68b4210de1c4eca88a765e000a5dbe0c3285b07b7940c","observation_id":"89f834d3-921f-47eb-b11d-e8181fa08182","resolution":{"observed_at":"2026-08-12T16:27:20.921697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.903033Z","title":"A threshold of ln n for approximating set cover.Journal of the ACM (JACM), 45(4): 634–652, 1998","venue":null,"work_id":"714734d3-4f69-49d4-9e85-7977db0e28eb","year":1998},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.871936Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:265086c287e07153280fae627d62680dd100754405d98a64ac60819844c4b1f8","observation_id":"1e4d7888-79a0-44b2-8a12-54fb28b31c0b","resolution":{"observed_at":"2026-08-12T16:27:20.907667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.888311Z","title":"Maximizing non-monotone submodular functions","venue":null,"work_id":"909fe2b0-77a6-4166-8deb-90b1c9a00f14","year":2011},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.876244Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:9006448c994fab19a9fa46a9f4c5a48d6bbbe4f617e7f1032650ab4547731598","observation_id":"07d5fc9a-5542-431e-bf62-0528ee810e30","resolution":{"observed_at":"2026-08-12T16:27:20.893002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.872797Z","title":"Pass approximation: A framework for analyzing and designing heuristics.Algorithmica, 66:450–478, 2013","venue":null,"work_id":"2ca3280b-1c65-4672-9d5f-0444a1d95189","year":2013},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.880585Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:0d4e50775071e48c8ace27d9ff86ff0395e1520f104b63a6b8633f5222e15c88","observation_id":"eb676fdb-fe1d-4e70-a8fe-fca7df346577","resolution":{"observed_at":"2026-08-12T16:27:20.878034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.857196Z","title":"Guess free maximization of submodular and linear sums.Algorithmica, 83(3): 853–878, 2021","venue":null,"work_id":"d76ca006-24fe-4738-9e40-c3e04a398d2a","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.884947Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:d6d08660499e189a36e519a530ac0663ef84f22b2de3ea35502570ce5f7fe7bc","observation_id":"85656f6c-5a3e-48b4-9715-09d08cda6029","resolution":{"observed_at":"2026-08-12T16:27:20.862055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.842358Z","title":"Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding","venue":null,"work_id":"70a2483a-8767-4af9-9f0d-965412fe2e50","year":2012},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.889411Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:b12f3144b7694b705f6446f2a4ca5fcdfc607c56aa082fba7648b8eb6e1fd166","observation_id":"635b7c44-4929-4ef2-b0ad-b30e6e177a51","resolution":{"observed_at":"2026-08-12T16:27:20.847102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.827534Z","title":"Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise","venue":null,"work_id":"29662f26-b380-4bee-92b6-0a6b4b09d5f6","year":2022},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.893926Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:1c97dfc2ac7532f16cf874f6ab9cc268456b71f6daa89d7bc32cc81b729546cc","observation_id":"382bb432-8760-45dc-ad39-56a828b52ac0","resolution":{"observed_at":"2026-08-12T16:27:20.832461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.812211Z","title":"A multi-pass streaming algorithm for regularized submodular maximization","venue":null,"work_id":"2c26b3e3-3e45-4897-bcf5-6d3f8141c155","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.898899Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:ce96014ea3b20cb6376d75c1b7c69870634c99d97e7209d458f1b946d4de58c5","observation_id":"4757f3fb-8a55-446e-9907-39a68f36aa51","resolution":{"observed_at":"2026-08-12T16:27:20.817594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.796997Z","title":"Algorithms for maximizing monotone submodular function minus modular function under noise.Journal of Combinatorial Optimization, 45(4):96, 2023","venue":null,"work_id":"7e036ce1-c642-4feb-98b1-d58bf76c554c","year":2023},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.903174Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:bcfcd37c8b93c9ee113c74907e0486e97ac8629dfcd3b36fb364881246930c29","observation_id":"a918a21c-2693-4e68-88db-07fef858f648","resolution":{"observed_at":"2026-08-12T16:27:20.802233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:19.907293Z","title":"Incentives in teams.Econometrica: Journal of the Econometric Society, pages 617–631, 1973","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.907293Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:3179f784f0624bd714399ab666376223dedebba6f2f8b9c8b32d3f45f8424b9e","observation_id":"7e51d944-f1c2-4ed4-8031-9dfc01d43584","resolution":{"observed_at":"2026-08-12T16:27:19.907293Z","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-12T16:27:20.772910Z","title":"Triple eagle: Simple, fast and practical budget-feasible mechanisms","venue":null,"work_id":"b66db450-efbc-4abd-97ea-a82920ed3b2c","year":2024},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.911425Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:4c7d64f5f18ef090ecfcef1ef9918c9cb86d157bead1c57880e7924b795f4932","observation_id":"3cf1f211-475e-4583-b149-173362955c97","resolution":{"observed_at":"2026-08-12T16:27:20.777645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.759004Z","title":"Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications","venue":null,"work_id":"16ab7438-ebad-4fe9-982d-4f4ac976e19e","year":2019},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.915559Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a616bc6481125b68396785353114a0600f5b22b791cb1715f26b3a68a8bd8211","observation_id":"111cf3b5-3921-43ac-9dfa-794107025838","resolution":{"observed_at":"2026-08-12T16:27:20.763564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.744773Z","title":"Bayesian incentive compatibility via matchings","venue":null,"work_id":"811f8e51-c856-4e4a-afa0-4083269d756d","year":2011},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.919744Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a1fcaf27c90e228526b2b01826b84fb1f86852695aa71852b02787edeb341fcd","observation_id":"d05878e1-6e25-4282-bbb3-7ebf2dbd0905","resolution":{"observed_at":"2026-08-12T16:27:20.749449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.730298Z","title":"Hartline and Brendan Lucier","venue":null,"work_id":"0d0c2514-38cd-490a-b239-1cb5b39d5179","year":2010},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.923883Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:06a52b81f355f152aa472a5ad3e4da33bf997c9d1d986df7dfa2d1576374a7c1","observation_id":"76bb0db7-7272-477b-9ac8-526ba8e814c8","resolution":{"observed_at":"2026-08-12T16:27:20.734913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.716162Z","title":"Bayesian incentive compatibility via matchings","venue":null,"work_id":"67e11348-21c3-4ca6-8afd-2a597e250792","year":2015},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.928279Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a84be7b75a4b4340d3c882e7667d4bf3dcdd624d8335dcf40fbc9ca10a7c87da","observation_id":"a74b1ae4-7330-4ab1-956c-1f2824a0493f","resolution":{"observed_at":"2026-08-12T16:27:20.720925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.701476Z","title":"Maximization of approximately submodular functions.Advances in neural information processing systems, 29, 2016","venue":null,"work_id":"f9c642ee-bf5f-4876-8038-bda47b111097","year":2016},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.932579Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:8d60dc027b300565191a1839ff6f7c6b881ca940208bc2bc2266da429cfc0939","observation_id":"29bf4968-c41b-4736-aae9-aa190cada6c0","resolution":{"observed_at":"2026-08-12T16:27:20.706515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.687023Z","title":"Simple and efficient budget feasible mechanisms for monotone submodular valuations","venue":null,"work_id":"8a344761-553f-408f-be29-3c2d797c6dcc","year":2018},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.936821Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:5f768d411d7d9c2b1c552c011091f3f2ab75774f305cdada138514d48294917c","observation_id":"6071620c-6c1c-4e80-abc8-d1e03fc822f0","resolution":{"observed_at":"2026-08-12T16:27:20.691948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.673143Z","title":"Unconstrained submodular maximization with modular costs: Tight approximation and application to profit maximization","venue":null,"work_id":"4ad6b3b0-f91b-4658-9083-fcc6060f53b9","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.941325Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:612e1a3f6d9a92876dcec7d3ac014eea07b87fbd834843e21fee6402d4188f7d","observation_id":"c089f70a-963d-4a6c-9dc9-cbe96515a13b","resolution":{"observed_at":"2026-08-12T16:27:20.677813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.659530Z","title":"Beyond vcg: Frugality of truthful mechanisms","venue":null,"work_id":"aeb6737c-6a65-4683-a4c8-2ac487df7575","year":2005},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.945623Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:a2b77ce81d2ea5fc05bd1acf949c474f6af001fd39b4f9adbd95a5cc47ac5e9d","observation_id":"d2cc6ff8-792d-4314-ba48-7e47d1135fd5","resolution":{"observed_at":"2026-08-12T16:27:20.663962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.645712Z","title":"Regularized submodular maximization at scale","venue":null,"work_id":"3cc98168-39e7-46de-8b82-16fab0d39c8f","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.949914Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:2bfc64100d664eb1c5c5ebe5f6e05bd13a6fc522ce7720979c9bf1b442be9cb3","observation_id":"bb92b314-ac13-45bd-87a1-732cc1feb0a1","resolution":{"observed_at":"2026-08-12T16:27:20.650531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.631634Z","title":"Job matching, coalition formation, and gross substitutes","venue":null,"work_id":"fee24183-e2f6-4be8-8c77-813d7584a80b","year":1982},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.954379Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:8853050272708f5f6dc751925c0eb4ddc5c123491ac788d5ffba8e7103d77d35","observation_id":"a383b3ce-4b34-4b89-b439-70610d7f278f","resolution":{"observed_at":"2026-08-12T16:27:20.636211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.617564Z","title":"Frugal and truthful auctions for vertex covers, flows and cuts","venue":null,"work_id":"3c5e23c9-3b7a-42f9-a87c-f65d7ecebeee","year":2010},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.958748Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:36b0bc8d5d4299368c8120e97742e245581f66dfb271828d7a010da9c0906da3","observation_id":"43ba7fae-7abf-46a5-bded-f986314d84f0","resolution":{"observed_at":"2026-08-12T16:27:20.622157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.603508Z","title":"Segmentation problems.Journal of the ACM (JACM), 51(2):263–280, 2004","venue":null,"work_id":"7318a65a-6392-4313-b0a9-b6f723990db9","year":2004},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.963656Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:0e12722a89314238d9aed4673a97acfdbc6af432d93b50376720e500f584976c","observation_id":"20da651f-ec3e-4378-9c7f-4d8ade84c2ae","resolution":{"observed_at":"2026-08-12T16:27:20.608066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.588716Z","title":"Combinatorial auctions with decreasing marginal utilities","venue":null,"work_id":"9babeb8d-d32d-41b8-8d17-0a870af62b3c","year":2001},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.967984Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:d316ac314501d42eeb5c727f5f2b59d4c48a33d1a78d1ec07466a7170440cad7","observation_id":"bbf89ba3-9bf0-43be-a336-55740a9c6d62","resolution":{"observed_at":"2026-08-12T16:27:20.593779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.573059Z","title":"Obviously strategy-proof mechanisms.American Economic Review, 107(11):3257–3287, 2017","venue":null,"work_id":"b5311b00-dc4b-4c97-8be4-f0034614b19d","year":2017},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.972378Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:2fc5d45c06c1fdc464eb9d687ab829aebab76785f0b38d7dfbc77b2502175a56","observation_id":"b3f98c59-f16f-4961-843a-3669065be5eb","resolution":{"observed_at":"2026-08-12T16:27:20.578574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.558283Z","title":"Regularized nonmonotone submodular maximization","venue":null,"work_id":"40874ddc-5010-4b89-b28e-db0062082ccd","year":2023},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.976555Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:ea3cb113ea0dbdf3bed5e5b656847f1c0ee4a7ee76a95e485062a1ec612e7e6d","observation_id":"44fe4cce-08b1-4324-9781-a783d2eb1031","resolution":{"observed_at":"2026-08-12T16:27:20.562845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.544036Z","title":"Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions.Optimization Letters, pages 1–25, 2023","venue":null,"work_id":"e68c6a98-28aa-4f9a-bf0b-e13f8717946d","year":2023},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.981152Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:ad5044892703a2cfdbdf80fb9d83d498a3aa57326b7036e38d4856b0157e3ae4","observation_id":"2e110c00-f9ea-4f63-81aa-17690a878e0d","resolution":{"observed_at":"2026-08-12T16:27:20.548726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.529861Z","title":"A dominant strategy double auction.Journal of economic Theory, 56(2):434–450, 1992","venue":null,"work_id":"c55399c0-509e-4a96-a2bd-d9fd319ec1fb","year":1992},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.985441Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:24b67dab84a73f06232b939eeb3f6157590a13bba6d3ffeeaa0ec18a719cbb87","observation_id":"4aeb1e97-bd41-480e-9eee-4e4f7a52afcb","resolution":{"observed_at":"2026-08-12T16:27:20.534456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.516102Z","title":"Accelerated greedy algorithms for maximizing submodular set functions","venue":null,"work_id":"a452d90d-2056-4e92-bd25-9d33959a41d9","year":1977},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.989962Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:6274a78582e788a996802e4fe2dc19de248bd0dc66e3a26877cee75ab3a6e41c","observation_id":"e6ed7939-403d-4400-8bef-51264673daaa","resolution":{"observed_at":"2026-08-12T16:27:20.520633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.501340Z","title":"Submodular+ concave.Advances in Neural Information Processing Systems, 34:11577–11591, 2021","venue":null,"work_id":"93d2d61d-c6bd-44f1-a190-0509a8f4a6b6","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.994044Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:2a667c55330620b973ab4acc1a4284864f8af00ac59f87b1b713731584a40cb5","observation_id":"137d6bd0-ad1b-48b8-8368-f8d93535f216","resolution":{"observed_at":"2026-08-12T16:27:20.506037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:19.998492Z","title":"Optimal auction design.Mathematics of operations research, 6(1):58–73, 1981","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:19.998492Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:d6a2b8e6579e34390566824e3ed11de538b1097217d3d116edd83701791e4c70","observation_id":"27c8bc28-55d1-40e5-af50-ac209bf6eeb8","resolution":{"observed_at":"2026-08-12T16:27:19.998492Z","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-12T16:27:20.477710Z","title":"Efficient mechanisms for bilateral trading.Journal of economic theory, 29(2):265–281, 1983","venue":null,"work_id":"245ea4d3-c389-4fcc-b5c0-b47910e3a5eb","year":1983},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.002834Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:4203111676b30a01a0e9388dce217995ed0e3bb173044f928e76e6efb089354e","observation_id":"aaf22045-8de9-4f2a-b51a-e35a483a1c84","resolution":{"observed_at":"2026-08-12T16:27:20.482749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.007093Z","title":"An analysis of approximations for maximizing submodular set functions—i.Mathematical programming, 14:265–294, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.007093Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:e5fe69721e6b4571ceb0b5dc27ada04f089617ca57852de7a08a0a49a95bb124","observation_id":"9f22f1d9-f157-4c5f-b9e0-695718471d64","resolution":{"observed_at":"2026-08-12T16:27:20.007093Z","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-12T16:27:20.455144Z","title":"An efficient framework for balancing submodularity and cost","venue":null,"work_id":"0dd81968-61c2-4ac1-8208-a6389fc7a417","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.011464Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:48c52ac882e1cdee52557003c271475fd23ca30f5577a7fa6267f05e67cb1fab","observation_id":"dc882e56-004c-457b-8050-ab49ec7eaad6","resolution":{"observed_at":"2026-08-12T16:27:20.459499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.441140Z","title":"Algorithmic mechanism design","venue":null,"work_id":"e0896656-1488-4760-975c-2d8f8599ed05","year":1999},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.016007Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:320d1310a4bb0c89c2657576b1ace158c4c88a72d05fac561dffa6f208afc9ca","observation_id":"5ee78cbe-3fd7-4ce7-a068-02b0e51a1423","resolution":{"observed_at":"2026-08-12T16:27:20.445649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.427285Z","title":"Government Publishing Office","venue":null,"work_id":"e928c19a-fd3c-4671-8380-8b4e864d8877","year":2024},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.020424Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:ad76911f4f48a12f2cbc18e54a170086cf7acb3f7110a73a1b060744772b9855","observation_id":"e26197ea-1e12-42a5-b7db-53134cb9da85","resolution":{"observed_at":"2026-08-12T16:27:20.431610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.413284Z","title":"Gross substitutability: An algorithmic survey.Games and Economic Behavior, 106:294–316, 2017","venue":null,"work_id":"ca80dd09-fdb8-4865-ad42-0ebdc8f04392","year":2017},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.024842Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:9dc91af7d0cfbde3e034f462143943dc49180c9d850f1e61a9c2a535bb0ef954","observation_id":"3f556942-d8de-47cc-89e3-2f75bdd9948c","resolution":{"observed_at":"2026-08-12T16:27:20.417903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.11967","last_updated":"2026-05-31T09:45:19Z","snapshot_observed_at":"2026-08-16T15:14:11.480942Z","submitted_at":"2023-07-22T02:59:28Z","title":"Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals","version":2},"cited_work":{"arxiv_id":"2307.11967","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.11967","snapshot_observed_at":"2026-08-12T16:27:20.185221Z","title":"Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals","venue":"cs.GT","work_id":"41e027c0-8a04-4798-b425-78bd1b721946","year":2023},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.029265Z"},"links":{"cited_paper":"/paper/2307.11967","citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:fc860ea432753a7b9d17f04e4be829e9c634399d1e1fcf9030255d16e59bac95","observation_id":"84a5d5aa-df36-4d1d-aefb-8fae398fbca0","resolution":{"observed_at":"2026-08-12T16:27:20.190263Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.399205Z","title":"Optimization, approximation, and complexity classes","venue":null,"work_id":"ed12c688-6a62-4341-af27-74392392c64b","year":1988},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.034210Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:6e19ad3b56213586bf187cbb81c4e7068a0b83f6d437f38a19e014993a1470e1","observation_id":"e894fc7a-c00a-49e7-8603-431f15939d02","resolution":{"observed_at":"2026-08-12T16:27:20.403685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.385332Z","title":"On maximizing sums of non-monotone submodular and linear functions.Algorithmica, pages 1–55, 2023","venue":null,"work_id":"5992adc7-8b53-4bea-b7de-73eac9d7b71c","year":2023},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.038667Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:56d672fa7553e4362ac8b5a18dbc62a3dceab84b9462772e23d29b2c181cdc82","observation_id":"58c3b278-0ee8-4295-be50-0299f6c1d519","resolution":{"observed_at":"2026-08-12T16:27:20.390117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.369833Z","title":"Conducting truthful surveys, cheaply","venue":null,"work_id":"e7b0e049-0bf9-4818-9527-1b3c895db3fc","year":2012},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.042968Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:96341a67e090076ef1dd1a5cc706b5ca8566a444347992792b5081f22e273abf","observation_id":"2e22370b-4806-47a1-82dc-b11d6199a810","resolution":{"observed_at":"2026-08-12T16:27:20.375386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.355204Z","title":"ingredients","venue":null,"work_id":"625d7337-9664-4a3c-abca-e2ca3dc0e24c","year":2022},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.047389Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:665c3b112f1df85f398fe45d4e52017c074160e14e36259a45e0c422c63f7467","observation_id":"2ea7d63c-679b-44d9-9a2d-91ca64940036","resolution":{"observed_at":"2026-08-12T16:27:20.359543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.341212Z","title":"Budget feasible mechanisms","venue":null,"work_id":"48397819-1e4b-464d-bf3b-d2b3901447bb","year":2010},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.051884Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:727580256eaec0cb94c2f3478cb0337fc28507210fe56f1f1b9dac474720e494","observation_id":"a8830ce4-40cd-4a13-bd23-a7cf76854d73","resolution":{"observed_at":"2026-08-12T16:27:20.345705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.326801Z","title":"Pricing mechanisms for crowdsourcing markets","venue":null,"work_id":"8ee88337-c2a6-4f34-8ad1-e622b535f169","year":2013},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.056185Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:e1855f41951d7205729e5b28f1f0f0c7eb66ddf16872bc66cc8455a77e9c320c","observation_id":"47fb4000-dea4-44d3-89db-9214b1651c38","resolution":{"observed_at":"2026-08-12T16:27:20.331392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.312630Z","title":"Optimal approximation for submodular and supermodular optimization with bounded curvature.Mathematics of Operations Research, 42(4): 1197–1218, 2017","venue":null,"work_id":"b69771c4-3727-42fe-a9c1-00b4ac836cfc","year":2017},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.060392Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:916048fc768bb45f9a9d1243f9e8e1c0a703c61f21cb0f85ebaa60ae2d723d32","observation_id":"751fc9a4-8389-4f58-a97b-d6939ed3013f","resolution":{"observed_at":"2026-08-12T16:27:20.317322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.297847Z","title":"The price of truth: Frugality in truthful mechanisms","venue":null,"work_id":"a54db7c6-eb8d-4d7d-ba96-9a2c7e6f1178","year":2003},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.064653Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:3452e5f4d31b632902661746562843f26eee930457806b3abe5f63554ef529f4","observation_id":"d4067b56-f011-4899-91a1-a6e9553a9307","resolution":{"observed_at":"2026-08-12T16:27:20.302938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00384","last_updated":"2021-02-28T03:31:12Z","snapshot_observed_at":"2026-08-16T18:42:29.337497Z","submitted_at":"2021-02-28T03:31:12Z","title":"Adaptive Regularized Submodular Maximization","version":1},"cited_work":{"arxiv_id":"2103.00384","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.00384","snapshot_observed_at":"2026-08-12T16:27:20.165378Z","title":"Adaptive Regularized Submodular Maximization","venue":"cs.LG","work_id":"7d287449-5012-4937-a8a9-d3da70247695","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.069162Z"},"links":{"cited_paper":"/paper/2103.00384","citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:618d4ee47f4dfb7f59e13f6d0651a647ada073b7b7a92d29395c1077d16bed22","observation_id":"8c682223-94d4-4892-a6d8-9c2dfcc0f3f2","resolution":{"observed_at":"2026-08-12T16:27:20.170242Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.15180","last_updated":"2021-09-30T14:52:34Z","snapshot_observed_at":"2026-08-16T17:52:52.024348Z","submitted_at":"2021-09-30T14:52:34Z","title":"Submodular Optimization Beyond Nonnegativity: Adaptive Seed Selection in Incentivized Social Advertising","version":1},"cited_work":{"arxiv_id":"2109.15180","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.15180","snapshot_observed_at":"2026-08-12T16:27:20.143105Z","title":"Submodular Optimization Beyond Nonnegativity: Adaptive Seed Selection in Incentivized Social Advertising","venue":"cs.DS","work_id":"1a9004e6-e272-41c8-ae33-a54729ca5c4d","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.073940Z"},"links":{"cited_paper":"/paper/2109.15180","citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:250b982963d2f0250d6f585ee6cdf965780478d7139dc927e35938ff092508d6","observation_id":"d6846fca-012a-4d8f-8ba3-0bf8c386f8ba","resolution":{"observed_at":"2026-08-12T16:27:20.149765Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.078884Z","title":"Counterspeculation, auctions, and competitive sealed tenders.The Journal of Finance, 16(1):8–37, 1961","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.078884Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:1cbe8dd05e7966ad05e5ee7b811d93212baae8a7adcb06e7e32352a6f9e017ae","observation_id":"be8c6d41-34b0-4133-ab14-bd8a595bf6c1","resolution":{"observed_at":"2026-08-12T16:27:20.078884Z","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-12T16:27:20.273728Z","title":"Online bicriteria algorithms to balance coverage and cost in team formation","venue":null,"work_id":"d9aa08aa-b4ac-4a05-94ff-efd3e4f70ac5","year":2020},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.083325Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:965c8140488fe3eec506a518f5afd77fe29ef0197e54f764dac14f49ea324aec","observation_id":"3006e247-ab99-40aa-b9c3-cec42b6bb27a","resolution":{"observed_at":"2026-08-12T16:27:20.278408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.258602Z","title":"On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint","venue":null,"work_id":"28a691c2-c714-461d-8e63-bbc785fb5682","year":2021},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.087490Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:6652d75b9e9e1c7958c8e59fa76edf4243265404c99f5c3f11a1f83feddb4128","observation_id":"32d827ef-e558-4242-a3f5-39d29409bc6e","resolution":{"observed_at":"2026-08-12T16:27:20.263472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.244385Z","title":"Recently, Brustle et al.[11] provided a simple mechanism that gives a1/2−approximation to GFT under arbitrary distributions","venue":null,"work_id":"06ecda11-ffe2-44dd-931c-9dab87e2e857","year":null},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.091795Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:719ea69e032a1bab98c89ef2ff679140aece64ab10dae4f01cc161979e020a80","observation_id":"ed0108f1-4967-4e6e-b001-fbec8b34e274","resolution":{"observed_at":"2026-08-12T16:27:20.249094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.229135Z","title":null,"venue":null,"work_id":"9d021e01-810e-4647-b56d-18ab73c4cac0","year":null},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.096620Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:9cc4168e285106c6c607dec08957f67d565a8764caa66af862f125796de90972","observation_id":"8a011db7-65a2-4f15-9237-a934b1b06ca6","resolution":{"observed_at":"2026-08-12T16:27:20.233840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.215115Z","title":null,"venue":null,"work_id":"a1ce9038-1547-4dc2-bfd7-37b679bf864a","year":null},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.100995Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:bf2e0e18b59111fe6d078195d24ccccec4473290d73add2cf435aa3b1c6033ca","observation_id":"406c919a-eb0e-444f-b5c0-f89ff643f61f","resolution":{"observed_at":"2026-08-12T16:27:20.219685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-12T16:27:20.200703Z","title":"First, we recall a negative result from [34]","venue":null,"work_id":"25a2de6e-fb16-4270-8c4a-3487ed21f8c5","year":null},"citing_paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:20.105728Z"},"links":{"citing_paper":"/paper/2411.13513"},"observation_digest":"sha256:4949ec56c3ce0fe2cee36fe3a917ce06c6038d91fcab0822904951fb22109e4f","observation_id":"ab2d2cc8-ac71-4065-9b33-6b9ff224991e","resolution":{"observed_at":"2026-08-12T16:27:20.205281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13513","last_updated":"2024-11-20T18:06:55Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-12T16:17:21.096233Z","submitted_at":"2024-11-20T18:06:55Z","title":"Procurement Auctions via Approximately Optimal Submodular Optimization"},"reference_resolution":{"displayed":84,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":3,"verified_fuzzy":71},"total_outbound_references":84},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 84 of 84 outbound references and 2 inbound Pith citation observations for arXiv:2411.13513."}