{"as_of":"2026-08-10T16:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95d2fcf400a59748b40989d90ebaf08c2c0a12324063e4fe458badf744e69079","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:31:08.297981Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T11:18:04.530379Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.13567","snapshot_observed_at":"2026-08-03T11:18:04.530379Z","title":"Hazard and T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.07144","last_updated":"2026-06-03T09:10:56Z","snapshot_observed_at":"2026-08-08T14:22:12.206234Z","submitted_at":"2026-01-12T02:26:32Z","title":"Optimal Transport under Group Fairness Constraints","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T11:18:04.530379Z"},"links":{"cited_paper":"/paper/2507.13567","citing_paper":"/paper/2601.07144"},"observation_digest":"sha256:40a8d852c45537ead601023f89aa3b2bc8142d6e4d904ebd5cff4355601eef2b","observation_id":"241ec9e6-e146-46ce-aa4e-55f833c55d31","resolution":{"observed_at":"2026-08-03T11:18:04.530379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.13567/citation-record","integrity":"/paper/2507.13567/integrity","json":"/paper/2507.13567/citation-record.json","paper":"/paper/2507.13567"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:03.719512Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:03.719512Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:63dd6b9ed154369c0230d6cb5568ac2272d8e4708cb77a5f515678a0303ed9eb","observation_id":"a95cf7fa-c493-4eb0-8f12-f5baaa3ca86c","resolution":{"observed_at":"2026-08-06T16:31:03.719512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:03.787625Z","title":"Fang, and H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:03.787625Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:011f9daa0af3adaec83e1fb06609801993531dc409a211fc2b03c3080cbf99d0","observation_id":"d4de7616-cd40-476e-ab0b-a8544011b6ca","resolution":{"observed_at":"2026-08-06T16:31:03.787625Z","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-06T16:31:14.736438Z","title":null,"venue":null,"work_id":"df3ed650-2a7d-4a18-b2f6-a5dc13d00db7","year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:03.872165Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:90dad039dbb72c985f6062f8cb189f03f352d8db431bc20714fb6cd3c3a746b6","observation_id":"a4856b22-8bb5-41c2-a272-7967defe0fcb","resolution":{"observed_at":"2026-08-06T16:31:14.808439Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:14.625113Z","title":"Cr \\'e pon, and M","venue":null,"work_id":"950fff07-1dd7-45f6-a76a-c7766a560f16","year":2014},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.024471Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:8ebf3c33878d2d19d03cd598365fe74c8e5e7e483ca4f97e8509bb84182186e2","observation_id":"b10cd6ee-f7ab-4ef6-a88e-7fda27ed3e65","resolution":{"observed_at":"2026-08-06T16:31:14.679741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:14.507599Z","title":"(2009): Inferring optimal peer assignment from experimental data, Journal of the American Statistical Association, 104, 486--500","venue":null,"work_id":"d9922874-17f7-4bfb-bfca-b1e8113730cd","year":2009},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.133687Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:b3bdb2dc735458ed20ae97fe0593d3a29c60058cf3bd768706e8497db18dd616","observation_id":"1ffac4dc-a50c-4b63-b88e-f73d6080789b","resolution":{"observed_at":"2026-08-06T16:31:14.560832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:14.354213Z","title":null,"venue":null,"work_id":"79940c44-b0d0-4e97-9b68-50adb867dd24","year":2012},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.234244Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:6505922f5fa12682bbc8c45d28874e0ab9dc8d6f2fa3f38ec0f96166cd2819e7","observation_id":"b19d0b6d-2141-4c17-84d2-d886a23005aa","resolution":{"observed_at":"2026-08-06T16:31:14.418230Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:14.249902Z","title":"(1946): Tres Observaciones Sobre el Algebra Lineal, Universidad Nacionale de Tucum\\' a n Revista Series","venue":null,"work_id":"fb7db9e3-5c49-4a43-9878-7160b7329f4e","year":1946},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.340495Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:c15d35f78016a0adff313457722c73c1ca499746d87520cf75075191e777cf56","observation_id":"5260f62d-daf4-45b1-a2f1-2d9cf66681a6","resolution":{"observed_at":"2026-08-06T16:31:14.287847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:14.155000Z","title":"Galichon, M","venue":null,"work_id":"5c88557e-679b-42ad-aa02-3bfa4272b60b","year":2017},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.435165Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:ac25acdc5342e61cecbad8299cc029571e4a8ff446172bead777121f745b923a","observation_id":"74cc21db-5647-4bd2-aa0a-9f66462b9ffd","resolution":{"observed_at":"2026-08-06T16:31:14.201680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:04.521237Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.521237Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:4f6c91640d1cb80d5a5634d205afcc60f45f76c05f1c41cd91d3910841f147e5","observation_id":"6f61df28-043a-46f2-93d6-3a42f4d5cfcd","resolution":{"observed_at":"2026-08-06T16:31:04.521237Z","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-06T16:31:13.997244Z","title":"(2013): Sinkhorn Distances: Lightspeed Computation of Optimal Transport, in Advances in Neural Information Processing Systems, ed","venue":null,"work_id":"19ac2a61-182e-4c9e-96c0-67bfc6bc9da9","year":2013},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.610901Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:d3263895d1aa177e877cc0b59c041782b3525c9e3151ad98b66205823f55210b","observation_id":"bcd1ac1c-b1c6-40a4-9a92-bb731426abb7","resolution":{"observed_at":"2026-08-06T16:31:14.072798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.919016Z","title":"(2024): Defying Distance? The Provision of Services in the Digital Age, Working Paper","venue":null,"work_id":"69ab684d-d50e-4c5c-9480-da75e4545edb","year":2024},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.725797Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:7d7108797747bdbbe0870aa0c4a4be1bbbd1c073f39658a163857919b53f8eca","observation_id":"7cb66d04-6196-4eef-b74e-6e924aa338e8","resolution":{"observed_at":"2026-08-06T16:31:13.955640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.789499Z","title":null,"venue":null,"work_id":"57345382-9da1-420c-b3db-e2633f53becf","year":2005},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.841692Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:e5ab94ca35ce524575d71e02bf4585f22986ded29281a4c2884dbbd17cbed8d9","observation_id":"cc55a6e0-fed9-424c-a361-8de7d7f72d53","resolution":{"observed_at":"2026-08-06T16:31:13.873115Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.667707Z","title":"Gaillac, and A","venue":null,"work_id":"7ea12a8a-03a6-420b-af7e-ecc91e371b3f","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:04.962869Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:6c8740f9b01f8e85760d0fe97fdd991dc6492f2ff55324f959b65b09434dcd75","observation_id":"3b813c9c-8adf-47f5-8859-67a7659ab856","resolution":{"observed_at":"2026-08-06T16:31:13.736967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.568899Z","title":null,"venue":null,"work_id":"e58ef59f-4d45-4486-86c0-7622ac401d5e","year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.081026Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:145c239b55f963b660c0193466bfba16ea3be10efc1c8e9aca0b1dfb03dc7959","observation_id":"aee696f9-3292-4d00-81b1-764c8dd30acf","resolution":{"observed_at":"2026-08-06T16:31:13.619416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.486486Z","title":null,"venue":null,"work_id":"5d2b89d3-9bd5-4b68-97f1-77f54ac4c8d0","year":2014},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.255940Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:0435f47db871b753a10384b0c9ff3e32fa61760d17424dc5a63c5c359678a852","observation_id":"1efbdc9a-d943-4930-b21d-ba75baed0de3","resolution":{"observed_at":"2026-08-06T16:31:13.506846Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.393721Z","title":"Heckman, and L","venue":null,"work_id":"8877ab87-a4e6-45f8-9215-bb20142a03d8","year":2004},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.374141Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:bd391b08d66df74899dcb6a40a13432f9b32dbe7965881c585649cb6bfeefd42","observation_id":"c757e2e3-c46c-4653-821b-182d862803f1","resolution":{"observed_at":"2026-08-06T16:31:13.442585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.245649Z","title":"(2016): Optimal Transport Methods in Economics, Princeton University Press","venue":null,"work_id":"3fe6baf6-258c-47f4-965d-4b07cc169ae3","year":2016},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.481749Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:81bdc16af8e5243b0600aca64b2b71f33c4b85df44bff060d4a67efbb1317520","observation_id":"78d6587b-4985-4224-b221-78c7f0959a79","resolution":{"observed_at":"2026-08-06T16:31:13.296440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.159923Z","title":null,"venue":null,"work_id":"32bafa68-0d02-4101-8eb4-c94d4d3e48e5","year":2011},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.571655Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:1b189b961b8a633e867a29bea4ca7db17fb834e937f56c6b3a582d30632e6db2","observation_id":"bc943f94-d030-48f1-8772-845d010f4a11","resolution":{"observed_at":"2026-08-06T16:31:13.196905Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:13.046819Z","title":null,"venue":null,"work_id":"eebe425c-1c73-4669-8ac6-472eaeb69f8d","year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.624169Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:54c4ed2379028d890ed61bef796d4d389dab974dc01cc20b11a24908d4587c7d","observation_id":"17a3df63-6d87-450b-862e-8b1bf9552468","resolution":{"observed_at":"2026-08-06T16:31:13.096235Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.906034Z","title":"Chizat, F","venue":null,"work_id":"780c16e2-dfe9-49cd-a682-d67f02ada028","year":2019},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.705181Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:ffd70d321bed2d74a990c74c2609bfe0effb32daa3476a9cccde6d51fe876e0c","observation_id":"e6fda17e-731b-4f27-8677-ee8811866bed","resolution":{"observed_at":"2026-08-06T16:31:12.953177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.766002Z","title":null,"venue":null,"work_id":"1d90dd94-4357-41ae-bb21-2c2399c7fcf6","year":2011},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.775163Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:5fa200fa996ff407206217191478b8a885c85240bd2ac4d45703761c566fd28e","observation_id":"6d0d677d-4d48-46e1-b431-5f8ee8487973","resolution":{"observed_at":"2026-08-06T16:31:12.838336Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.632541Z","title":null,"venue":null,"work_id":"52f2a43a-2c42-4816-91a5-d094fec0d59a","year":2014},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.872207Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:4706ebe3d5800009053cbb3f0704ce1a5065ec260d2fc1293799145fc5325aaf","observation_id":"76f7da68-2e45-42b7-896d-ae6f3252c41e","resolution":{"observed_at":"2026-08-06T16:31:12.691736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.512727Z","title":null,"venue":null,"work_id":"2fb4a3fc-e1f2-49d0-a5cb-f0159413dc10","year":2020},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:05.938744Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:140ea39d889e8d39efc6fb771f964992b54ede14819c4eb9da84de8c1f46fb78","observation_id":"945fc9ac-4821-4237-83f2-07bf41c38287","resolution":{"observed_at":"2026-08-06T16:31:12.585704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.351561Z","title":null,"venue":null,"work_id":"7e101716-e439-4ecf-8366-a8faaed1ceec","year":2023},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.007878Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:1eb4af889bdd5ba0c8dd4f56d956a1b82bd456ac0d860e867d0c161e5d95bde9","observation_id":"436b051e-5f92-4198-9a90-77ea09a2d9c2","resolution":{"observed_at":"2026-08-06T16:31:12.438475Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.231127Z","title":"(2023): Distributional synthetic controls, Econometrica, 91, 1105--1117","venue":null,"work_id":"df7ae5bb-4996-4c93-b864-b91755ade1cc","year":2023},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.074939Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:b6c43439f967ebf0e595d8ed57bccb4ed6bf8b69893099357a4638af6049194b","observation_id":"168b67c0-a56b-442b-9cbc-d94ac1799ca5","resolution":{"observed_at":"2026-08-06T16:31:12.311945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:12.108379Z","title":null,"venue":null,"work_id":"ff654716-54c5-4654-831c-94c44dc78f87","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.135011Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:bbbe7497d77a59692c6d1dec786e37cf29822d2a13848e71950fd54e009dda96","observation_id":"7cf27000-79ad-45a8-93ba-747b66030020","resolution":{"observed_at":"2026-08-06T16:31:12.168699Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:11.948469Z","title":null,"venue":null,"work_id":"57af9eed-214d-45f6-9cf5-8399836f92b6","year":2009},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.208311Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:3befd6c7f6d50e46c85fdf2eb85675b5c8ff3de5189d77894befa1ef902f01fd","observation_id":"69f3c005-66ec-4e74-a5c4-6fd0df7c416a","resolution":{"observed_at":"2026-08-06T16:31:12.032802Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:11.752462Z","title":"Mordant, C","venue":null,"work_id":"26116656-f311-4bea-bd8a-00a7eb6895c8","year":2024},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.306631Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:d9b6417982ad7a1d8d7ae4fd7cdab6708bef785fa44188fceed8377744a26fd9","observation_id":"5b5d6f4e-689c-4049-b2b8-67f5aa4618c8","resolution":{"observed_at":"2026-08-06T16:31:11.879396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06473","last_updated":"2026-07-05T07:01:26Z","snapshot_observed_at":"2026-08-04T10:43:31.599731Z","submitted_at":"2021-08-14T05:53:42Z","title":"Evidence Aggregation for Treatment Choice","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06473","snapshot_observed_at":"2026-08-06T16:31:06.362630Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.362630Z"},"links":{"cited_paper":"/paper/2108.06473","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:dea8510d89b905ea1dd121013ba98dca6a133d53a4c857c003dec5a0a14c8830","observation_id":"9665f261-884c-4886-97e2-4b1527263a9a","resolution":{"observed_at":"2026-08-06T16:31:06.362630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08115","last_updated":"2024-11-17T05:39:29Z","snapshot_observed_at":"2026-08-10T15:36:01.303097Z","submitted_at":"2023-10-12T08:17:30Z","title":"Model-Agnostic Covariate-Assisted Inference on Partially Identified Causal Effects","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08115","snapshot_observed_at":"2026-08-06T16:31:06.442009Z","title":"Lei, and A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.442009Z"},"links":{"cited_paper":"/paper/2310.08115","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:0bb015a90218648ab622f110137d95cba3233d0def6fa289649f57be964a6527","observation_id":"0f0a2536-634a-49b9-b592-a2b3cf5d44ff","resolution":{"observed_at":"2026-08-06T16:31:06.442009Z","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-06T16:31:11.465946Z","title":null,"venue":null,"work_id":"12abf1d8-98de-4172-9462-f827b3dcbfe5","year":2018},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.527559Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:0abf0166f0fafc0d5d6fa22f4a6553288fc0fce895cbc0555c1cf49ca9b5f57c","observation_id":"429b00b1-300b-4dbd-8766-afa066b75199","resolution":{"observed_at":"2026-08-06T16:31:11.634255Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04637","last_updated":"2022-08-06T20:11:10Z","snapshot_observed_at":"2026-07-06T13:08:19.981895Z","submitted_at":"2022-05-10T02:51:46Z","title":"Distributionally Robust Policy Learning with Wasserstein Distance","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04637","snapshot_observed_at":"2026-08-06T16:31:06.608012Z","title":"(2022): Distributionally robust policy learning with wasserstein distance, arXiv preprint arXiv:2205.04637","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.608012Z"},"links":{"cited_paper":"/paper/2205.04637","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:a8be661ddc017c4a44b1050d9f6ea4d477c58b74a4ff4dc52eff7fe2bc935bf0","observation_id":"2e7d53d3-103c-43be-a420-d4880a97355f","resolution":{"observed_at":"2026-08-06T16:31:06.608012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.08586","last_updated":"2024-10-01T20:01:10Z","snapshot_observed_at":"2026-07-06T13:10:56.430851Z","submitted_at":"2022-05-17T19:06:12Z","title":"Treatment Choice with Nonlinear Regret","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.08586","snapshot_observed_at":"2026-08-06T16:31:06.675592Z","title":"Lee, and C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.675592Z"},"links":{"cited_paper":"/paper/2205.08586","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:c594210d3bbc463f66673a1006b93c5f04caf75e70fe61883405f05e325859d7","observation_id":"28789245-9574-478f-8f9c-e044a99aeb8f","resolution":{"observed_at":"2026-08-06T16:31:06.675592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16430","last_updated":"2026-04-06T13:07:32Z","snapshot_observed_at":"2026-07-06T21:44:52.595410Z","submitted_at":"2025-06-19T16:07:47Z","title":"Leave No One Undermined: Policy Targeting with Regret Aversion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.16430","snapshot_observed_at":"2026-08-06T16:31:06.774582Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.774582Z"},"links":{"cited_paper":"/paper/2506.16430","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:c72f5b7e68b497ac791005d3fe69b2634327081f05edd9c67c00c2bfdf16962a","observation_id":"e6327502-7ea6-40b4-a888-eea2efd1c2e4","resolution":{"observed_at":"2026-08-06T16:31:06.774582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.12886","last_updated":"2023-07-24T20:12:59Z","snapshot_observed_at":"2026-07-06T11:22:25.734836Z","submitted_at":"2021-06-24T10:43:00Z","title":"Constrained Classification and Policy Learning","version":2},"cited_work":{"arxiv_id":"2106.12886","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.12886","snapshot_observed_at":"2026-08-06T16:31:08.829690Z","title":"Constrained Classification and Policy Learning","venue":"econ.EM","work_id":"65b26d40-832b-4dce-b320-87511047c57f","year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.842473Z"},"links":{"cited_paper":"/paper/2106.12886","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:c75daa3d59a156a7f6da1eea4c332192048eb2a2ae30adf4e8b6c3c2c7734a93","observation_id":"2b167059-b62c-4376-933a-ee86b793254a","resolution":{"observed_at":"2026-08-06T16:31:08.896908Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:11.328568Z","title":null,"venue":null,"work_id":"dd479815-f821-4401-a24c-8fa8ef312a1b","year":2018},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:06.942081Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:340e77b0f32ef70bf054487830e845da9655c52291ca8dcdc6fc7e8354d11040","observation_id":"223c1884-0ad5-4207-9caf-86acb8c4d028","resolution":{"observed_at":"2026-08-06T16:31:11.397059Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:11.148358Z","title":null,"venue":null,"work_id":"ad6d7026-2ccd-4923-9b12-ab7056424676","year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.042587Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:ce4069f56e731382ee50e7e8b24222cc0954bc2909430dc090437e55cefffad5","observation_id":"ec3cb045-9237-4a67-ae49-f203cff813ba","resolution":{"observed_at":"2026-08-06T16:31:11.237085Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:10.955892Z","title":null,"venue":null,"work_id":"f30c176f-bd6e-4d1b-8ace-a21784f98354","year":2004},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.095062Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:cd207d1c75684f724e9746d583809c7414d10ed0d2a92ec4f3724eff1855ee21","observation_id":"b4549554-4fcd-42f0-9101-c45cc833251d","resolution":{"observed_at":"2026-08-06T16:31:11.044680Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:10.806641Z","title":null,"venue":null,"work_id":"8be2c6c2-7a02-4b58-9aba-c05522776542","year":2023},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.144743Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:885aefc7e6259d4235463b4cb42d03fbe83bd79010696a27de20ccb5de397d63","observation_id":"aa007d84-e850-4872-8cc7-de7b85f56b31","resolution":{"observed_at":"2026-08-06T16:31:10.888380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:10.656806Z","title":null,"venue":null,"work_id":"c31a4729-d140-41b4-bdeb-a0fe4a731c91","year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.210290Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:71fbea6505c94cfad1e0e4b62bc9488325322b9996e83d6c3f029fc9031750c4","observation_id":"c430ac75-b463-47a9-b84e-737fd78ca0aa","resolution":{"observed_at":"2026-08-06T16:31:10.714496Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.17623","last_updated":"2025-06-20T18:46:06Z","snapshot_observed_at":"2026-07-06T17:09:55.651197Z","submitted_at":"2023-12-29T14:27:52Z","title":"Decision Theory for Treatment Choice Problems with Partial Identification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.17623","snapshot_observed_at":"2026-08-06T16:31:07.310844Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.310844Z"},"links":{"cited_paper":"/paper/2312.17623","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:1cc893e342d933529e16789e2b8748a18bafd25be747d3962812ab899cc64a29","observation_id":"02c09580-3a5f-4358-a2aa-eea1ff9c74d1","resolution":{"observed_at":"2026-08-06T16:31:07.310844Z","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-06T16:31:10.523058Z","title":"(2025): Should Top Surgeons Practice at Top Hospitals? Sorting and Complementarities in Healthcare, Working Paper","venue":null,"work_id":"0ab3b647-7478-43c3-9834-72c75f686c74","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.379297Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:9377874a7a8e218f00ac13e98d75e7db398645b346d063f5063a1f4df4b5a814","observation_id":"f594d045-8b25-45e4-8015-8543c4d4f86c","resolution":{"observed_at":"2026-08-06T16:31:10.583761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:10.381950Z","title":null,"venue":null,"work_id":"dc1779f0-239c-4df5-a2c9-57a69ac3b6e8","year":2019},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.444409Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:335f557bbc761ec8be120cd207a54ab0a2ef1bcaa074372136689f27222462e1","observation_id":"7e40dedd-09e9-427b-b137-b9cfac998102","resolution":{"observed_at":"2026-08-06T16:31:10.460794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:10.255269Z","title":null,"venue":null,"work_id":"7a9cf444-d7ce-49d3-90c5-1cbb48ce08c2","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.534139Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:cd64f653b75fc65c5148516430091d3acb089a6c360a84af8d86aa27b6814bc5","observation_id":"f6b5ab43-abf5-4ef2-b9a0-a0b8f781ccae","resolution":{"observed_at":"2026-08-06T16:31:10.313258Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05031","last_updated":"2024-08-31T02:00:56Z","snapshot_observed_at":"2026-07-06T11:17:31.238458Z","submitted_at":"2021-06-09T12:42:53Z","title":"Estimation of Optimal Dynamic Treatment Assignment Rules under Policy Constraints","version":5},"cited_work":{"arxiv_id":"2106.05031","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.05031","snapshot_observed_at":"2026-08-06T16:31:08.649945Z","title":"Estimation of Optimal Dynamic Treatment Assignment Rules under Policy Constraints","venue":"econ.EM","work_id":"e3807a8a-e800-458c-9427-84d3609a5f28","year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.611802Z"},"links":{"cited_paper":"/paper/2106.05031","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:2b498355e78c27a3aa2a72eca9d301004b8c1438f8dab6cfd0e80cccb9d1139b","observation_id":"51fb5b7e-46bc-4d80-b917-0da8cc5d6122","resolution":{"observed_at":"2026-08-06T16:31:08.688152Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:10.107615Z","title":null,"venue":null,"work_id":"b0e00d31-f9f4-484b-9667-ec37f910c3fc","year":2022},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.692894Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:737840d667fd0e8b7d6513e7e721a57dc1e753c61b7281a4d65bbd83625f1c17","observation_id":"45b93625-045a-4701-8222-6936625ec95b","resolution":{"observed_at":"2026-08-06T16:31:10.187309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:09.963660Z","title":null,"venue":null,"work_id":"31e188cd-fd84-41c1-85e6-b6ae511c6d45","year":1987},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.788229Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:deb66434510941a2e8974582e09137e1ed1538b1d98310038a192c16088412bf","observation_id":"fbd1010a-8140-49e2-b922-56369081d699","resolution":{"observed_at":"2026-08-06T16:31:10.027126Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:09.829383Z","title":"(2009): Minimax regret treatment choice with finite samples, Journal of Econometrics, 151, 70--81","venue":null,"work_id":"4817b03e-547e-4601-a2fc-75a5a7cc7264","year":2009},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.838165Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:9136f50ce064198754dc5f4e6c9036b4eca59e1562d9a5bdc4f59d92fa579b59","observation_id":"f096b724-47d4-44d4-94ac-19c2f877d8c6","resolution":{"observed_at":"2026-08-06T16:31:09.887065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:09.678056Z","title":null,"venue":null,"work_id":"6635fbfd-0c24-4e62-a131-61f2fb0778a2","year":2012},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.929485Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:f4bb5dc179fb2cf9cea2610662a95b879584d71f7450916e9e8c9eee6adff4d4","observation_id":"d01217b3-e9fd-46af-a2d3-1bca9339d108","resolution":{"observed_at":"2026-08-06T16:31:09.740177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:07.999219Z","title":"(2021): Empirical welfare maximization with constraints, arXiv preprint arXiv:2103.15298","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:07.999219Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:c12eac673610650546c695b8b4cc12dd1dacfb8a644d991d6ce3f615af4a5aed","observation_id":"48c5636d-c252-4f06-a523-1a02ca8fd57e","resolution":{"observed_at":"2026-08-06T16:31:07.999219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.12225","last_updated":"2025-09-10T22:37:26Z","snapshot_observed_at":"2026-08-07T00:52:59.273358Z","submitted_at":"2025-06-13T20:53:54Z","title":"Optimal treatment assignment rules under capacity constraints","version":2},"cited_work":{"arxiv_id":"2506.12225","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.12225","snapshot_observed_at":"2026-08-06T16:31:08.396084Z","title":"Optimal treatment assignment rules under capacity constraints","venue":"econ.EM","work_id":"f939b30e-c18d-4997-a38e-151f4451c1bb","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:08.063422Z"},"links":{"cited_paper":"/paper/2506.12225","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:36d3774e8f7dd99af3a8c79038cd722786495143d029bd32e8d653f5244c0583","observation_id":"27d97ac9-1713-4168-9b35-0e2d06eae4d8","resolution":{"observed_at":"2026-08-06T16:31:08.464946Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:09.484127Z","title":"(2012): Statistical treatment choice based on asymmetric minimax regret criteria, Journal of Econometrics, 166, 157--165","venue":null,"work_id":"3d911e84-fa8b-4e6a-a400-25fa066cf43d","year":2012},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:08.131463Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:355a340ad81f2f288c84f0e3ffc6fcf34f604d5f1530033f36c105fd7fc9527b","observation_id":"d11d50ef-5a40-48aa-bd55-253c27515acd","resolution":{"observed_at":"2026-08-06T16:31:09.540637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:09.350126Z","title":"(2025): Policy targeting under network interference, Review of Economic Studies, 92, 1257--1292","venue":null,"work_id":"5352fa8c-0af0-46ec-9e82-a5e3e1402316","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:08.197751Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:7fa5090e27e1e1655ba0ee4b1767a8b67af0b5d842b6525211abd56d4c5c6f12","observation_id":"a6f91384-0e1c-4323-afa4-50a487954cec","resolution":{"observed_at":"2026-08-06T16:31:09.403873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:31:09.229570Z","title":"Bessone, A","venue":null,"work_id":"1a09f009-d20d-43fd-873b-24cfe8cdcbe8","year":2025},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:08.258419Z"},"links":{"citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:82c025661c2bec33d0f64887093f49c9b773707e00481634e4fdf07a4d7a26b3","observation_id":"dc576722-7eb0-4eba-a43c-822efca2b672","resolution":{"observed_at":"2026-08-06T16:31:09.266453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.04926","last_updated":"2025-03-02T06:55:25Z","snapshot_observed_at":"2026-07-06T12:06:45.710444Z","submitted_at":"2021-11-09T03:20:59Z","title":"Optimal Decision Rules Under Partial Identification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.04926","snapshot_observed_at":"2026-08-06T16:31:08.297981Z","title":"(2021): Optimal decision rules under partial identification, arXiv preprint arXiv:2111.04926","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T16:31:08.297981Z"},"links":{"cited_paper":"/paper/2111.04926","citing_paper":"/paper/2507.13567"},"observation_digest":"sha256:fb24bca21e83b7d9c4b0858b01140ef9fb8db1e24d3fbd25bc2130810967715d","observation_id":"95ddccde-26b2-408a-9a60-c9ccb562da23","resolution":{"observed_at":"2026-08-06T16:31:08.297981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.13567","last_updated":"2025-07-17T23:04:07Z","latest_version":1,"primary_category":"econ.EM","snapshot_observed_at":"2026-08-10T03:49:49.460832Z","submitted_at":"2025-07-17T23:04:07Z","title":"Who With Whom? Learning Optimal Matching Policies"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":3,"verified_fuzzy":17},"total_outbound_references":55},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 1 inbound Pith citation observation for arXiv:2507.13567."}