{"as_of":"2026-08-10T11:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aea1435d28e0ef25ad5abb5711347afd40c4be4d05b17d060f033d22510663f1","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:51:12.786224Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2502.05599/citation-record","integrity":"/paper/2502.05599/integrity","json":"/paper/2502.05599/citation-record.json","paper":"/paper/2502.05599"},"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-08T18:51:13.338674Z","title":null,"venue":null,"work_id":"1f0cae20-1240-402a-974b-b8f684f48d67","year":2019},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.626423Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:76ea7f9162cc55f74b5238ab790b537eaa6e1447e972e2e85bd3cf8255ac6812","observation_id":"72414ea3-28b1-416e-912b-937f4a3020fb","resolution":{"observed_at":"2026-08-08T18:51:13.342221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.328067Z","title":"Aggarwal, A","venue":null,"work_id":"adfaa1fa-5cc2-4cb0-9c0f-1945e08f8b1e","year":2019},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.630086Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:e7891fa48b458217fdc1af6341f1e5281ed9d6f47149b23ef7ebf40438d204ad","observation_id":"bc119ad4-f902-45e6-a15e-63b7244ba734","resolution":{"observed_at":"2026-08-08T18:51:13.331632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.02893","last_updated":"2020-12-04T23:09:55Z","snapshot_observed_at":"2026-07-06T10:20:55.880820Z","submitted_at":"2020-12-04T23:09:55Z","title":"Non-quasi-linear Agents in Quasi-linear Mechanisms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.02893","snapshot_observed_at":"2026-08-08T18:51:12.632837Z","title":"Babaioff, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.632837Z"},"links":{"cited_paper":"/paper/2012.02893","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:0b1156b4d8d3af20798e92c144571c1d55b648af6f715e2db65526491a99c349","observation_id":"0ff45229-5aeb-402a-ab08-e775bb2755b6","resolution":{"observed_at":"2026-08-08T18:51:12.632837Z","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-08T18:51:13.317981Z","title":"Golrezaei, I","venue":null,"work_id":"958d7f57-ad4d-4a6e-82f1-c0c68ef27b71","year":2021},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.636344Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:2018801a23cf746e9359f8e10686f5d187b2f01f96163e03ea63a1477f9aefc9","observation_id":"0df6b103-fb24-48a0-a2f5-fc9ca29c2e30","resolution":{"observed_at":"2026-08-08T18:51:13.321375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.308377Z","title":null,"venue":null,"work_id":"c289359a-177b-41e6-9986-73a145277247","year":2021},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.640836Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:16cd844fcc74bdba8395fb95b3f00e6b709e6bcb838f557b3855d72acd0aa624","observation_id":"3c1abcfe-5e48-43e4-8e5b-8799fccb6c62","resolution":{"observed_at":"2026-08-08T18:51:13.311654Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.297859Z","title":"Balseiro, Y","venue":null,"work_id":"35479a03-099c-4fc1-aa70-8f55c6c0f926","year":2021},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.644792Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:bf4256ff6643abdfc07a22608d871b1d4b8f95c6a922520de2c46ded1d722a4c","observation_id":"a03b02e5-fa5b-40eb-979f-c1e93f033630","resolution":{"observed_at":"2026-08-08T18:51:13.301552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.287501Z","title":null,"venue":null,"work_id":"146a26ff-90ef-4e74-89c2-4aa9f87a65d1","year":2021},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.648998Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:e5a74b05b7638539fbc2733a92da5d28b145f60c75414d1daf434eaf6b9c3e53","observation_id":"3c0c039c-ea88-455d-8bf1-ec0bde1b8e25","resolution":{"observed_at":"2026-08-08T18:51:13.290839Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.277057Z","title":null,"venue":null,"work_id":"2040ba2d-793d-4a42-81ff-245d9fb602ac","year":2023},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.652975Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:1eaf80360e4c09a45a121cf55548a6cdf5ddb1c86da99be589c67b10cb08ea3a","observation_id":"7770f13c-ce3f-4f02-8aaf-76eda4b42759","resolution":{"observed_at":"2026-08-08T18:51:13.280599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.265660Z","title":"Castiglioni, A","venue":null,"work_id":"3b0dbb69-2a59-4135-a1cc-fee28d12fb87","year":2022},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.657033Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:846f7751db7a366bc93ce503eaed40a792accf76ede05d20b9f5d0c0c9048f7f","observation_id":"23a41cfc-1d3d-4029-a33a-1b783be42592","resolution":{"observed_at":"2026-08-08T18:51:13.269273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07725","last_updated":"2023-02-07T18:11:56Z","snapshot_observed_at":"2026-07-06T11:29:41.025356Z","submitted_at":"2021-07-16T06:50:52Z","title":"Learning to Price against a Budget and ROI Constrained Buyer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07725","snapshot_observed_at":"2026-08-08T18:51:12.661093Z","title":"Golrezaei, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.661093Z"},"links":{"cited_paper":"/paper/2107.07725","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:83e785937b076d9271bd18d6e0f00d4d99d1bcf205726d32f608798bba94c97c","observation_id":"4235add0-89c0-4e86-b147-68bc86b2509d","resolution":{"observed_at":"2026-08-08T18:51:12.661093Z","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-08T18:51:13.255377Z","title":"Balseiro, H","venue":null,"work_id":"45342b46-7538-4061-b2ed-915dfd7a0b4f","year":2020},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.665653Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:846349b7f830bf4f0e36dcd7db6f365a8697b53805ec996298c25060796bd92c","observation_id":"319fb2fa-5452-4181-aaca-5c9aad776d06","resolution":{"observed_at":"2026-08-08T18:51:13.258917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.244412Z","title":"Borgs, J","venue":null,"work_id":"19fc500e-dd20-4984-8e12-0357766bfffd","year":2007},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.669844Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:2df0ec239551c33f4f1d4cf6b8e56ca9d7fcbc1d439ea3a0400346475382f765","observation_id":"b585fc0d-631a-4091-bd5e-ee4635332fe6","resolution":{"observed_at":"2026-08-08T18:51:13.248362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.232772Z","title":null,"venue":null,"work_id":"d70dd27c-8f3a-48f0-b8d2-247d461da4b9","year":2023},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.674142Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:556ca30df5c7a5fe88d68c2383644e9217cdec3dc771b5885b64c85921f46007","observation_id":"b51354f4-cbe7-48c0-90bc-bf218a2302b9","resolution":{"observed_at":"2026-08-08T18:51:13.236627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.222243Z","title":"Lucier, S","venue":null,"work_id":"0243d930-2399-473f-bd93-c78d624fd503","year":2024},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.678205Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:dd9aa2db1233ec36784d994d827f20b1ae6f30612a5c55a8b283054faf824948","observation_id":"ee52df78-3e3f-4c8b-a809-fa23757e194e","resolution":{"observed_at":"2026-08-08T18:51:13.225993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.211564Z","title":"Mannor, J","venue":null,"work_id":"3cd5cd53-7d07-4e28-bca8-da9ea1a9a4fb","year":2009},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.682219Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:b23675465a1cef527addaf30cd35d4d3de46ca3f503ead02bb03bc68cd285ae2","observation_id":"464dea7f-41c4-44bb-8fdb-2691c5ee01dc","resolution":{"observed_at":"2026-08-08T18:51:13.215350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.202280Z","title":"Mahdavi, T","venue":null,"work_id":"ea319ee4-5556-4725-9455-fa7dba16ca90","year":2013},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.686260Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:70d4d5125987994c00efd56fa37e3eb6c462579d4abe6a22c4c8a85b127c17e0","observation_id":"4c0707ac-fa18-4658-8f23-fb8f7ec7b6ec","resolution":{"observed_at":"2026-08-08T18:51:13.205252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.192990Z","title":null,"venue":null,"work_id":"39193683-5e7a-4df3-9f8e-9f775c4d0972","year":2017},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.690152Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:a697c9d1fcd02572b0e1e32832af7b0e1f37e65427c8e171a45c50ff6295deb4","observation_id":"b0f20f5a-5bfb-4785-9f31-0c4c515bc314","resolution":{"observed_at":"2026-08-08T18:51:13.195939Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.183952Z","title":"Badanidiyuru, R","venue":null,"work_id":"e336fd9f-e199-4464-8918-5480091d7ea7","year":2018},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.693631Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:f822b984af20774ef42c930386236aa54d3980b98e8202cc9e47ea6c266a8ab0","observation_id":"b91521ea-f372-4712-8dec-259dcc14114c","resolution":{"observed_at":"2026-08-08T18:51:13.186671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.02218","last_updated":"2020-05-18T06:31:30Z","snapshot_observed_at":"2026-08-01T15:47:59.899394Z","submitted_at":"2016-04-08T03:37:52Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","version":3},"cited_work":{"arxiv_id":"1604.02218","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.02218","snapshot_observed_at":"2026-08-08T18:51:12.964602Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","venue":"math.OC","work_id":"e0a5d4db-418f-4df6-9b55-a73673e48861","year":2016},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.696817Z"},"links":{"cited_paper":"/paper/1604.02218","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:6df332427cc97bd7b74a9e035747cf219306ee73411c67a28d4966cd2b961163","observation_id":"9ca3397a-b886-4b7b-913f-fd9e7052a6b2","resolution":{"observed_at":"2026-08-08T18:51:12.968483Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.174163Z","title":null,"venue":null,"work_id":"79b97d5b-1385-45ba-bfb5-a6089ebd8cda","year":2022},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.700106Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:ba06d821a9b233f4a5456a2763b1257db09e7cf1790b507527ff68732d5fa6d3","observation_id":"ccb063fd-05ee-4ab2-b652-0170bb2f6d7d","resolution":{"observed_at":"2026-08-08T18:51:13.177785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.18955","last_updated":"2024-10-27T16:37:56Z","snapshot_observed_at":"2026-08-07T09:23:39.294571Z","submitted_at":"2023-10-29T09:55:41Z","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.18955","snapshot_observed_at":"2026-08-08T18:51:12.703340Z","title":"Sinha, R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.703340Z"},"links":{"cited_paper":"/paper/2310.18955","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:b58e39c0c84d90f640a1186a3f91fefc9db2bb4c9a073d8da9b4f1ded443e639","observation_id":"c9478aca-4de9-44ea-a123-6fa7c9863918","resolution":{"observed_at":"2026-08-08T18:51:12.703340Z","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-08T18:51:13.162954Z","title":"Agrawal, N","venue":null,"work_id":"fd3c2cd2-c9a0-4945-b7b5-0d09f63c09b4","year":2014},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.707773Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:0ac74079ac221244621010353d4fe7c6c2b4552d5889c9f4177283a05daf4a87","observation_id":"f305ee1b-e074-4228-b95b-dd9e73e1db9d","resolution":{"observed_at":"2026-08-08T18:51:13.166730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.12253","last_updated":"2018-10-23T04:34:30Z","snapshot_observed_at":"2026-07-06T07:17:58.362513Z","submitted_at":"2018-10-23T04:34:30Z","title":"Unifying the stochastic and the adversarial Bandits with Knapsack","version":1},"cited_work":{"arxiv_id":"1811.12253","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.12253","snapshot_observed_at":"2026-08-08T18:51:12.935725Z","title":"Unifying the stochastic and the adversarial Bandits with Knapsack","venue":"cs.LG","work_id":"722dc173-6067-481e-96d2-6b68411656dc","year":2018},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.712455Z"},"links":{"cited_paper":"/paper/1811.12253","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:5c78990c748bc66087be1237464ac2af4f8478160b25c73adcd00f588b6a501f","observation_id":"04090198-1968-4de2-81d8-69bf8e9a522b","resolution":{"observed_at":"2026-08-08T18:51:12.940175Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.151263Z","title":"Immorlica, K","venue":null,"work_id":"20d7b220-68a4-43fa-a5c6-3586229c5378","year":2022},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.716945Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:ea730f8b7055665c7cd9d4bb9f5e7d8b561d1711d881209f6fd785d542f9f934","observation_id":"d7e88f2b-4b35-44dd-9e00-5484946306e2","resolution":{"observed_at":"2026-08-08T18:51:13.154775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.140004Z","title":"Rivera Cardoso, H","venue":null,"work_id":"8b4607c8-a344-45f8-9c9a-aa56d2cbce47","year":2025},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.721290Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:3c236773325a0349302d72677db1926279e667f11fdd75f684d49cbd7d67be76","observation_id":"c14040ab-eedb-4403-a021-44c78dd0af30","resolution":{"observed_at":"2026-08-08T18:51:13.143639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.128515Z","title":"Vaze, Online Algorithms, Cambridge University Press, 2023","venue":null,"work_id":"d76a71b7-0572-41e0-abb9-037295ac760f","year":2023},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.725476Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:19cd82906853d1d2f03521cb8e8fda49d78dbc8995557914a99acfe1f79ee6e9","observation_id":"2d78dd26-eaaa-43c4-ab4c-051961ba0b2e","resolution":{"observed_at":"2026-08-08T18:51:13.132489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.117358Z","title":"Disser, M","venue":null,"work_id":"a36dccf1-6e24-4f53-ab20-ae65a1aec7ee","year":2017},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.730026Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:a7378112e27fc22ff656c6cf7470b7e987e8823a6b6d72df7dc713a3457adbc8","observation_id":"014906c9-2a1a-424f-aacb-b6d44924ecd3","resolution":{"observed_at":"2026-08-08T18:51:13.121101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.107097Z","title":"Talluri, G","venue":null,"work_id":"d0f169d2-ada1-4c1e-ad77-0225791bde93","year":1998},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.734025Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:6404d2b0f062ecc5c7fb53ea9115788cb2c3fa939e98eb3136bddeea0577d983","observation_id":"fe42c7e1-4eaa-457b-a74c-13e68bcbbfa6","resolution":{"observed_at":"2026-08-08T18:51:13.110586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04372","last_updated":"2019-01-14T16:08:05Z","snapshot_observed_at":"2026-07-06T07:26:35.185437Z","submitted_at":"2019-01-14T16:08:05Z","title":"Online Inventory Management with Application to Energy Procurement in Data Centers","version":1},"cited_work":{"arxiv_id":"1901.04372","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.04372","snapshot_observed_at":"2026-08-08T18:51:12.918357Z","title":"Online Inventory Management with Application to Energy Procurement in Data Centers","venue":"cs.DS","work_id":"8e8d51c7-a971-4c8c-abd7-8f7627f24b74","year":2019},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.738863Z"},"links":{"cited_paper":"/paper/1901.04372","citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:29466ae06c1bee5bbfbb21867864de3ebff8401bd62eadea148f9609c282beab","observation_id":"50939ca5-af5e-48a6-9ffd-d62d6e5cd249","resolution":{"observed_at":"2026-08-08T18:51:12.923248Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:12.743157Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.743157Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:6b492fea598576aa2fa6d841be07fb71291cd079508bb65388132cc92258018f","observation_id":"bd388d0c-aa70-477f-92ce-512cdbbadc01","resolution":{"observed_at":"2026-08-08T18:51:12.743157Z","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-08T18:51:13.089442Z","title":null,"venue":null,"work_id":"19c49e3d-9d04-42e8-a693-6ae7adcbed54","year":1965},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.747207Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:c7ff7b9b2440c0f1b65307051b6d9ed44a9e12ab8588ba4cd7142c185824becb","observation_id":"c987851c-0948-4c91-b4eb-7c22253c63d2","resolution":{"observed_at":"2026-08-08T18:51:13.093101Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2012.22181","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:51:12.898440Z","title":"Srivastava, C","venue":null,"work_id":"5a5f12f0-8928-43f1-ad06-da633230e954","year":2013},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.751378Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:33b4d89b449ea272dad6b05546e1e7df2df9d3d33286ab0a9cf2ca006693051b","observation_id":"1fc7e2a7-9e63-42c8-9c52-7f02a7f717af","resolution":{"observed_at":"2026-08-08T18:51:12.905634Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.078411Z","title":"Lattimore, C","venue":null,"work_id":"eedc592c-3920-4369-93ea-6c738bceaa11","year":2020},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.755484Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:d9dd58c8f85e3d5445c981de86e977c3c92b03148105573d15e4b4533ad0383e","observation_id":"1ac5492c-ceba-4c5d-9175-cdc3a78d3104","resolution":{"observed_at":"2026-08-08T18:51:13.082197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.067276Z","title":"Feller, An introduction to probability theory and its applications, V olumes 1-3, V ol","venue":null,"work_id":"32dd1953-e122-46e4-90a8-78620286f07b","year":1991},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.759106Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:0ed105d2157878369096196e203bc9fbbfbb948386f824ec26ea1de421e3cad6","observation_id":"4d1eead2-edbb-4732-98f0-407305295aa4","resolution":{"observed_at":"2026-08-08T18:51:13.071157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.056836Z","title":null,"venue":null,"work_id":"44fcb659-6dac-46e3-bdec-f8da1e74071c","year":2004},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.762859Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:b8779ccbdc2615a9df3aba97b49e8a71eaddf21d56c28ca363926a1de74409fa","observation_id":"3b2a7e41-c608-4db7-b676-ff274ad4e3cd","resolution":{"observed_at":"2026-08-08T18:51:13.060566Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.044918Z","title":"The allocation functions are xθt t (of type (5)) where θt are distributed as follows","venue":null,"work_id":"d4a90acc-0267-4b3b-8b2c-f1feabf648df","year":null},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.766288Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:efdc14d4eb60de4a8b911b21fcaa0b1634636615f64257e33a77edee1737ec66","observation_id":"872be606-eac5-4a1b-8074-43b518788134","resolution":{"observed_at":"2026-08-08T18:51:13.049251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.034552Z","title":"Then g⋆ 3 = 0","venue":null,"work_id":"94e024d8-6986-42b5-985c-b4e04769fadd","year":null},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.769327Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:082d565833ae49e9266ae8f17a95161e5c084292ef885975f58204dac8fd9d1e","observation_id":"a11712e0-278a-42a2-a80a-4d481faa8713","resolution":{"observed_at":"2026-08-08T18:51:13.037388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.025126Z","title":"Similarly let Input 2: vt = 1 2 ∀ t, and allocation functions are xθt t (5), where θt takes the same four values as in Input 1, A, B, C, D, but with perturbed probabilities","venue":null,"work_id":"754e89f2-3cd1-45f7-867d-9c8634953cca","year":null},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.772805Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:02c8e66d4a5016c53d1b2008dc23ff739be830413a8391cde45b37cdb1f8eecc","observation_id":"3b33d50d-8303-4dd2-a6ad-105664033e53","resolution":{"observed_at":"2026-08-08T18:51:13.028359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.015540Z","title":"well-behaved","venue":null,"work_id":"bd4a81e4-9046-4c20-be82-675a510bcfbd","year":null},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.777367Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:abfc4ed251f282b0c906402e48c3aaa420264d602f812399a34b127a124924db","observation_id":"77f74cc4-13ef-4267-b6da-3b31013129ff","resolution":{"observed_at":"2026-08-08T18:51:13.018603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:13.006421Z","title":"Let the statement be false, and in particular in the optimal solution q there exists a k′ (in order) for which qk′ < 1 but qk′+1 > 0","venue":null,"work_id":"e42b302c-e3b3-4b9e-ab9b-9414b927c561","year":null},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.781912Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:23897c7800247a66f9d702cc2efe7549083f3ebf4e407e4b222e42c7c27e0aff","observation_id":"761ac7d5-ceb1-458b-83f5-99ad72865c20","resolution":{"observed_at":"2026-08-08T18:51:13.009452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T18:51:12.995328Z","title":"random variables that are estimated using sample mean estimator 1 n Pn i=1 Xi, from Chernoff bound, we have P 1 n Pn i=1 Xi − E{X1} > ϵ ≤ exp−(2nϵ2)","venue":null,"work_id":"2e2afe30-3d25-4101-b20e-3b26d47c6a53","year":null},"citing_paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T18:51:12.786224Z"},"links":{"citing_paper":"/paper/2502.05599"},"observation_digest":"sha256:c32e08aab8935c33774965419f3c34df3667f6a357c73512816879c245cf145c","observation_id":"17beb5a7-0f2a-4be7-894f-63e0c5b1e3d4","resolution":{"observed_at":"2026-08-08T18:51:12.999012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05599","last_updated":"2025-05-23T14:02:47Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-08T18:38:01.430282Z","submitted_at":"2025-02-08T14:58:49Z","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":24},"total_outbound_references":41},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2502.05599."}