{"as_of":"2026-08-21T13:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c01547e0edb6b9e3a5f32bcedeb4efb071b71cc2fbbc5db177617a0ee494708a","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:18:25.927140Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.01862/citation-record","integrity":"/paper/2502.01862/integrity","json":"/paper/2502.01862/citation-record.json","paper":"/paper/2502.01862"},"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-09T14:18:27.526544Z","title":"Optimization-based budget pacing in ebay sponsored search","venue":null,"work_id":"38078eb0-94ed-4ba0-8b77-96d03d9e226f","year":2024},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.475490Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:585057bbaccbf1034d5e12ca88e1bd5dad113ea9b48ef172ff1fc15849cce5f9","observation_id":"cf7fdc24-e9b4-48e9-8735-df0755f4da44","resolution":{"observed_at":"2026-08-09T14:18:27.546466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:18:26.710767Z","title":"URL http://dx.doi.org/10.1145/3589335","venue":null,"work_id":"1160ad96-5daf-47c9-9119-04403fd1a7f4","year":2023},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.499107Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:41dfba61fb2cb69affc4f87aa0817cbd6384176c54faa74795d8ba5e81e38eaf","observation_id":"61384216-b13f-4ddd-ae24-eec429296795","resolution":{"observed_at":"2026-08-09T14:18:26.768394Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.260084Z","title":"[Balseiro et al.(2020)Balseiro, Lu, and Mirrokni] Santiago Balseiro, Haihao Lu, and Vahab Mirrokni","venue":null,"work_id":"b32009b7-410f-40bb-af0f-e82b16c4af43","year":2020},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.504095Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:777702206d7c02675bf7161c4565577c4c50ca31d1389165fffeaa4e68937e93","observation_id":"b39cdeee-6ad9-4a82-8942-8d4106c54c7e","resolution":{"observed_at":"2026-08-09T14:18:27.358176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.133781Z","title":null,"venue":null,"work_id":"17103754-c7d2-4b06-83b9-a76b6fcf20af","year":2023},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.517968Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:a587acdedfe91af23f808bd3d8fbff4bc20554e798b82f0c0074c4d8e7960601","observation_id":"d267f652-4275-4e5c-956b-6c4e7de7e9d0","resolution":{"observed_at":"2026-08-09T14:18:27.137831Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:25.549077Z","title":"doi:10.1007/s10479-023-05264-y","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.549077Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:ecab94446d30d156a3688458a10fb6e28c5b62edf5b53d1d68642c432a95af08","observation_id":"35dddf3d-1b0e-4081-beb0-9706284d81cb","resolution":{"observed_at":"2026-08-09T14:18:25.549077Z","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-09T14:18:25.906126Z","title":"doi:10.1007/978-1-4614- 4720-7_2","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.906126Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:f07d5f5af17ae2dc200c0b54e0c78b29a4afa1e209fc6650b7342f352be7683d","observation_id":"b76bc12f-303a-48f3-87cf-6f4408019a8e","resolution":{"observed_at":"2026-08-09T14:18:25.906126Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:18:27.063518Z","title":"Optimizing generalized gini indices for fairness in rankings","venue":null,"work_id":"81ba7818-9203-4513-a918-ce54ea4b5a72","year":2022},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.914381Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:9d6472eac83da7f012a92c5af6b78b5a6da7536201fdded26feff3d09c36ab30","observation_id":"10aee65d-cf87-4353-ab53-3838e4c67100","resolution":{"observed_at":"2026-08-09T14:18:27.067688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.035539Z","title":"Online adver- tisement allocation under customer choices and algorithmic fairness","venue":null,"work_id":"7797d01d-9659-403a-b20a-8895c2b52ac4","year":2024},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.918845Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:3038a83839032158dea8c28e0a4466dfc39e0917fd162b24781c6fe73aeb023c","observation_id":"35827b9c-8d81-45e4-924e-5fb2abf99ad0","resolution":{"observed_at":"2026-08-09T14:18:27.049509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:26.959773Z","title":"Click models for web search","venue":null,"work_id":"961803c6-c9ba-41b2-9ba5-28ce9bfad905","year":2022},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.922686Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:80f6d29817227f3e0f8ad20b52ffaf2488be48ebb6ec7069e7b560191c87f9b0","observation_id":"783cf57f-1216-4986-b8a6-087a7781a749","resolution":{"observed_at":"2026-08-09T14:18:27.011717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:26.857400Z","title":"Convex optimization: Algorithms and complexity","venue":null,"work_id":"37b653fd-a4d5-4d91-895b-5ce58ccaea98","year":2015},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.927140Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:618835e819070f7a1a49f751d6ddbd3c9be1703dd0e2485958c05cdae3bd1544","observation_id":"f84a1a03-54d6-4ef7-ac21-37d1a573e0fe","resolution":{"observed_at":"2026-08-09T14:18:26.928496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.092156Z","title":"11 arXiv Template A PREPRINT [Yitzhaki and Schechtman(2012)] Shlomo Yitzhaki and Edna Schechtman","venue":null,"work_id":"0299b55c-553c-4f37-9f45-fad2fab12750","year":2012},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":1912,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.896472Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:8fbb365b09d6a3694779d259819c1f334ca535125bdb507c491452677904f08e","observation_id":"09576225-60cc-4686-801b-0e4f11823f57","resolution":{"observed_at":"2026-08-09T14:18:27.096715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:25.653722Z","title":"doi:10.1016/0022-0531(70)90039-6","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":1970,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.653722Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:273252044b8bdb4ac5ff34858c1cd2d7c66bbba7b64f665420a2e515e4ca9c4e","observation_id":"d8348f6a-818e-4f24-b0a4-90b66195e6c6","resolution":{"observed_at":"2026-08-09T14:18:25.653722Z","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-09T14:18:27.146535Z","title":"semanticscholar.org/CorpusID:612212","venue":null,"work_id":"a83df3b9-d86f-4b4b-9d74-e3b0178ea04c","year":2024},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.513669Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:162321bc2d4c703f874c3556eae3a49c1e966ca7a9339b4c244c90e63cd2e475","observation_id":"0884955d-ce61-4c99-94dd-06b304c8737b","resolution":{"observed_at":"2026-08-09T14:18:27.200493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:18:26.161577Z","title":"doi:10.1287/mnsc.1120.1549","venue":null,"work_id":"4e900340-eec8-4111-8cfe-b6763d1cba2f","year":2022},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.737498Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:4144140261d128c30f7feb0703269f247d8f135450c793a9ed6c0411d553edf5","observation_id":"eace8f38-2f36-41c7-8800-e6ca36b4494d","resolution":{"observed_at":"2026-08-09T14:18:26.168931Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:18:26.358593Z","title":"URL http://dx.doi.org/10.1145/2433396.2433483","venue":null,"work_id":"9fca5da9-b5b0-4c83-ac1c-d8928e54fcab","year":2024},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.494269Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:f111641d1fc330e45b9de73ba67243a149b8ea4b40ba077a7073824c93040259","observation_id":"518daeb9-57bd-4bdd-9bad-2b143f1264bb","resolution":{"observed_at":"2026-08-09T14:18:26.375797Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:18:26.540855Z","title":"URL http://dx.doi.org/10.1145/2623330.2623366","venue":null,"work_id":"c1a7489b-aefc-4224-8bd7-e61a92236160","year":2013},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.489549Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:2dfdd776022d3fa38dd4e21934bd09e93d22d63c794ffac13040862786011dd5","observation_id":"f04fb944-ec52-4297-962c-0ed5d6203748","resolution":{"observed_at":"2026-08-09T14:18:26.545361Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.077052Z","title":"Two-sided fairness in rankings via lorenz dominance","venue":null,"work_id":"3e8be7ef-af8e-416d-abb1-5f305c55f10c","year":2021},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.910707Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:d9cd11bae2c41c30b361009e29fc642d9d48faf5a3395023ca56a2baf3753a07","observation_id":"10c6376e-efb8-44a3-840e-39db22ae12cc","resolution":{"observed_at":"2026-08-09T14:18:27.081911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1008.3551","last_updated":"2010-08-20T18:37:23Z","snapshot_observed_at":"2026-08-15T05:10:47.891055Z","submitted_at":"2010-08-20T18:37:23Z","title":"Inventory Allocation for Online Graphical Display Advertising","version":1},"cited_work":{"arxiv_id":"1008.3551","doi":null,"metadata_source":"pith","pith_arxiv_id":"1008.3551","snapshot_observed_at":"2026-08-09T14:18:26.184217Z","title":"Inventory Allocation for Online Graphical Display Advertising","venue":"cs.CE","work_id":"6f7939ce-4419-4c65-bdad-198013395a8c","year":2010},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.508997Z"},"links":{"cited_paper":"/paper/1008.3551","citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:cb95b7f057f9bdf9285f885dd7ae848bd3fa012017ed6f6d455c58dac87d95bd","observation_id":"3976594c-25f0-475d-8b62-4f72b9a44fb5","resolution":{"observed_at":"2026-08-09T14:18:26.190014Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.106245Z","title":null,"venue":null,"work_id":"857377c0-f1db-4af1-ae0b-0d1e660fa8ae","year":1912},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.869149Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:4371636b8d7c99a9b138c4cbf9c10dbe47656ee969e01f4e8982eadf09d9000c","observation_id":"6b140e5a-1170-44d6-9a5b-20183b8ac51c","resolution":{"observed_at":"2026-08-09T14:18:27.110620Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.119929Z","title":"Regularized online allocation problems: Fairness and beyond","venue":null,"work_id":"b7b4001b-554b-40c1-b650-866422f7330c","year":2021},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.837090Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:466e133654d1b04ba07ef4e5bad4bd8983fd0aedf75a2d5fb35db0117b489f27","observation_id":"cb54e7b4-cb11-420c-a186-9fe03b649f9a","resolution":{"observed_at":"2026-08-09T14:18:27.124308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-09T14:18:27.451405Z","title":"[Agarwal et al.(2014)Agarwal, Ghosh, Wei, and You] Deepak Agarwal, Souvik Ghosh, Kai Wei, and Siyu You","venue":null,"work_id":"aa616d61-8f9b-4c88-a0ff-ba9b17d4ae34","year":2014},"citing_paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T14:18:25.485069Z"},"links":{"citing_paper":"/paper/2502.01862"},"observation_digest":"sha256:f97cad8935f8994adc1f17f817142ac621f9a34401cefe79fbb59bac57da8dde","observation_id":"7b546d63-af20-47ff-ae5a-1356587c9150","resolution":{"observed_at":"2026-08-09T14:18:27.511556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01862","last_updated":"2025-02-03T22:20:17Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-19T00:41:07.076955Z","submitted_at":"2025-02-03T22:20:17Z","title":"Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":4,"verified_exact":4,"verified_fuzzy":11},"total_outbound_references":21},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2502.01862."}