Pith. sign in

Paper Citation Record · LEDGER

How Complex is your classification problem? A survey on measuring classification complexity

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1808.03591 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T20:53:49.647011Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-05T15:53:43.980526Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation a0158727-df22-4bac-b1b1-d2d2010f9aac · inbound

On the Effect of Ruleset Tuning and Data Imbalance on Explainable Network Security Alert Classifications: a Case-Study on DeepCASE cites this paper.

On the Effect of Ruleset Tuning and Data Imbalance on Explainable Network Security Alert Classifications: a Case-Study on DeepCASE How Complex is your classification problem? A survey on measuring classification complexity

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-06T20:53:49.647011Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T20:53:49.647011Z digest=sha256:82de3bf61f368f43d24d127d2e1621c3fb26d75e844b876a237456f5380ac96f

Observation f8725ed0-8b21-4864-92e1-831d251a4154 · inbound

Is data-efficient learning feasible with quantum models? cites this paper.

Is data-efficient learning feasible with quantum models? How Complex is your classification problem? A survey on measuring classification complexity

Reference 33

Resolution
verified exact
local_arxiv, observed 2026-08-05T15:53:44.181002Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

source=pdf_text observed=2026-08-05T15:53:43.688200Z digest=sha256:c4e577b3b5b215efa86f4ffa35e87add44236747fd5d400492d5a1a4af4f7e1a