Pith. sign in

Paper Citation Record · LEDGER

On the Constant-Depth Circuit Complexity of Generating Quasigroups

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.00133.

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

pith.paper-citation-record.v1
2402.00133 v5

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-19T06:32:44.657259+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-16T05:57:51.351372Z

measured 1 of 1 external citation measurements

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

Source: pith, observed 2026-08-10T05:30:23.456663Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

0
pith, observed 2026-08-10T05:30:23.456663Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 2ff1b91d-b7c0-458e-bafc-9ac828bc0f46 · inbound

Membership and Conjugacy in Inverse Semigroups cites this paper.

Membership and Conjugacy in Inverse Semigroups On the Constant-Depth Circuit Complexity of Generating Quasigroups

Reference 24

Resolution
verified exact
local_arxiv, observed 2026-08-07T19:38:56.559216Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-07T19:38:53.225847Z digest=sha256:2ff1160fc27cc1b965903c0ddb0e580324a378df02ccbd737df05fd8c51785b1

Observation 50893ad8-d783-4797-b88a-2786fbf35216 · inbound

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness cites this paper.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the Constant-Depth Circuit Complexity of Generating Quasigroups

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-16T05:57:51.351372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T05:57:51.351372Z digest=sha256:1ff873344f5d8e695b3356ac844fd619c93f2166f2f552fea6564c8c5a3eb92e