{"as_of":"2026-08-21T12:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d613c169bc9ac96a6f8f1a7c654b7bb9c2a45bdc44e1a9fdaa34a2e048a3327","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-21T06:32:19.484+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-06T20:53:49.647011Z","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-05T15:53:43.980526Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.03591","last_updated":"2020-12-30T20:33:52Z","snapshot_observed_at":"2026-08-14T18:42:31.863093Z","submitted_at":"2018-08-10T15:38:14Z","title":"How Complex is your classification problem? A survey on measuring classification complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.03591","snapshot_observed_at":"2026-08-06T20:53:49.647011Z","title":"How complex is your classification problem? A survey on measuring classification complexity,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.01571","last_updated":"2025-07-02T10:47:42Z","snapshot_observed_at":"2026-08-06T20:45:43.551072Z","submitted_at":"2025-07-02T10:47:42Z","title":"On the Effect of Ruleset Tuning and Data Imbalance on Explainable Network Security Alert Classifications: a Case-Study on DeepCASE","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:53:49.647011Z"},"links":{"cited_paper":"/paper/1808.03591","citing_paper":"/paper/2507.01571"},"observation_digest":"sha256:82de3bf61f368f43d24d127d2e1621c3fb26d75e844b876a237456f5380ac96f","observation_id":"a0158727-df22-4bac-b1b1-d2d2010f9aac","resolution":{"observed_at":"2026-08-06T20:53:49.647011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.03591","last_updated":"2020-12-30T20:33:52Z","snapshot_observed_at":"2026-08-14T18:42:31.863093Z","submitted_at":"2018-08-10T15:38:14Z","title":"How Complex is your classification problem? A survey on measuring classification complexity","version":3},"cited_work":{"arxiv_id":"1808.03591","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.03591","snapshot_observed_at":"2026-08-05T15:53:43.980526Z","title":"How Complex is your classification problem? A survey on measuring classification complexity","venue":"cs.LG","work_id":"78f946cd-8e27-491e-a3a1-95c1ac67d8e6","year":2018},"citing_paper":{"arxiv_id":"2508.19437","last_updated":"2026-07-10T12:38:50Z","snapshot_observed_at":"2026-08-19T20:51:14.725880Z","submitted_at":"2025-08-26T21:14:52Z","title":"Is data-efficient learning feasible with quantum models?","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T15:53:43.688200Z"},"links":{"cited_paper":"/paper/1808.03591","citing_paper":"/paper/2508.19437"},"observation_digest":"sha256:c4e577b3b5b215efa86f4ffa35e87add44236747fd5d400492d5a1a4af4f7e1a","observation_id":"f8725ed0-8b21-4864-92e1-831d251a4154","resolution":{"observed_at":"2026-08-05T15:53:44.181002Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1808.03591/citation-record","integrity":"/paper/1808.03591/integrity","json":"/paper/1808.03591/citation-record.json","paper":"/paper/1808.03591"},"outbound":[],"paper":{"arxiv_id":"1808.03591","last_updated":"2020-12-30T20:33:52Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T18:42:31.863093Z","submitted_at":"2018-08-10T15:38:14Z","title":"How Complex is your classification problem? A survey on measuring classification complexity"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1808.03591."}