Pith. sign in

Paper Citation Record · LEDGER

Computational Complexity in Algebraic Combinatorics

As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2306.17511.

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

pith.paper-citation-record.v1
2306.17511 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T18:20:38.564240Z

measured 0 of 1 external citation measurements

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 a6b1133e-8bc5-4ad2-b389-25af9aae82a5 · inbound

On the hardness of cloning and connections to representation theory cites this paper.

On the hardness of cloning and connections to representation theory Computational Complexity in Algebraic Combinatorics

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-12T18:20:38.564240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T18:20:38.564240Z digest=sha256:7a01a288d7a288a9aeb76d0611119c14310837fda17fdaf2f217594a30b8a722

Observation 0596286a-d3fc-4e93-b2fc-95097e28bfb4 · inbound

Vanishing of Schubert Coefficients cites this paper.

Vanishing of Schubert Coefficients Computational Complexity in Algebraic Combinatorics

Reference 91

Resolution
unresolved
no resolver link, observed 2026-08-12T00:04:11.334493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T00:04:11.334493Z digest=sha256:bb01bfdf9e573680a1ffa1962b9ec6fa598a1825d7eb959fb409a2fe95ca42b7

Observation 379c0fd8-cdc0-42f7-956d-31b662fc5081 · inbound

Positivity of Schubert Coefficients cites this paper.

Positivity of Schubert Coefficients Computational Complexity in Algebraic Combinatorics

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-11T01:04:45.167766Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T01:04:45.167766Z digest=sha256:735dd6781167ddb50360eebbdfed71a5181fc390b9b848fa5bc29fb210479dcd

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-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-05-18T00:59:04.602773Z digest=sha256:99daea488656e5bb1897679efdd3be74946bcf24bc41b22c8039a08fdb2a9d87