Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Computational Complexity in Algebraic Combinatorics
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.17511.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-18T00:59:04.602773Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-18T01:00:34.307482Z
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 82f2844b-9e25-468d-92f1-aca17ef35def · inbound
A geometric and generating function approach to plethysm cites this paper.
A geometric and generating function approach to plethysm Computational Complexity in Algebraic Combinatorics
Reference 13
- Resolution
- verified exact
- arxiv_id, observed 2026-05-18T01:00:34.310071Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.