{"as_of":"2026-08-18T06:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a7780d07a732c02128015045782914b6443ce440870108e905d35a8da0b509c","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:11:15.123863Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.09473/citation-record","integrity":"/paper/2507.09473/integrity","json":"/paper/2507.09473/citation-record.json","paper":"/paper/2507.09473"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:11:21.293348Z","title":"Patient mix optimisation and stochastic resource requirements: A case study in cardiothoracic surgery planning","venue":null,"work_id":"a9a73d6b-0ba9-4c38-8f10-3eb93384dc4f","year":2009},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:16.864992Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:936584810abcbf6efd4ff39c6fc45e60abafd25349a63f475f24728f0094508e","observation_id":"d45bbb56-5b22-49ed-9128-767a7e40699a","resolution":{"observed_at":"2026-08-06T18:11:21.330798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:10:16.890088Z","title":"A dynamic near-optimal algorithm for online linear programming","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:16.890088Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:73f8aefbe5175a4cb72c4f4d41869c1a2e3b62a67d9f89c9dd11b7dee747ab9b","observation_id":"cac9fb4d-c541-4260-915a-aa23085aa6f0","resolution":{"observed_at":"2026-08-06T18:10:16.890088Z","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-06T18:11:21.215245Z","title":"Learning prices for repeated auctions with strategic buyers","venue":null,"work_id":"1be64f1a-f922-434e-8523-688dbfc929bb","year":2013},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:16.964894Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:0d46549a2f740f4a03457f228c155938907ac45f9184042686b9e9e33f358b5e","observation_id":"79e7b0b1-adcd-4d1f-8267-c59ec0c025e4","resolution":{"observed_at":"2026-08-06T18:11:21.241039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:21.084459Z","title":"Repeated contextual auctions with strategic buyers","venue":null,"work_id":"08ba693e-4757-4cbf-9966-ce1d4c1960cb","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.095473Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:da21807a7f9e0d3f88b5847f62ee521c95e3adeb6535a589f518af5faf00ce53","observation_id":"1fd807fb-8bcd-49ed-ba33-fae97e7fda38","resolution":{"observed_at":"2026-08-06T18:11:21.146985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:10:17.212585Z","title":"Uniformly bounded regret in the multisecretary problem","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.212585Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:d762c59227a6d5aadca99b082e3f60494e2a48a9c62af1995b0a8910c10349ed","observation_id":"94a4da63-87fd-450c-baf0-76ea35fab2c3","resolution":{"observed_at":"2026-08-06T18:10:17.212585Z","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-06T18:11:20.968623Z","title":"A difficulty in the concept of social welfare","venue":null,"work_id":"a610234b-791a-4ec0-bd92-5c487f5c9a6e","year":1950},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.297751Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:15bda273540199775316e18cbd84fc8cf983b3a3feb78373ce0759c645d14d6f","observation_id":"7e7d6818-0158-49c1-b588-c894ae827c78","resolution":{"observed_at":"2026-08-06T18:11:21.012883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:10:17.373301Z","title":"Bandits with knapsacks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.373301Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:ed45bdd204ee5d027482deca1a9c2b446727f695dbc27dbdda26f4c2e889baa0","observation_id":"1a3513b7-85cb-4229-8e75-8b4267c90f0b","resolution":{"observed_at":"2026-08-06T18:10:17.373301Z","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-06T18:11:20.836163Z","title":"Learning in repeated auctions with budgets: Regret minimization and equilibrium","venue":null,"work_id":"f7a5f691-f07c-48fa-b653-9db383e14095","year":2019},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.440125Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:65bdcba425d85e57d12ea2d9db567f49b3dad2d7eb358f0500cebaa1706725a7","observation_id":"48670b44-a6ac-4285-b0df-d184d8fd611f","resolution":{"observed_at":"2026-08-06T18:11:20.870058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:20.740117Z","title":"Multiagent mechanism design without money","venue":null,"work_id":"e60925eb-fe4b-4adc-a74f-4a6545c4f705","year":2019},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.529335Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:cd2a9d1f619f9fbdefc03d4fa2e0355b4023cb5df145a502f54e1b036dd8fd8e","observation_id":"002cbd5e-2051-4bbd-92ac-c766e17107cb","resolution":{"observed_at":"2026-08-06T18:11:20.776448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:20.613083Z","title":"The best of many worlds:: Dual mirror descent for online allocation problems","venue":null,"work_id":"0d550037-6b54-4610-ac2d-43c45589b6fb","year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.624674Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:010787c78b18b93bd2e313e0bcf56459f37f3f53eee22d28bfd22c466331660f","observation_id":"fd21faf6-a188-458f-944e-6de0ace2f5ff","resolution":{"observed_at":"2026-08-06T18:11:20.667372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:20.503994Z","title":"Robust pseudo-markets for reusable public resources","venue":null,"work_id":"90ae1cd7-7d14-417a-b8ce-de12686c31eb","year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.698279Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:c38f4bc0a44238debd337850e523a509c5e3f71876a796f28e31cb3cf6a227a8","observation_id":"8f30bd04-0de2-4966-b394-c080ad9988da","resolution":{"observed_at":"2026-08-06T18:11:20.540168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04057","last_updated":"2025-02-04T17:00:13Z","snapshot_observed_at":"2026-08-16T14:12:09.563117Z","submitted_at":"2024-03-06T21:08:54Z","title":"To Spend or to Gain: Online Learning in Repeated Karma Auctions","version":2},"cited_work":{"arxiv_id":"2403.04057","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.04057","snapshot_observed_at":"2026-08-06T18:11:15.585472Z","title":"To Spend or to Gain: Online Learning in Repeated Karma Auctions","venue":"cs.GT","work_id":"7e5e8271-7249-4883-803a-a96f22e9ab36","year":2024},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.759969Z"},"links":{"cited_paper":"/paper/2403.04057","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:e739e51ae45f5383c587aac46b5655843964ed505cbdbb8f6264f37ea39e102e","observation_id":"c191f819-52c8-47fb-ad69-65b27e85ca1b","resolution":{"observed_at":"2026-08-06T18:11:15.616951Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:20.368545Z","title":"Convex analysis and optimization, volume 1","venue":null,"work_id":"be672ab6-30db-442f-bceb-ad9088e6657e","year":2003},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.807788Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:b1b07ff76cb1072f32adeef88df629f3f18baa6d1be74d61dc05a819a700b815","observation_id":"f15eba08-f07f-42ac-baa3-aada7ff99c57","resolution":{"observed_at":"2026-08-06T18:11:20.449755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10066","last_updated":"2024-08-19T15:04:20Z","snapshot_observed_at":"2026-08-16T13:25:29.709734Z","submitted_at":"2024-08-19T15:04:20Z","title":"Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers","version":1},"cited_work":{"arxiv_id":"2408.10066","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.10066","snapshot_observed_at":"2026-08-06T18:11:15.538144Z","title":"Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers","venue":"cs.GT","work_id":"bf90d4f5-c66e-470f-8cb6-4604257cc42a","year":2024},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.918524Z"},"links":{"cited_paper":"/paper/2408.10066","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:b04093e28ab27f747427f598af0527f56fd951979c6b49b8e27ef8b173ba00af","observation_id":"cc675bcd-95d3-4817-99f7-b47999b52ec0","resolution":{"observed_at":"2026-08-06T18:11:15.550790Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:20.253727Z","title":"Market-oriented cloud computing: Vision, hype, and reality for delivering it services as computing utilities","venue":null,"work_id":"0edf1c9e-8615-4032-9903-7fb94efc9787","year":2008},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:17.988379Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:5d82f188a0d2f620284062ccf8e503ddb9889f87617df7355fa9061d1832666b","observation_id":"d05b6a30-ff05-47b1-a278-6a249aa2ce74","resolution":{"observed_at":"2026-08-06T18:11:20.292851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:20.145656Z","title":"Online learning with knapsacks: the best of both worlds","venue":null,"work_id":"334519f0-3fa2-415b-baa4-c1af15b74da4","year":2022},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.057515Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:79482577a69f6be3405228d2a52d42c03b8071a17b17929733b7a787a39b8bab","observation_id":"e15900c2-2e21-4593-818c-c758a72d6e9f","resolution":{"observed_at":"2026-08-06T18:11:20.197100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.941046Z","title":"Regret analysis of bilateral trade with a smoothed adversary","venue":null,"work_id":"c82cc82e-cf51-4ee3-a519-8f0ab5c36411","year":2024},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.128542Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:8246a3f5fdbb5cd3131988212ff057c547f9b416d2d541193360bc1e549ad998","observation_id":"448764be-9c65-4374-8d33-44424f83c432","resolution":{"observed_at":"2026-08-06T18:11:20.037296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.757799Z","title":"The role of transparency in repeated first-price auctions with unknown valuations","venue":null,"work_id":"4e33b6b9-1552-45c5-9dfb-871ef33262a5","year":2024},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.219121Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:8deee3fc0a862b851f6b069a3accec6659026a3439623d10fed5e454c5ff2499","observation_id":"845f625e-3981-4a5a-b03d-4e81dd62bc6b","resolution":{"observed_at":"2026-08-06T18:11:19.845454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.631619Z","title":"Multipart pricing of public goods","venue":null,"work_id":"2638729c-888a-4fbd-ab71-ba9e1f57581e","year":1971},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.274830Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:db373d36f1ea4734e83eee66d64331ba51afeefd883b1a15436e159e7c8bdc9d","observation_id":"2bb0bcb4-040c-408a-94ba-0a954392ef0b","resolution":{"observed_at":"2026-08-06T18:11:19.698947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.487387Z","title":"Positive results for mechanism design without money","venue":null,"work_id":"649133ff-141e-404a-860a-c4c4a9afe22e","year":2013},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.318247Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:10aeae4e9b1dd18ff3dc34714709956e552e2b2285fa97770b426b8f9a6082df","observation_id":"c9ebfa05-dd4a-4a1f-8cbb-7399fc27007d","resolution":{"observed_at":"2026-08-06T18:11:19.571412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08412","last_updated":"2026-05-26T18:43:45Z","snapshot_observed_at":"2026-08-10T02:16:03.346371Z","submitted_at":"2025-02-12T13:53:21Z","title":"Non-Monetary Mechanism Design without Priors: Achieving Efficiency via Adaptive Costly Audits","version":3},"cited_work":{"arxiv_id":"2502.08412","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08412","snapshot_observed_at":"2026-08-06T18:11:15.459402Z","title":"Non-Monetary Mechanism Design without Priors: Achieving Efficiency via Adaptive Costly Audits","venue":"cs.GT","work_id":"58505f78-56f8-44dd-ad0f-2988df76ac0a","year":2025},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.380972Z"},"links":{"cited_paper":"/paper/2502.08412","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:4939633f271f12de9541f2f79fd794536b76b6a6ce037349e32d780b11fd6d63","observation_id":"bbe95fee-a608-4435-b3ab-b9cc59e464ce","resolution":{"observed_at":"2026-08-06T18:11:15.489375Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.399673Z","title":"Bandits with switching costs: T 2/3 regret","venue":null,"work_id":"d7971e9d-847a-404b-a817-45f5b1dc7d4a","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.454674Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:ddac6bb1d364789d843bcb5effee74ce1955b721cce8b480202be30c83938778","observation_id":"f7ede058-e12b-4e0f-a353-540749203685","resolution":{"observed_at":"2026-08-06T18:11:19.436859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.212415Z","title":"The adwords problem: online keyword matching with budgeted bidders under random permutations","venue":null,"work_id":"7e9e99da-c1a1-47c8-b156-c36c5158869a","year":2009},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.529095Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:171dbd101a444be9645eb0f665c1ee9bb74f15cf29619c8e3c4fc6663e55b2e1","observation_id":"6b069ebc-ebda-4518-89db-bfe9ffdd7ae4","resolution":{"observed_at":"2026-08-06T18:11:19.286716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:19.083462Z","title":"Near optimal online algorithms and fast approximation algorithms for resource allocation problems","venue":null,"work_id":"6a7fe8e6-c92e-4b73-ad29-427c104a33af","year":2019},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.638808Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:8b21a5cbef0e3f43a493af3673a358becdc2a27bb3652f9d517768c2fb02c15d","observation_id":"59749db1-7e09-482a-a5e1-5cc2f043e4f7","resolution":{"observed_at":"2026-08-06T18:11:19.139686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:10:18.751113Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.751113Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:0fa9f9fb5a9ea090c4304802ea6c2afb8fdc673a426a7eda5369b83e4ff8ec98","observation_id":"30f981bc-0948-4682-8c8d-b0532067eacb","resolution":{"observed_at":"2026-08-06T18:10:18.751113Z","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-06T18:11:18.922293Z","title":"Smoothed analysis of online non-parametric auctions","venue":null,"work_id":"bffa023d-85bf-4439-8256-425a25689dbc","year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.805942Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:a8f6af13b0b8a641ae82f246c3b96fae7746ec726dc36038db2e3b25283d22a6","observation_id":"6139ed10-9a1c-428f-bac0-d19c08d75505","resolution":{"observed_at":"2026-08-06T18:11:18.995690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.839298Z","title":"Online stochastic packing applied to display ad allocation","venue":null,"work_id":"e12da972-1dbd-4ed9-9f47-7a32e9880f17","year":2010},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.909120Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:f59c75467635b30db4ced2a46f159497b0e6200d3ca877644191074bfcc0de22","observation_id":"10381892-b77c-4f45-b29c-bab39c097c1a","resolution":{"observed_at":"2026-08-06T18:11:18.884581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08881","last_updated":"2025-06-12T11:06:40Z","snapshot_observed_at":"2026-08-16T14:52:27.694620Z","submitted_at":"2023-10-13T06:20:48Z","title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08881","snapshot_observed_at":"2026-08-06T18:10:18.976296Z","title":"Online resource sharing via dynamic max-min fairness: efficiency, robustness and non-stationarity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:18.976296Z"},"links":{"cited_paper":"/paper/2310.08881","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:63d605d645d958c90b91d8953b2901fc40d3aed2b6011a154bb8165a8bd0939a","observation_id":"9b3824d2-33a8-478d-9197-63228184dc04","resolution":{"observed_at":"2026-08-06T18:10:18.976296Z","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-06T18:11:18.802913Z","title":"Learning in repeated multiunit pay-as-bid auctions","venue":null,"work_id":"4ffd0054-89d2-4b28-9d46-6c75a8ee4c3c","year":2025},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.057807Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:3961740313ad867532f2d6e6a02d9993d04d3f5dc3df57249717f827a5f2c74e","observation_id":"86d9723a-7cd2-42fc-b7aa-380ad481e07a","resolution":{"observed_at":"2026-08-06T18:11:18.812924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.685464Z","title":null,"venue":null,"work_id":"db6735ad-233b-4e17-b867-b009dab6d633","year":1973},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.109395Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:1e0b40ff80ba56c3775f6035542f568d3d4cf2f39c614b4b1a7dbf365aa4423e","observation_id":"762fff2c-f133-4fe6-ac54-35efd23e32a2","resolution":{"observed_at":"2026-08-06T18:11:18.739902Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.571103Z","title":"Real-time optimization of personalized assortments","venue":null,"work_id":"3bbf9bef-ade4-441f-9f3a-dbe21f8c1dda","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.145205Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:0aac4126ce0615521e8146e19e338e50dc91c7d7c8e53805d842eb0ebdafad36","observation_id":"fe874f28-62b8-4336-bb13-bd7bce642da6","resolution":{"observed_at":"2026-08-06T18:11:18.641613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.497555Z","title":"No-regret learning in price competitions under consumer reference effects","venue":null,"work_id":"1b825a27-08ad-4073-9954-b587354a4be2","year":2020},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.203925Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:cf1eff0e19b228b9643eccaa703972a77f6a1f97629aea00b8a559300a606f94","observation_id":"175479b6-8bd8-409d-bd44-35dcc3a929b4","resolution":{"observed_at":"2026-08-06T18:11:18.535136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.392534Z","title":"Dynamic incentive-aware learning:: Robust pricing in contextual auctions","venue":null,"work_id":"b507213c-0c65-4d2d-8259-0afd20574813","year":2021},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.254545Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:60bb2c5e5b2cd128206018ae997116ec1e1eefbdd5f69469d68d8ed06812fa0b","observation_id":"ecbca64b-3a59-4165-8f9b-b7850f040499","resolution":{"observed_at":"2026-08-06T18:11:18.441009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.255226Z","title":"Boosted second price auctions: Revenue optimization for heterogeneous bidders","venue":null,"work_id":"eee0a70b-70aa-4e50-a6f7-007311bffa07","year":2021},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.377752Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:c99b617556fc0c94e65541acb0d7617def16e2276866ac97e0b559bd631b93b6","observation_id":"eafb2b18-90d7-4754-b8ce-ae7807e2f21f","resolution":{"observed_at":"2026-08-06T18:11:18.296525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:18.145999Z","title":"Incentive-aware contextual pricing with non-parametric market noise","venue":null,"work_id":"4691e138-326b-4e9a-b798-615a6d36fa17","year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.427996Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:eb0f0b289a5ae1a60c713b3fb932749700d74a3325d767d8491d13a103af4b14","observation_id":"598c7d60-5325-4201-80fd-dcb31e8c4eaa","resolution":{"observed_at":"2026-08-06T18:11:18.220562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.995159Z","title":"The remarkable robustness of the repeated fisher market","venue":null,"work_id":"8e989994-3a65-4b92-970e-6d71430cd0b8","year":2021},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.460277Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:019e4328a051ee6759ebd998a06f1c8b75eb136fd7b3c11f3b19d94fbdd8edf8","observation_id":"cef6c2aa-3e65-4801-8500-5f715e14998b","resolution":{"observed_at":"2026-08-06T18:11:18.077912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.911406Z","title":"From monetary to nonmonetary mechanism design via artificial currencies","venue":null,"work_id":"6b878e5e-d8ca-4bd0-ab04-5abc27e7fdc0","year":2021},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.531072Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:d1ad4ff06aa4fcb0ad969d7925a9c47cd6bde5052a78f780383744e4c4814bb1","observation_id":"1927be9d-87ea-420e-b9de-a8b4b9d4e0d3","resolution":{"observed_at":"2026-08-06T18:11:17.943161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.801460Z","title":"Incentives in teams","venue":null,"work_id":"bcb7068d-4b64-4a1e-9523-5d16e70c5402","year":1973},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.579895Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:15b6a8a3ca4a1dc652cb81dbe9bcba89b25684c7ce3062758cd4c79ee79b0ad3","observation_id":"774f8dd2-3b20-4eca-898a-13a163807f7a","resolution":{"observed_at":"2026-08-06T18:11:17.856828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.723425Z","title":"Strategy-proof allocation of multiple items between two agents without payments or priors","venue":null,"work_id":"15051ff3-4796-44c9-95e8-9f742eba4551","year":2010},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.634754Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:5de2f567eea1de29a72f46d2f408901c5e2f8ee20a73f9cb55c701d1ff797097","observation_id":"786775f8-1932-4e69-bbde-8ded9f469db1","resolution":{"observed_at":"2026-08-06T18:11:17.742637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.590900Z","title":"How the experts algorithm can help solve lps online","venue":null,"work_id":"aea9464c-1df7-4ffa-a8f9-94b0ea1e23e5","year":2016},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.724851Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:991ca2c1ef1bd1c04f62b659cba2cb45c151ba49cbf0d2576f9add407af84bef","observation_id":"017e4cea-c373-4775-8574-4b94f40fb117","resolution":{"observed_at":"2026-08-06T18:11:17.654529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.512293Z","title":"On strategy-proof allocation without payments or priors","venue":null,"work_id":"98e989d4-23c7-49bd-a319-be1fdc9562b4","year":2011},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.842547Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:176ce9bcec70830e860cbc6fc1d6ba2affb5c7eaa8dc2ff9fd2695f5166fa39a","observation_id":"090e9e77-4041-469a-bee6-7588764ae825","resolution":{"observed_at":"2026-08-06T18:11:17.540790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16162","last_updated":"2024-02-25T17:48:21Z","snapshot_observed_at":"2026-08-17T10:25:29.332281Z","submitted_at":"2024-02-25T17:48:21Z","title":"Catch Me If You Can: Combatting Fraud in Artificial Currency Based Government Benefits Programs","version":1},"cited_work":{"arxiv_id":"2402.16162","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.16162","snapshot_observed_at":"2026-08-06T18:11:15.338014Z","title":"Catch Me If You Can: Combatting Fraud in Artificial Currency Based Government Benefits Programs","venue":"eess.SY","work_id":"287795c2-638c-47c1-94ac-468328df4fcf","year":2024},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.891953Z"},"links":{"cited_paper":"/paper/2402.16162","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:341ffdd47fc0834d28549ddfac428e4aaeeca130564efca6b0bf0f9dc4775c02","observation_id":"26de7439-9d96-4571-b3c8-f2c0e6a82fae","resolution":{"observed_at":"2026-08-06T18:11:15.380225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.373209Z","title":"Dynamic reserve prices for repeated auctions: Learning from bids","venue":null,"work_id":"b38c3c95-ca7e-4027-9bdc-76e89d8ac027","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T18:10:19.948202Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:4ba8c130f563381c06a3b7b0746847a210e84f2a9ddc33b4a65bbd6179d5c07b","observation_id":"bf0b7b9a-793d-496b-86dc-8482cdec775a","resolution":{"observed_at":"2026-08-06T18:11:17.427739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.223172Z","title":"Primal beats dual on online packing lps in the random-order model","venue":null,"work_id":"8de78403-68b7-47b7-bd20-abfe6342aff1","year":1939},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.270341Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:628514bccd0ac89c8b9ebe1c8f6330c6cd7f1920d5d1556fde704b1361b5d67f","observation_id":"bfa7f303-281c-4bfe-9755-c9506f536aa8","resolution":{"observed_at":"2026-08-06T18:11:17.274956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.151661Z","title":"Sub-sampled cubic regularization for non-convex optimization","venue":null,"work_id":"0fe70388-0260-4478-8232-a2ce66ef20f1","year":1904},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.341589Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:c318e848c06afba3a836e1e16978f3454b598f62ea3b420aab7ae4640d30cf92","observation_id":"1398bd60-13dc-4c97-9b8a-75089eefe445","resolution":{"observed_at":"2026-08-06T18:11:17.164928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:17.067682Z","title":"A nearly linear-time ptas for explicit fractional packing and covering linear programs","venue":null,"work_id":"b3afa7ec-cb04-4595-ae3d-2b5d0ca6bcd0","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.419083Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:2b990acb50d3cd7c631f3cf481615647f724ce7610a71200c1d2a74167677192","observation_id":"1a839773-f423-471f-a343-2430cdd18201","resolution":{"observed_at":"2026-08-06T18:11:17.129780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.987973Z","title":"Simple and fast algorithm for binary integer and online linear programming","venue":null,"work_id":"66791375-63e3-464e-919d-0af891dc5b79","year":2023},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.457018Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:cc242bfcd8dcdbc1b76942079816e3a22d2924e59d24ea489fcb12e17b9209f0","observation_id":"76d9494a-4452-497a-a4b4-64889f399a74","resolution":{"observed_at":"2026-08-06T18:11:17.048713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.864093Z","title":"Cardinal bayesian allocation mechanisms without transfers","venue":null,"work_id":"11316a72-0f9e-4c92-ad55-d8402c62736b","year":2012},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.521248Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:781b22ee9ac1727f0940291e9decdc30a347c326b8c50c35360f8823675c6682","observation_id":"4207ee02-aeb3-415f-a3f7-3a8597136eb7","resolution":{"observed_at":"2026-08-06T18:11:16.938215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.777134Z","title":"The geometry of online packing linear programs","venue":null,"work_id":"a8720d29-949b-4138-84cd-5b365fa92c76","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.562780Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:7cd2e8a0269db2bf944eefdd00a89d2793f8c4579f8785e4741be78911d9fbc7","observation_id":"5f31be4e-e4d8-455c-8df1-86e3ab20ed5c","resolution":{"observed_at":"2026-08-06T18:11:16.839901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.624403Z","title":null,"venue":null,"work_id":"809e7318-3a0f-4f25-80d1-554a33a8c8a2","year":2000},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.612984Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:f434c78df7832ccdadd945efbaa82524e2dfb180890a33a17cfc60ef937c1054","observation_id":"f8a0f55f-2db4-4799-80f5-b55a3d4739fc","resolution":{"observed_at":"2026-08-06T18:11:16.691492Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.454119Z","title":"Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds","venue":null,"work_id":"e21c8a3d-e284-443d-88e1-e8c9c7f21349","year":2014},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.691304Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:703b342b5b77bb2a803dabeb4c9ff5a4054e9ce7dd962f54b74eb9b5fd3ad415","observation_id":"b4836a98-e294-4450-be75-33b63eae24c0","resolution":{"observed_at":"2026-08-06T18:11:16.506643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-06T18:11:14.756148Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.756148Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:c516cd071b4c72fc488133666eeadc87e4ebf0f560a54fc0854ac7ad3fc462f2","observation_id":"5d79fd66-b728-4c45-891e-6636520eb1ea","resolution":{"observed_at":"2026-08-06T18:11:14.756148Z","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-06T18:11:16.330271Z","title":"Online learning with predictable sequences","venue":null,"work_id":"3627f0bb-2ca7-4e4e-9dfc-2b3adaa90504","year":2013},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.815055Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:ddbf8829a44b5ccfc59afd5cc91ce69a73ced48824c53013df9a3df8a77e0fad","observation_id":"02d5bbd0-cced-40b4-ab55-6326836b7c9d","resolution":{"observed_at":"2026-08-06T18:11:16.388975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.251442Z","title":"Satterthwaite","venue":null,"work_id":"8ce0266e-4902-4c65-b6c4-92cdfb447283","year":1975},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.838982Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:f5f45763b4f68385e35742d1d24bbe62be82ece584f3824cb39f8441ac1413d1","observation_id":"a275d51a-d470-45ac-9d30-555a8b5e8eb1","resolution":{"observed_at":"2026-08-06T18:11:16.262626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:16.050988Z","title":"Determining location and size of medical departments in a hospital network: A multiobjective decision support approach","venue":null,"work_id":"a3c629b2-30e2-4e22-a7cd-3b8a91017993","year":2004},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.876571Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:a81a7acf6d1802eb5db95583d425d5a978f24b88f4a8c0bcebbba92282a6539c","observation_id":"d45017ee-f573-49c5-a32f-61aea926fbf0","resolution":{"observed_at":"2026-08-06T18:11:16.149477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.06327","snapshot_observed_at":"2026-08-06T18:11:14.902810Z","title":"Near-optimal primal-dual algorithms for quantity-based network revenue management","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.902810Z"},"links":{"cited_paper":"/paper/2011.06327","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:a13ea8409386f84df0066f057a62b9f6600d19368e9c9199959716f84a0c653e","observation_id":"5f776c28-2758-4907-988b-888f46f7fe93","resolution":{"observed_at":"2026-08-06T18:11:14.902810Z","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-06T18:11:15.927094Z","title":"Counterspeculation, auctions, and competitive sealed tenders","venue":null,"work_id":"9f1ec74e-4e2a-4581-97ce-8e1f9c31e879","year":1961},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.918994Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:5253596a765d6a32d6be788e96d68726ba42942ec365d0839d756046600a9c00","observation_id":"80a463cf-b31c-4b9f-a615-5a0aff9073ce","resolution":{"observed_at":"2026-08-06T18:11:15.968928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:14.929266Z","title":"Q-learning","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.929266Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:dd33ec18814a0df6a4162359fa0b57d51a907de9ae4416e317430ecf5b3e01e6","observation_id":"c12a3479-89b7-4377-aaa7-86e086da2e6d","resolution":{"observed_at":"2026-08-06T18:11:14.929266Z","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-06T18:11:14.980039Z","title":"Probability with martingales","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:14.980039Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:0583d6307eb9af120d55c9eb8d0459773e6252a384cfca49cfd5e8d78fa6c52e","observation_id":"5fcfaab5-97c4-4861-92ea-74a0dc46829d","resolution":{"observed_at":"2026-08-06T18:11:14.980039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.02403","last_updated":"2024-08-05T11:55:41Z","snapshot_observed_at":"2026-08-16T13:28:30.871111Z","submitted_at":"2024-08-05T11:55:41Z","title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","version":1},"cited_work":{"arxiv_id":"2408.02403","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.02403","snapshot_observed_at":"2026-08-06T18:11:15.214668Z","title":"Online Fair Allocation with Best-of-Many-Worlds Guarantees","venue":"cs.GT","work_id":"eb903963-e048-4730-9ec8-7e79970ea1ce","year":2024},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:15.031185Z"},"links":{"cited_paper":"/paper/2408.02403","citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:78ac6e06f21a6648c9ad36e6d61c900e24ed3cbd3e87340fbffc0a9b146d36bf","observation_id":"c0376f96-0693-46a1-ad94-1e82253fab62","resolution":{"observed_at":"2026-08-06T18:11:15.259108Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:15.832935Z","title":"Online allocation and learning in the presence of strategic agents","venue":null,"work_id":"b3615e9b-aebf-4156-b9cb-affcd90c810c","year":2022},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:15.080150Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:4c0f63115e4ed80bbd9fec9646126b6c67dad067d8da813df94d9257210a2744","observation_id":"779f1e11-fb3a-4109-bad1-96d104fae548","resolution":{"observed_at":"2026-08-06T18:11:15.857958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:11:15.700181Z","title":"Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits","venue":null,"work_id":"7e717b49-838f-4c75-b4f1-e6a3e98b23a6","year":2022},"citing_paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T18:11:15.123863Z"},"links":{"citing_paper":"/paper/2507.09473"},"observation_digest":"sha256:85a184943ba048aeffe60160e6e496975230da779f0dd0b0f046e4b7e7c3d0e7","observation_id":"3255cddb-e1ae-4902-a72a-816216a583bd","resolution":{"observed_at":"2026-08-06T18:11:15.756344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09473","last_updated":"2026-07-15T15:36:32Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-17T22:36:30.915520Z","submitted_at":"2025-07-13T03:18:02Z","title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":5,"verified_fuzzy":46},"total_outbound_references":62},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2507.09473."}