{"as_of":"2026-08-18T11:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4d24a5291150e147375fcfeecb1472915d1ea2ef0a53adddd0c70445a4774ad9","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T22:02:01.706869Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:27:06.637991Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T20:00:37.849096Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08218","snapshot_observed_at":"2026-08-10T20:27:36.330215Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.08775","last_updated":"2025-06-02T13:46:45Z","snapshot_observed_at":"2026-08-11T15:52:14.910543Z","submitted_at":"2025-01-15T12:56:38Z","title":"Adaptive Approximation Schemes for Matching Queues","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T20:27:36.330215Z"},"links":{"cited_paper":"/paper/2411.08218","citing_paper":"/paper/2501.08775"},"observation_digest":"sha256:9e5bc744d6e0231b996958cefddf712f90cc3e308dbd28bfdce8cac477d07095","observation_id":"b959cd7b-ebd2-436a-b0b0-a982ced0142a","resolution":{"observed_at":"2026-08-10T20:27:36.330215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08218","snapshot_observed_at":"2026-08-07T12:15:19.653404Z","title":"arXiv preprint arXiv:2411.08218","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00909","last_updated":"2026-07-24T05:32:14Z","snapshot_observed_at":"2026-08-15T14:55:50.924289Z","submitted_at":"2025-06-01T08:54:08Z","title":"Constant-Factor Algorithms for Revenue Management with Consecutive Stays","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:15:19.653404Z"},"links":{"cited_paper":"/paper/2411.08218","citing_paper":"/paper/2506.00909"},"observation_digest":"sha256:d82528ad4868899285dcfb4caa3a2ed097c8ff112ccc5ff05a23483f0a5c751a","observation_id":"e738533e-0086-4293-baca-31933e878368","resolution":{"observed_at":"2026-08-07T12:15:19.653404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"cited_work":{"arxiv_id":"2411.08218","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.08218","snapshot_observed_at":"2026-08-06T20:00:37.849096Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","venue":"cs.DS","work_id":"fbfb2677-485f-44d9-9ced-9efdfebf5eac","year":2024},"citing_paper":{"arxiv_id":"2507.04551","last_updated":"2025-07-08T03:42:58Z","snapshot_observed_at":"2026-08-18T06:56:59.070837Z","submitted_at":"2025-07-06T21:49:52Z","title":"Greedy Dynamic Matching","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T20:00:36.342111Z"},"links":{"cited_paper":"/paper/2411.08218","citing_paper":"/paper/2507.04551"},"observation_digest":"sha256:fa5fd3dbd7c27e9d8e312665ab31918ce94bdcd89d8739dc5ce383b35619d462","observation_id":"b177d090-d93e-4261-9d00-d39cda5c37da","resolution":{"observed_at":"2026-08-06T20:00:37.858602Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08218","snapshot_observed_at":"2026-08-16T00:27:06.637991Z","title":"AmaniHamedani, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12073","last_updated":"2026-08-12T13:56:24Z","snapshot_observed_at":"2026-08-18T06:51:58.540477Z","submitted_at":"2026-08-12T13:56:24Z","title":"Competitive Analysis of Stock-based Thresholds via Prophet Inequalities in Continuous Time","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-16T00:27:06.637991Z"},"links":{"cited_paper":"/paper/2411.08218","citing_paper":"/paper/2608.12073"},"observation_digest":"sha256:0cb9206d7ad7dd80af55ed1d964b40d2f544d53e0bb246f66289900322cdb5ca","observation_id":"17f5131c-198b-4d9a-b9a5-31fe11e9adb8","resolution":{"observed_at":"2026-08-16T00:27:06.637991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.08218/citation-record","integrity":"/paper/2411.08218/integrity","json":"/paper/2411.08218/citation-record.json","paper":"/paper/2411.08218"},"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-12T22:02:02.604766Z","title":"Adaptive policies and approximation schemes for dynamic matching","venue":null,"work_id":"cb9095b8-7cfc-4f2b-959f-3c08865f0cd5","year":2024},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.434219Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:f44f40de15d320fc46f49a8fc9b55837f6795e1fc91f18865a3ba725f8e15af1","observation_id":"5fb6a361-629a-48a5-baf3-15c9d20a5b6c","resolution":{"observed_at":"2026-08-12T22:02:02.609306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.590847Z","title":"Edge-weighted online windowed matching","venue":null,"work_id":"5e1826ff-b1e3-4c1c-9a25-b56c826becd5","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.439323Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:82b73ed6aabd3f6646ed6f21f23df437583217b73f2b8a6823600eabe71458a4","observation_id":"100f388a-4ac3-47a6-9b7f-b296687ac2f5","resolution":{"observed_at":"2026-08-12T22:02:02.594853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.579064Z","title":"Secretary and online matching problems with machine learned advice","venue":null,"work_id":"2b101c23-7809-4989-9069-f65c92a86103","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.443537Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:402de7ae68f777f75ede912d8d047eac1b5c6b48afb7191eede342ff87814de2","observation_id":"2863d1cc-7aa8-4005-b942-bfebc87188e1","resolution":{"observed_at":"2026-08-12T22:02:02.583061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.566282Z","title":"Online vertex-weighted bipartite matching and single-bid budgeted allocations","venue":null,"work_id":"953c1594-ebf1-4b68-921b-1158f03006f7","year":2011},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.447911Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:fd5e873b387872614684d6eb0c60c0f7444eba1fe29d5aab3abde4973d9ef790","observation_id":"d93d2fff-d1fd-40f2-8058-edf3f60eab4d","resolution":{"observed_at":"2026-08-12T22:02:02.570802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.452147Z","title":"A nonparametric framework for online stochastic matching with correlated arrivals","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.452147Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:337ad770c5b83c3f5ba4fbf633a25138ac7a477409db63976be6ea92a2607a32","observation_id":"a28ddf21-aff9-4136-9cc5-a646bb408e69","resolution":{"observed_at":"2026-08-12T22:02:01.452147Z","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-12T22:02:02.546722Z","title":"Kidney exchange: An operations perspective","venue":null,"work_id":"182d0678-deea-4a08-b812-a6e1ae798429","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.456321Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:470166ea967626d08f26a0b7f2551e5d8969926ff7f8914e812f5c280f02bdb3","observation_id":"03323dae-2f4b-4ce3-a347-ea7b5c157d01","resolution":{"observed_at":"2026-08-12T22:02:02.550983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.532785Z","title":"Dynamic stochastic matching under limited time","venue":null,"work_id":"fb7abfc5-8711-4361-85a3-d40ce52ab05c","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.460749Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:e1286363a20fe830395b040053830451d07688f7e57932e8cb8a115fb67c09ac","observation_id":"480d3362-160b-42be-b0e8-70fbe22fda73","resolution":{"observed_at":"2026-08-12T22:02:02.537592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.519501Z","title":"Multiway online correlated selection","venue":null,"work_id":"cad0275c-149e-4ac7-8931-62945c417fdf","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.464573Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:48489e87455e5c51c9ffaa54606e112c95b096243538b002989cb2e2e56c8f20","observation_id":"2e6b208a-94f1-4f38-b082-6984d84bd7b5","resolution":{"observed_at":"2026-08-12T22:02:02.524025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.506518Z","title":"Max-weight online stochastic matching: Improved approximations against the online benchmark","venue":null,"work_id":"9573218c-7138-48b0-9a47-1d7788ab6e9a","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.468337Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:2bd262ce1e1bbc2db91385375ee850d1233a85d4e4bdcce667051af81b6b1a7a","observation_id":"413a7b2d-afcf-46fc-af01-7f711ff37ba3","resolution":{"observed_at":"2026-08-12T22:02:02.510645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.15285","last_updated":"2024-07-21T22:42:58Z","snapshot_observed_at":"2026-08-17T20:53:39.101011Z","submitted_at":"2024-07-21T22:42:58Z","title":"New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling","version":1},"cited_work":{"arxiv_id":"2407.15285","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.15285","snapshot_observed_at":"2026-08-12T22:02:01.822924Z","title":"New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling","venue":"cs.DS","work_id":"e419d079-a3cf-4120-bc97-58823d3ba8ce","year":2024},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.472266Z"},"links":{"cited_paper":"/paper/2407.15285","citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:3007e6f9f363f90d1d0628f9ffde54fb16ae53e647adf7de05936da51942f2a8","observation_id":"c960996d-c112-43a2-a83e-46248ac698db","resolution":{"observed_at":"2026-08-12T22:02:01.827403Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.476568Z","title":"Dynamic programming and optimal control: Volume I , volume 4","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.476568Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:20e609aec6d9fb66267d3db52855ac86c5bb858c0278658e60d0d790dc218799","observation_id":"cd5a5d5b-2d66-4685-8e99-d7da2dea9904","resolution":{"observed_at":"2026-08-12T22:02:01.476568Z","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-12T22:02:02.486628Z","title":"Stability of the bipartite matching model","venue":null,"work_id":"a596ee9c-7a38-42f8-93e4-374a13a59a16","year":2013},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.480855Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:7c0ed8f5a3c7eaabc78f6caf864194250464ce460c25324c5b2f3220a339990b","observation_id":"284c35aa-21c3-4d35-ae4e-ffe3a51f35c1","resolution":{"observed_at":"2026-08-12T22:02:02.490652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.473115Z","title":"Rearrangement inequalities for functionals with monotone integrands","venue":null,"work_id":"ec1fb58d-e0b9-4043-89dc-73ab90cd0df3","year":2006},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.484903Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:20a46f4d14e541c4bb54cf4772f398172acb9b56890028d2e9ce040f2f366e5d","observation_id":"fd69b56c-0ac9-4411-b5c9-36d1d8c8bcd3","resolution":{"observed_at":"2026-08-12T22:02:02.478021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.459603Z","title":"On the pathwise comparison of jump processes driven by stochastic intensities","venue":null,"work_id":"f833726d-f398-4c6e-9df7-dc81e8bf53a8","year":1994},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.489179Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:bcb245b0537ff7e883b71b264a0d1574d1c160f6e290f9fb778ab7b8e79e1020","observation_id":"b3275531-4e19-401b-a731-1e4131e3f353","resolution":{"observed_at":"2026-08-12T22:02:02.463863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.446228Z","title":"Analysis of an optimal policy in dynamic bipartite matching models","venue":null,"work_id":"a9e9ab5b-eaae-49ff-9872-a77e168e00cf","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.493200Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:bb3048a948e64ec126eff4c90d786f04e1c04b72290c181ebb331e4e24145732","observation_id":"56d04899-0eea-443e-ace0-cbe9ec325602","resolution":{"observed_at":"2026-08-12T22:02:02.450985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.432859Z","title":"Multi-parameter mechanism design and sequential posted pricing","venue":null,"work_id":"5212116f-62b5-44e1-b1dd-4315a3d47cf8","year":2010},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.497260Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:5daf26991d132c1dd26e5dc77098d6c93ae80de381ec62bfc09c465f477aeef4","observation_id":"ae2e32f2-dd94-496a-bd9e-7241d60f1e6a","resolution":{"observed_at":"2026-08-12T22:02:02.437107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12524","last_updated":"2024-08-22T16:29:55Z","snapshot_observed_at":"2026-08-17T05:28:58.734720Z","submitted_at":"2024-08-22T16:29:55Z","title":"Stochastic Online Correlated Selection","version":1},"cited_work":{"arxiv_id":"2408.12524","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.12524","snapshot_observed_at":"2026-08-12T22:02:01.804090Z","title":"Stochastic Online Correlated Selection","venue":"cs.DS","work_id":"ff851337-e151-47ce-99bb-046a983d00bb","year":2024},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.502128Z"},"links":{"cited_paper":"/paper/2408.12524","citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:6196385b574c88d93ca94a6c194fe641d48409c7edf123738c80a040ae7f28ee","observation_id":"bc80f051-1f33-47e6-a13a-7168c3ec61da","resolution":{"observed_at":"2026-08-12T22:02:01.809740Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.419333Z","title":"Dynamic weighted matching with heterogeneous arrival and departure rates","venue":null,"work_id":"aa99132d-de6f-4759-a196-c962e08f5876","year":2020},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.506919Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:a850931bc3d0aafd7c95221d3595a0924637470b84d4be28fa86282031ccb17b","observation_id":"9c561385-f2dd-4a5a-9edb-17ea6c0ab94c","resolution":{"observed_at":"2026-08-12T22:02:02.424381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.406494Z","title":"Dynamic matching via weighted myopia with application to kidney exchange","venue":null,"work_id":"626c9054-2683-4d4c-8b7c-15aaf9cc37c9","year":2012},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.511467Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:65c62c9c6ff516e87572398a2cb42a9bb68d38741eba9bf9ba5e03e2dfda8d7e","observation_id":"1ed5df4e-24e3-495f-9d60-2154e5a041b2","resolution":{"observed_at":"2026-08-12T22:02:02.411095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.516048Z","title":"Dickerson, Karthik A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.516048Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:76dec292a65733bbc5b1fe100f54cac9721b40a337eb6c8d4101ee79532ff059","observation_id":"5060856c-34d6-4c07-9798-d5418c6b3a0b","resolution":{"observed_at":"2026-08-12T22:02:01.516048Z","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-12T22:02:02.382337Z","title":"Prophet matching with general arrivals","venue":null,"work_id":"642e9eac-5e5a-42ca-bbb3-fe50985e3822","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.520146Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:0d72862cd2d7fafb68c54e904291f8d966d9eb8fc63a2b79f93529f574aa29bc","observation_id":"9c5c88d1-efb2-4c19-aa91-1e83737eb8f9","resolution":{"observed_at":"2026-08-12T22:02:02.386322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.366474Z","title":"Echenique, N","venue":null,"work_id":"1f22ea81-83f0-4f1c-9974-498e06a9e8a0","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.524740Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:08329fb0a234fe29a5b87d3db3d3721dd3d474c425b5def402463ca9a7e8a61f","observation_id":"ae4d86e3-b28e-448a-b67d-d152eff97773","resolution":{"observed_at":"2026-08-12T22:02:02.370916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.354669Z","title":"A stronger impossibility for fully online matching","venue":null,"work_id":"ab2dd01c-54a4-48dc-90c0-87e9939efa4e","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.529908Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:63554e026a9224418e687892cda33b7173f8d9fb9d189f86b087c1728df754df","observation_id":"487946dd-d8e1-4dd9-8e6e-0e8a0a630999","resolution":{"observed_at":"2026-08-12T22:02:02.358654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.343511Z","title":"Combinatorial auctions via posted prices","venue":null,"work_id":"e292f9f7-1e43-4258-8948-b11e936d5e7e","year":2015},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.534600Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:12209c41979a5396b02121c74139c9b0bd69d2ea455ccb8c587db6274131f9c3","observation_id":"940c7f4e-7f6a-450b-9077-7b0534c021ae","resolution":{"observed_at":"2026-08-12T22:02:02.347237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.330568Z","title":"Edge-weighted online bipartite matching","venue":null,"work_id":"837c04dd-9861-4880-9ac3-c2a3e82340ea","year":2020},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.538810Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:1855b41fd31e8262c24cb3e3b50f4ba9d0907c689b9a3f8a94caee8c3f5085f8","observation_id":"7028baee-b943-4381-a18b-0664d542b70a","resolution":{"observed_at":"2026-08-12T22:02:02.335079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.318909Z","title":"Online stochastic matching: Beating 1-1/e","venue":null,"work_id":"26f41f40-4e39-465d-b4e1-6a6a4a7651ca","year":2009},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.542882Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:23819c58b908a66fb8b1fac34d100b5dcaa24f91340d282a862fb2080eabc8fc","observation_id":"0bd7b393-014a-4452-b2b0-c1f8d708bb00","resolution":{"observed_at":"2026-08-12T22:02:02.323189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.307909Z","title":"Improved online correlated selection","venue":null,"work_id":"316ad4f0-2e8f-4c4d-8bf4-da2fe75c3253","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.547280Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:3e4c09da9691e461a0b17c2a09399ccea3a8dd1eea4e472f7fa113f18936a67b","observation_id":"3e73d0a1-e61c-4f28-a7a5-d4f688cffd62","resolution":{"observed_at":"2026-08-12T22:02:02.311936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.294666Z","title":"Dependent rounding and its applications to approximation algorithms","venue":null,"work_id":"ccbfdf56-53fb-404d-84c5-9e9314841d74","year":2006},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.551566Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:f8b325d8aac4aea89a1266dbe954e7cfd3db4ae555d14778952f42b935c81bb3","observation_id":"fa7efd2e-af56-4398-b7de-04f5af2f7eac","resolution":{"observed_at":"2026-08-12T22:02:02.298966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.282550Z","title":"Beating greedy for stochastic bipartite matching","venue":null,"work_id":"8c352eb2-baf2-454d-af77-092a2841fe50","year":2019},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.555388Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:0e05a15bce5d35f5d9a3cbdae59c81456396ec3a0b856f95f3fe26be1c63191c","observation_id":"ef7fb730-14a8-4799-88ce-87a33826c481","resolution":{"observed_at":"2026-08-12T22:02:02.286916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.268842Z","title":"Online matching with stochastic rewards: Optimal competitive ratio via path-based formulation","venue":null,"work_id":"075dbe9f-d075-423a-9467-367cb266665f","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.559323Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:98b518331e0cce63c577d64fd6214c104dff942b5a4e9e6d82ce8c8c91955b5c","observation_id":"a17f38c3-dd95-4f7f-9d47-515c6a8041b1","resolution":{"observed_at":"2026-08-12T22:02:02.274250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.257048Z","title":"Online matching with stochastic rewards: Advanced analyses using configuration linear programs","venue":null,"work_id":"2ce6f952-96b2-49a9-b1ad-79fdfbadfa27","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.563150Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:ec0a6b1ce1697febbcab0ccb675492884b09f590eaeb0e1964b296e194cea22a","observation_id":"3bb5a371-2d37-4114-b067-70f296bf6625","resolution":{"observed_at":"2026-08-12T22:02:02.261231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.244297Z","title":"How to match when all vertices arrive online","venue":null,"work_id":"fda123a2-657d-4bc4-bd8a-ee4b86a9d403","year":2018},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.567301Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:e5d74f69900e0f1609bb66b942b9a6ea9a36dd45365ce874f5e94e2eb20ca203","observation_id":"bfaaafea-510f-4ac9-878d-07c8ae895820","resolution":{"observed_at":"2026-08-12T22:02:02.249197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.229469Z","title":"Tight competitive ratios of classic matching algorithms in the fully online model","venue":null,"work_id":"cb945876-df76-4375-a190-9f20866b0a51","year":2019},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.572971Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:8d9580f15dfbec08808d5b0a672eeb1e42ff3b463e9e23ace150893f0e87b9f6","observation_id":"e41d0017-f004-423c-8318-17a8de7a4035","resolution":{"observed_at":"2026-08-12T22:02:02.234660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.215091Z","title":"Online stochastic matching, poisson arrivals, and the natural linear program","venue":null,"work_id":"b858e8f0-d2e5-425d-b1b8-5c8254e2a2aa","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.577624Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:7c897692ed6a922cca8b4fcc1b8a1aca64b5f550f1c93ff71c58d171342c81c6","observation_id":"12f89f2b-ffe0-4b71-b9ee-cd7605af5575","resolution":{"observed_at":"2026-08-12T22:02:02.219526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.200872Z","title":"The power of multiple choices in online stochastic matching","venue":null,"work_id":"0281c89a-c083-4db7-84f3-2b27d3bfd8d7","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.581387Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:62f6114e2592030cc28c9d8d45758bd6c907ddfd96d9263530239ad3a3378c28","observation_id":"95b5c10c-c249-4a9c-9552-acf857eae0bc","resolution":{"observed_at":"2026-08-12T22:02:02.206499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.186185Z","title":"Online matching: A brief survey","venue":null,"work_id":"d4aa24bc-d17a-4d78-b04b-a2117ddd6565","year":2024},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.585795Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:144c893f580224beedf33df6e88df5adb6cba044a040b3bb5decae60a42bb4a2","observation_id":"9f306362-adea-4e28-9c96-235d6c0d0f3f","resolution":{"observed_at":"2026-08-12T22:02:02.190629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.172523Z","title":"Fully online matching ii: Beating ranking and water-filling","venue":null,"work_id":"18b5d383-e3b9-4928-8ffa-ff99edbb4885","year":2020},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.590274Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:2e9e576a421af78af10252ccbbdf02c2df66bcafa271cc56451887daec7579ce","observation_id":"afe4f74d-9424-4340-8565-e22c25c50589","resolution":{"observed_at":"2026-08-12T22:02:02.176612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.159389Z","title":"Tail bounds for sums of geometric and exponential variables","venue":null,"work_id":"dd5a8637-0e27-4106-ad9b-29bdae5fb4d0","year":2018},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.594417Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:8956d5d44f89a0cc5300cab2290d321170f53506435a421d620e9f8bf7dae301","observation_id":"a8330527-8944-4628-aafa-5ac8857cb5b4","resolution":{"observed_at":"2026-08-12T22:02:02.163944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.144951Z","title":"Online stochastic matching: New algorithms with better bounds","venue":null,"work_id":"b95f7353-b8bc-46b6-b6a3-1841b3a065c1","year":2013},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.599101Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:0570d2c34abc3dc7cdf10e1ad84df5b6778b5db3bd3b18eec7b3808cfdbb86cd","observation_id":"1e5d2ec3-8102-40f5-9bf8-00062852b832","resolution":{"observed_at":"2026-08-12T22:02:02.151070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.132119Z","title":"Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model","venue":null,"work_id":"45f80583-7219-4a0a-82df-c52ab2788ef5","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.603737Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:e3e9164b0775e0f9b6f423ee3307161fc7d4f15dcb4f744abd4047f01cf18e00","observation_id":"4193b3c6-6185-4343-8999-0f4d315d6037","resolution":{"observed_at":"2026-08-12T22:02:02.136547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.114107Z","title":"Stochastic inequalities on partially ordered spaces","venue":null,"work_id":"827be5f6-a635-432e-bc81-32b0076d793f","year":1977},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.608604Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:a9b01d8c5705dba0a1c9cfaf85cc3cde1da26b1930471d31b77e8ab25b48fff7","observation_id":"57512f36-cc20-450d-b4f2-3784a39cd7f5","resolution":{"observed_at":"2026-08-12T22:02:02.118447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.099377Z","title":"The stationary prophet inequality problem","venue":null,"work_id":"c2916f7b-0196-4c9a-b357-620a77969329","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.614300Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:302f96b557186a55b1085ec50ba6b010a1b939bc809ee1af33877b84aaec2cfa","observation_id":"a47856b2-5785-4736-b6f2-c1f74b30528c","resolution":{"observed_at":"2026-08-12T22:02:02.104201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.084744Z","title":"An optimal algorithm for on-line bipartite matching","venue":null,"work_id":"5cbcf1e2-5fee-4cc5-8917-18e44e3ce671","year":1990},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.618585Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:a20f1f7790218ab47217fed64399ebbdb842c0c4e0a7a8fb32581c490db2c491","observation_id":"2ed174a4-4c35-4a6d-b404-b0aa28f7d592","resolution":{"observed_at":"2026-08-12T22:02:02.089692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.068266Z","title":"Matroid prophet inequalities and applications to multi-dimensional mechanism design","venue":null,"work_id":"f29b05bd-7561-495b-beb4-2a845aafabbb","year":2019},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.622880Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:daa9a067547e6215fd2839bbde6ca954e1991e224c57fb73d608c2c3feecc5ac","observation_id":"7ca80547-1cf3-4fc0-8ec0-8a9bfcfb7c69","resolution":{"observed_at":"2026-08-12T22:02:02.072972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.053496Z","title":"Stochastic domination and markovian couplings","venue":null,"work_id":"4fa09311-62df-471e-8491-339f9a5465ce","year":2000},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.626714Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:88d99a15959f19abb3ab8ec252cc69d63041faad5151c17dce47c33cf038eabd","observation_id":"1ea31de4-4d02-45d3-a8f7-8b59fe335dc5","resolution":{"observed_at":"2026-08-12T22:02:02.057874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.038978Z","title":"Fully online matching with stochastic arrivals and departures","venue":null,"work_id":"3fddc2b5-bf95-4698-85c5-53a62e977d73","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.630518Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:0b375201dfe7680241f4685d0be6060e6ca430467e84f7254f4fb8a9ce77f3e4","observation_id":"cc77ca8b-1266-4cdf-a77f-4735604a3413","resolution":{"observed_at":"2026-08-12T22:02:02.043707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.026304Z","title":"A product form for the general stochastic matching model","venue":null,"work_id":"2a7dd19e-272f-4367-b4ee-e22cf48ae2a6","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.634590Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:09a93f733664cbb5b3c27e01d2cd36e8c1cd70a35559f33f491f429c6d874178","observation_id":"d181c623-44ea-48bb-b74c-715bf92dbd1d","resolution":{"observed_at":"2026-08-12T22:02:02.030924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:02.012346Z","title":"Online stochastic matching: Online actions based on offline statistics","venue":null,"work_id":"596c3233-6893-485e-8c44-8848bd5bb692","year":2012},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.638683Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:0b1950be8155ed2e5533a831d66098e0dab2837a8ead186c0548356669131ea6","observation_id":"a9e8bf20-7cbe-4f1a-874c-1157ac71ca55","resolution":{"observed_at":"2026-08-12T22:02:02.017172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.997256Z","title":"Stability of the stochastic matching model","venue":null,"work_id":"75c848cc-1cbf-453a-b25f-3e0ae68e3712","year":2016},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.643344Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:d5b239a4a43cc3f7c710fef387a5090c1853037e921f8059e522e760e1560927","observation_id":"6ca6119e-0ec2-43ff-8c1e-b78bbe1fc156","resolution":{"observed_at":"2026-08-12T22:02:02.002332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.984331Z","title":"Online matching with stochastic rewards","venue":null,"work_id":"18493653-1682-4bfa-8fd9-02f84ff90cfc","year":2012},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.648052Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:691cb9a615e32f2846f42bc047e48097a69860f4cb19ca435619acd860a3ac60","observation_id":"e7429c5b-bc20-4459-8616-4d215edf9471","resolution":{"observed_at":"2026-08-12T22:02:01.988687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.971596Z","title":"Adwords and generalized online matching","venue":null,"work_id":"0301718a-9b07-4f9e-8bc3-c32a23623b8f","year":2007},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.652404Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:0a0ad0097c19b48e5a772ccca285f0b3a8c8aa0bcef22a1b933293a1b5d661a6","observation_id":"ffcea5db-9573-451c-b78d-c532ba1c6728","resolution":{"observed_at":"2026-08-12T22:02:01.976353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.08680","last_updated":"2024-10-29T04:57:38Z","snapshot_observed_at":"2026-08-16T16:01:07.194649Z","submitted_at":"2023-01-20T17:06:33Z","title":"Online Dependent Rounding Schemes for Bipartite Matchings, with Applications","version":3},"cited_work":{"arxiv_id":"2301.08680","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.08680","snapshot_observed_at":"2026-08-12T22:02:01.785959Z","title":"Online Dependent Rounding Schemes for Bipartite Matchings, with Applications","venue":"cs.DS","work_id":"0ad0b128-14bf-475c-92b3-bac33f4ecd3c","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.656977Z"},"links":{"cited_paper":"/paper/2301.08680","citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:7bb4077854ec4f5eef014f04b907217822cb999a0d8b5bb46a1bfdb49f3b8081","observation_id":"731297ea-4e69-4a6e-b6d6-9c3e7cbc2e80","resolution":{"observed_at":"2026-08-12T22:02:01.791613Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.958334Z","title":"Dynamic matching for real-time ride sharing","venue":null,"work_id":"bb791019-1564-448e-8153-e7ceb05363cd","year":2020},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.661516Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:15e559502f6db154f298cc05dea8ea5dcc19f19a6652cf96c4b10c95b4793309","observation_id":"ea6f19ee-5ae4-4bc0-b736-f0d683781233","resolution":{"observed_at":"2026-08-12T22:02:01.962836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.943948Z","title":"Online stochastic max-weight bipartite matching: Beyond prophet inequalities","venue":null,"work_id":"29124c6f-a93c-46ee-aae0-e0bdd2669a11","year":2023},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.665613Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:3b6ca271174eb23f1a81811c2e7ee593a87f7bf344638ef32a8000ee2109689b","observation_id":"402146c4-287a-4f00-a10c-2737fbaa2491","resolution":{"observed_at":"2026-08-12T22:02:01.949593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.669878Z","title":"Markov decision processes: discrete stochastic dynamic programming","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.669878Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:567a1029b95f426ceb085d63d333da34e3118c21c9506e8fa69b719bd47a67d2","observation_id":"ad9993a8-267d-48c6-885e-37dac6dc3cd7","resolution":{"observed_at":"2026-08-12T22:02:01.669878Z","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-12T22:02:01.920768Z","title":"Combinatorial stationary prophet inequalities","venue":null,"work_id":"43bb45c8-036d-48b3-89be-1f4e2e618415","year":2024},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.673764Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:ee1d65dde04fdf751c4d79c4bae2c72288c0957e067cb0026f3bb50a33e2028d","observation_id":"15d250b0-1bd8-4fce-8e4d-bb4accee928c","resolution":{"observed_at":"2026-08-12T22:02:01.924948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.906196Z","title":"Distributions on level-sets with applications to approximation algorithms","venue":null,"work_id":"425e26f4-2a11-4097-822a-0c74967d93e9","year":2001},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.677505Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:dbbacd6097442947f9b25a3ca5fb93c983b2dbf318b175794b789a1e97f1ec63","observation_id":"c51e675a-23f1-4691-b436-087ea823f213","resolution":{"observed_at":"2026-08-12T22:02:01.911570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.891602Z","title":"Stochastic orders","venue":null,"work_id":"eff71335-1137-40c1-b163-015723698fec","year":2007},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.681791Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:80cc5f7f77010485fc7f10e0f8d010c54cdffc946b1da750c7d9e7957e815bf2","observation_id":"33a71c03-42ee-44ee-b293-0f61b0f2fa35","resolution":{"observed_at":"2026-08-12T22:02:01.896925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.878600Z","title":"The greedy algorithm is not optimal for online edge coloring","venue":null,"work_id":"6f8b2a5a-f760-40fc-aef0-e3d26329551d","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.685653Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:e3d9cf0bd499dd462f164b1fbd531515268fe9722868e9df71abff42f158b352","observation_id":"dab3b5cb-2990-4b26-8464-a1f8cd9f4755","resolution":{"observed_at":"2026-08-12T22:02:01.883134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.865721Z","title":"(fractional) online stochastic matching via fine-grained offline statistics","venue":null,"work_id":"021a6106-b082-41a7-9989-d79ec52db8c7","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.690695Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:cd0c7d58ab9871b91b1203f2604c777918f419a2e9f5c9c603cdadb234c9ad98","observation_id":"43e55c56-a021-4920-b2d7-ef5260c126ad","resolution":{"observed_at":"2026-08-12T22:02:01.870493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02948","last_updated":"2022-02-08T11:52:21Z","snapshot_observed_at":"2026-08-18T10:33:08.667300Z","submitted_at":"2022-02-07T05:12:26Z","title":"Improved Bounds for Fractional Online Matching Problems","version":2},"cited_work":{"arxiv_id":"2202.02948","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.02948","snapshot_observed_at":"2026-08-12T22:02:01.767791Z","title":"Improved Bounds for Fractional Online Matching Problems","venue":"cs.DS","work_id":"8f182b2a-d610-44bc-9c1e-5bc0f4629286","year":2022},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.694634Z"},"links":{"cited_paper":"/paper/2202.02948","citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:79cd359a1297462bca01bfdc76cb46398b848716f59a59ceee63e1fdb4e7d6c5","observation_id":"e56b3de5-524e-488b-bd29-1cad43d1c87a","resolution":{"observed_at":"2026-08-12T22:02:01.772597Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.13167","last_updated":"2023-01-06T22:07:07Z","snapshot_observed_at":"2026-08-18T10:10:06.879747Z","submitted_at":"2021-08-11T16:16:01Z","title":"Transportation Polytope and its Applications in Parallel Server Systems","version":2},"cited_work":{"arxiv_id":"2108.13167","doi":null,"metadata_source":"pith","pith_arxiv_id":"2108.13167","snapshot_observed_at":"2026-08-12T22:02:01.742705Z","title":"Transportation Polytope and its Applications in Parallel Server Systems","venue":"cs.NI","work_id":"ecb970ee-eca0-4e3f-9a26-38a57e0e6223","year":2021},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.699109Z"},"links":{"cited_paper":"/paper/2108.13167","citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:35cce226da594f05414d37f953bd10562a2fc0f53da0b2b72b7643634efcf3bc","observation_id":"3ffca689-7246-4a0a-8224-2849d8b1c4ad","resolution":{"observed_at":"2026-08-12T22:02:01.749723Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.852134Z","title":"Poisson arrivals see time averages","venue":null,"work_id":"6f75bfb8-5f2a-4e43-a958-ee1b78e1ae71","year":1982},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.703242Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:d602ef3c92870d20bb1e6efb50d5e5cde08a72a254b712aca9ff8c70f92e65f0","observation_id":"f3d638e2-7cd7-44b5-906c-72f508b364b9","resolution":{"observed_at":"2026-08-12T22:02:01.857477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T22:02:01.835897Z","title":"Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm","venue":null,"work_id":"af10bbf3-dfc9-438f-a0df-c12b20c0c8a2","year":2015},"citing_paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-12T22:02:01.706869Z"},"links":{"citing_paper":"/paper/2411.08218"},"observation_digest":"sha256:f0726d73cf511db9de34745c839683867971e23e44172173e2e0fbda3ca6b915","observation_id":"56452238-ff3e-480b-bf4f-fb3750cf614c","resolution":{"observed_at":"2026-08-12T22:02:01.841271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.08218","last_updated":"2024-11-12T22:21:09Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T21:48:25.215478Z","submitted_at":"2024-11-12T22:21:09Z","title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":5,"verified_fuzzy":55},"total_outbound_references":64},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 4 inbound Pith citation observations for arXiv:2411.08218."}