{"as_of":"2026-08-07T05:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2925e25822db861324122e94a61e7d17c6a7d53a20d2773e505b46447587e247","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T09:48:57.104874Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T12:36:56.395060Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.03699","last_updated":"2024-05-29T01:12:01Z","snapshot_observed_at":"2026-07-06T13:07:41.269349Z","submitted_at":"2022-05-07T18:28:20Z","title":"Dynamic Matching Bandit For Two-Sided Online Markets","version":3},"cited_work":{"arxiv_id":"2205.03699","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.03699","snapshot_observed_at":"2026-07-02T12:36:56.395060Z","title":"Dynamic matching bandit for two-sided online markets.arXiv preprint arXiv:2205.03699, 2022","venue":null,"work_id":"e4e1ee5e-b3f6-4bc2-bb87-0b4eb789d153","year":2022},"citing_paper":{"arxiv_id":"2606.06744","last_updated":"2026-06-08T23:16:36Z","snapshot_observed_at":"2026-07-06T23:46:28.942186Z","submitted_at":"2026-06-04T21:57:23Z","title":"Learn to Match: Two-Sided Matching with Temporally Extended Feedback","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T02:02:59.456136Z"},"links":{"cited_paper":"/paper/2205.03699","citing_paper":"/paper/2606.06744"},"observation_digest":"sha256:4327fcede8632987401240aaefabbb8f3f6b7e82b15f9947ff192e79cd74b1e2","observation_id":"453ef523-fd07-411c-affe-19a705e49561","resolution":{"observed_at":"2026-07-02T12:36:56.397478Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.03699","last_updated":"2024-05-29T01:12:01Z","snapshot_observed_at":"2026-07-06T13:07:41.269349Z","submitted_at":"2022-05-07T18:28:20Z","title":"Dynamic Matching Bandit For Two-Sided Online Markets","version":3},"cited_work":{"arxiv_id":"2205.03699","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.03699","snapshot_observed_at":"2026-07-02T12:36:56.395060Z","title":"Dynamic matching bandit for two-sided online markets.arXiv preprint arXiv:2205.03699, 2022","venue":null,"work_id":"e4e1ee5e-b3f6-4bc2-bb87-0b4eb789d153","year":2022},"citing_paper":{"arxiv_id":"2606.29221","last_updated":"2026-07-23T18:53:57Z","snapshot_observed_at":"2026-08-06T09:45:02.560417Z","submitted_at":"2026-06-28T06:13:22Z","title":"A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-30T08:50:01.355410Z"},"links":{"cited_paper":"/paper/2205.03699","citing_paper":"/paper/2606.29221"},"observation_digest":"sha256:97d26888f38e49dfbb680f98567c6c1a7dba932bbe26ddcbb7a5a079b51ddb3f","observation_id":"40fec2d8-eb61-4a04-be21-fdf8f4e25e4b","resolution":{"observed_at":"2026-06-30T08:54:29.796150Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.03699","last_updated":"2024-05-29T01:12:01Z","snapshot_observed_at":"2026-07-06T13:07:41.269349Z","submitted_at":"2022-05-07T18:28:20Z","title":"Dynamic Matching Bandit For Two-Sided Online Markets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.03699","snapshot_observed_at":"2026-08-02T09:48:57.104874Z","title":"Rate-optimal contextual online matching bandit.arXiv preprint arXiv:2205.03699,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.29221","last_updated":"2026-07-23T18:53:57Z","snapshot_observed_at":"2026-08-06T09:45:02.560417Z","submitted_at":"2026-06-28T06:13:22Z","title":"A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T09:48:57.104874Z"},"links":{"cited_paper":"/paper/2205.03699","citing_paper":"/paper/2606.29221"},"observation_digest":"sha256:ba3bae22029f118c4d16be7aaa1a23c2cd299e97e3db74cd831f55fb4c3ac258","observation_id":"7ff5d5a3-cd35-45d0-b3ea-cb5e6e07fa06","resolution":{"observed_at":"2026-08-02T09:48:57.104874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2205.03699/citation-record","integrity":"/paper/2205.03699/integrity","json":"/paper/2205.03699/citation-record.json","paper":"/paper/2205.03699"},"outbound":[],"paper":{"arxiv_id":"2205.03699","last_updated":"2024-05-29T01:12:01Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:07:41.269349Z","submitted_at":"2022-05-07T18:28:20Z","title":"Dynamic Matching Bandit For Two-Sided Online Markets"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2205.03699."}