{"as_of":"2026-08-08T14:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9805e97b216a79abf4e92868416a7e97d6ea7496bd32b7379e0c12612218d1c4","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:18:50.289334Z","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-05-10T05:36:02.294829Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.04752","last_updated":"2021-10-10T10:14:47Z","snapshot_observed_at":"2026-07-06T11:56:14.394370Z","submitted_at":"2021-10-10T10:14:47Z","title":"How Robust are Limit Order Book Representations under Data Perturbation?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.04752","snapshot_observed_at":"2026-08-07T10:18:50.289334Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.05764","last_updated":"2025-06-09T22:37:07Z","snapshot_observed_at":"2026-08-07T10:11:11.907053Z","submitted_at":"2025-06-06T05:43:30Z","title":"Exploring Microstructural Dynamics in Cryptocurrency Limit Order Books: Better Inputs Matter More Than Stacking Another Hidden Layer","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:18:50.289334Z"},"links":{"cited_paper":"/paper/2110.04752","citing_paper":"/paper/2506.05764"},"observation_digest":"sha256:5d5282e12c41f4942bffd1388f676fa117cdbc621fe44331603cfbccf80735a7","observation_id":"50e4a66a-d8aa-4755-84e1-66dccc40e0b5","resolution":{"observed_at":"2026-08-07T10:18:50.289334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.04752","last_updated":"2021-10-10T10:14:47Z","snapshot_observed_at":"2026-07-06T11:56:14.394370Z","submitted_at":"2021-10-10T10:14:47Z","title":"How Robust are Limit Order Book Representations under Data Perturbation?","version":1},"cited_work":{"arxiv_id":"2110.04752","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.04752","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"How robust are limit order book representations under data perturbation?","venue":null,"work_id":"5bfb0264-04b6-47f1-9c0a-31aed6046775","year":2021},"citing_paper":{"arxiv_id":"2604.18130","last_updated":"2026-04-24T12:54:07Z","snapshot_observed_at":"2026-07-06T23:05:04.279268Z","submitted_at":"2026-04-20T11:52:54Z","title":"An `Inverse' Experimental Framework to Estimate Market Efficiency","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-10T05:30:05.358574Z"},"links":{"cited_paper":"/paper/2110.04752","citing_paper":"/paper/2604.18130"},"observation_digest":"sha256:7f1b58d94e1d1827934580de4950372eb7502110a587e998653f7c137c4db339","observation_id":"1e406b16-a284-41db-bec2-41715204dfb4","resolution":{"observed_at":"2026-05-10T05:36:02.296421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.04752/citation-record","integrity":"/paper/2110.04752/integrity","json":"/paper/2110.04752/citation-record.json","paper":"/paper/2110.04752"},"outbound":[],"paper":{"arxiv_id":"2110.04752","last_updated":"2021-10-10T10:14:47Z","latest_version":1,"primary_category":"q-fin.TR","snapshot_observed_at":"2026-07-06T11:56:14.394370Z","submitted_at":"2021-10-10T10:14:47Z","title":"How Robust are Limit Order Book Representations under Data Perturbation?"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.04752."}