Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T14:10:49.336239Z
Paper Citation Record · LEDGER
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints
As of 14 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2411.16744.
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-13T06:32:02.005865+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
8 of 8 outbound references displayed
- verified exact1
- verified fuzzy5
- unresolved2
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 1c5853db-62d2-4d8b-b651-a4ed65753aa7 · outbound
This paper cites an unresolved cited work.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Unresolved cited work
Reference 1
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T14:10:49.432580Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation e93c9514-50ec-4175-9e03-fd84368a4abb · outbound
This paper cites Proof without words: Alternating row sums in pascal’s t riangle.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Proof without words: Alternating row sums in pascal’s t riangle
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T14:10:49.423641Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 6e3d86a5-0bcf-40f1-af37-de0cf9161655 · outbound
This paper cites an unresolved cited work.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T14:10:49.413449Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 7af3fa82-0d32-4c21-943a-3416b340c367 · outbound
This paper cites Grimaldi.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Grimaldi
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T14:10:49.403694Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation dc75e7a8-37e8-4a27-b5c2-4097769a425c · outbound
This paper cites An Invitation to Combinatorics.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints An Invitation to Combinatorics
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T14:10:49.394525Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 9ecdcd93-0deb-4e45-abc7-6ebafc50a60c · outbound
This paper cites Counting occurrences of some subword patterns.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Counting occurrences of some subword patterns
Reference 6
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T14:10:49.366881Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 405b4f0c-21d6-4127-838f-f9b9f0526335 · outbound
This paper cites Counting s ubwords in a partition of a set.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Counting s ubwords in a partition of a set
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T14:10:49.385237Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 2a8a866d-f29d-41d1-92ee-8b438ab6ab11 · outbound
This paper cites Combinatorics formula repository, 2024.
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints Combinatorics formula repository, 2024
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T14:10:49.376264Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Pith citing papers
No inbound Pith citation observations are available.