Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-01T22:21:43.000789Z
Paper Citation Record · LEDGER
Counting in logarithmic space
As of 19 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.15881.
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-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
15 of 15 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved15
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 1940c994-1095-45c5-9829-db11f9c5b0a4 · outbound
This paper cites an unresolved cited work.
Counting in logarithmic space Unresolved cited work
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.031393Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5dde9497-3893-4956-baca-bb261a125640 · outbound
This paper cites On the gradient of the coefficient of the characteristic polynomial.
Counting in logarithmic space On the gradient of the coefficient of the characteristic polynomial
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.200203Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 250fccc7-2903-4c6a-9e57-98f4cefdf1c0 · outbound
This paper cites Computational complexity in algebraic combinatorics.Current Developments in Mathematics, 2023(1):241–280,.
Counting in logarithmic space Computational complexity in algebraic combinatorics.Current Developments in Mathematics, 2023(1):241–280,
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.787225Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9454fa7b-d38c-41c4-8982-0ea03c76bc17 · outbound
This paper cites Signed combinatorial interpretations in algebraic combinatorics.
Counting in logarithmic space Signed combinatorial interpretations in algebraic combinatorics
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.926509Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8cbe00a4-51ad-4317-bcb2-babe4b13fa02 · outbound
This paper cites Online Turing machine simulator, 2012.https://turingmachinesimulator.com.
Counting in logarithmic space Online Turing machine simulator, 2012.https://turingmachinesimulator.com
Reference 1988
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:43.000789Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1c7dc723-e126-4971-a127-d78a5258979a · outbound
This paper cites A geometric and generating function approach to plethysm.
Counting in logarithmic space A geometric and generating function approach to plethysm
Reference 1992
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:41.870096Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4ca7da8a-2f07-4d51-ad2a-68aee7ad0192 · outbound
This paper cites Which graph motif parameters count? In50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), pages 23–1.
Counting in logarithmic space Which graph motif parameters count? In50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), pages 23–1
Reference 1994
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:41.545666Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 782720b6-e24e-43df-8e13-0169319c46bb · outbound
This paper cites Plethysm is in #BQP.
Reference 1995
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:41.653187Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0a2e3aea-0346-4930-8fc2-c53726ecc713 · outbound
This paper cites Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem.
Counting in logarithmic space Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
Reference 2004
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.433623Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 406ae70c-e610-472f-b2c1-518e36da2b74 · outbound
This paper cites Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry.
Counting in logarithmic space Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
Reference 2007
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.575767Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7a2cc362-f39e-48e3-8c48-7c95990b03b7 · outbound
This paper cites Determinant: Combinatorics, algorithms, and complexity.Chicago Journal of Theoretical Computer Science, 1997(5), December.
Counting in logarithmic space Determinant: Combinatorics, algorithms, and complexity.Chicago Journal of Theoretical Computer Science, 1997(5), December
Reference 2010
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.654104Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 279ba153-1321-4614-92d4-d4d1f209028a · outbound
This paper cites Field-independent Kronecker-plethysm isomorphisms.
Counting in logarithmic space Field-independent Kronecker-plethysm isomorphisms
Reference 2017
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.279461Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 99366c4b-f730-41f1-9a92-c14da6f57dc9 · outbound
This paper cites Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.International Mathematics Research Notices, 2024(10):8442–8458,.
Counting in logarithmic space Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.International Mathematics Research Notices, 2024(10):8442–8458,
Reference 2024
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.352071Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fb38c8c2-3019-4f9a-964f-a848e6366222 · outbound
This paper cites Polynomial time classical versus quantum algorithms for representation theoretic multiplicities.
Counting in logarithmic space Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
Reference 2025
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:42.845271Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6edb6c87-091e-4c3c-b693-81d56efbfeda · outbound
This paper cites Functional closure properties of finiteN-weighted automata.
Counting in logarithmic space Functional closure properties of finiteN-weighted automata
Reference 2026
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T22:21:41.780923Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.