Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T14:19:15.223151Z
Paper Citation Record · LEDGER
A simple algorithm to compute link polynomials defined by using skein relations
As of 16 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:1908.04292.
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-16T06:30:59.297886+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
10 of 10 outbound references displayed
- verified exact1
- verified fuzzy5
- unresolved4
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 4d486303-28a7-4ef5-8396-c5a15512728e · outbound
This paper cites Braids, links, and mapping class groups.
A simple algorithm to compute link polynomials defined by using skein relations Braids, links, and mapping class groups
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:19:15.425373Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 50ad59d0-3e37-4593-ae7b-4aa34df3616c · outbound
This paper cites A fast method of comparing braids, Adv.
A simple algorithm to compute link polynomials defined by using skein relations A fast method of comparing braids, Adv
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:19:15.415782Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 512f4124-304f-40c7-b680-e401d2cc949b · outbound
This paper cites an unresolved cited work.
A simple algorithm to compute link polynomials defined by using skein relations Unresolved cited work
Reference 3
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:19:15.406538Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e65f20bb-c3f3-48f3-9193-8c2613952e6b · outbound
This paper cites Computational algorithms and the complexity o f link polynomials.
A simple algorithm to compute link polynomials defined by using skein relations Computational algorithms and the complexity o f link polynomials
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:19:15.397578Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 6e247ca7-b545-4ffd-b556-d1393ec46718 · outbound
This paper cites an unresolved cited work.
A simple algorithm to compute link polynomials defined by using skein relations Unresolved cited work
Reference 5
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:19:15.387041Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b125ff2f-d7f7-47d8-a2fa-62a2ecad245e · outbound
This paper cites an unresolved cited work.
A simple algorithm to compute link polynomials defined by using skein relations Unresolved cited work
Reference 6
- Resolution
- verified exact
- raw_fallback, observed 2026-08-14T14:19:15.313509Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d674a653-ec7f-4643-9cd4-66c830e085af · outbound
This paper cites an unresolved cited work.
A simple algorithm to compute link polynomials defined by using skein relations Unresolved cited work
Reference 7
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:19:15.374812Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4defd991-9621-469b-a97b-efe52054ca1d · outbound
This paper cites Fast algorithms for computing Jones polynomials of certain links.
A simple algorithm to compute link polynomials defined by using skein relations Fast algorithms for computing Jones polynomials of certain links
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:19:15.364293Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ccfae283-d590-4eeb-a14e-3c88e00fe8e3 · outbound
This paper cites an unresolved cited work.
A simple algorithm to compute link polynomials defined by using skein relations Unresolved cited work
Reference 9
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T14:19:15.344436Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8ec17bbe-8e17-416f-880e-483884d8e18d · outbound
This paper cites Complexity: Knots, Colorings and Counting, Cambrid ge Univ.
A simple algorithm to compute link polynomials defined by using skein relations Complexity: Knots, Colorings and Counting, Cambrid ge Univ
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T14:19:15.326259Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.