{"as_of":"2026-08-16T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:417c0a329631916b8091b23c3bc30ac64478129794f1bf1877e58d991924da22","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:19:15.223151Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.04292/citation-record","integrity":"/paper/1908.04292/integrity","json":"/paper/1908.04292/citation-record.json","paper":"/paper/1908.04292"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.422417Z","title":"Braids, links, and mapping class groups","venue":null,"work_id":"00471447-659f-4530-ac00-0387d8c52cec","year":1974},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.184880Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:87874ca96c08b3a5bfbf832d84ed3f8c9f154280e5a81097a578061227f9daec","observation_id":"4d486303-28a7-4ef5-8396-c5a15512728e","resolution":{"observed_at":"2026-08-14T14:19:15.425373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.412440Z","title":"A fast method of comparing braids, Adv","venue":null,"work_id":"ed7191e8-d722-4f0f-abd4-815075ab121a","year":1997},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.190168Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:96f49a9bfdc9dfb7ba91fe0eba8b7a40456cc7fbbecc6f7b710ccc86c1709b4a","observation_id":"50ad59d0-3e37-4593-ae7b-4aa34df3616c","resolution":{"observed_at":"2026-08-14T14:19:15.415782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.403571Z","title":null,"venue":null,"work_id":"de95b8e6-59c5-49aa-a20c-c2c436c28a5c","year":1996},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.194789Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:61783e67cb43702fbc1b5cfdbe0cee64ca4971863c888fc531898f0082a1d2b5","observation_id":"512f4124-304f-40c7-b680-e401d2cc949b","resolution":{"observed_at":"2026-08-14T14:19:15.406538Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.394348Z","title":"Computational algorithms and the complexity o f link polynomials","venue":null,"work_id":"7222ee47-acb2-48ea-8ee0-94e426c1488d","year":1997},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.198279Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:c8f47358e1a495e7cd68968f57814c43819f7949c3d0c590025cb88601c2cca2","observation_id":"e65f20bb-c3f3-48f3-9193-8c2613952e6b","resolution":{"observed_at":"2026-08-14T14:19:15.397578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.383938Z","title":null,"venue":null,"work_id":"a9464a8a-f5ee-47a6-9b5a-e13b72893ecc","year":null},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.202881Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:9ec18eccee3691162a7ca59be6f8a32c30eaf49b6a91f4aa382918a94d9db374","observation_id":"6e247ca7-b545-4ffd-b556-d1393ec46718","resolution":{"observed_at":"2026-08-14T14:19:15.387041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"math.gt/0401051","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.301201Z","title":null,"venue":null,"work_id":"a88fa57e-15fd-46ba-bc45-9ac566539d26","year":null},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.208084Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:98128acf5a83aae69cf69291a4bd9806192e82ad336e84f0f20e377b5266c609","observation_id":"b125ff2f-d7f7-47d8-a2fa-62a2ecad245e","resolution":{"observed_at":"2026-08-14T14:19:15.313509Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.371971Z","title":null,"venue":null,"work_id":"760847cb-7a85-4f59-90dc-0dacfab9bd69","year":null},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.211804Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:4937521f72b59f2cae7fac756e45f1fbfc870f90e631c7d9f5dcf8b7500d6daa","observation_id":"d674a653-ec7f-4643-9cd4-66c830e085af","resolution":{"observed_at":"2026-08-14T14:19:15.374812Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.360874Z","title":"Fast algorithms for computing Jones polynomials of certain links","venue":null,"work_id":"c52a822c-af69-4ce2-8da7-829371aef53c","year":2007},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.215599Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:85796211d63aa43f90ae076051f40705afbfd7fc9c56bc05649ce45ebd94209e","observation_id":"4defd991-9621-469b-a97b-efe52054ca1d","resolution":{"observed_at":"2026-08-14T14:19:15.364293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.333763Z","title":null,"venue":null,"work_id":"f21047ff-a386-4e7f-80b8-1c715963d674","year":2004},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.219520Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:ac1ec2eb044c9c143fa2a28e9894c757d5313128db13007b506e27a89eeab9d1","observation_id":"ccfae283-d590-4eeb-a14e-3c88e00fe8e3","resolution":{"observed_at":"2026-08-14T14:19:15.344436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:19:15.321293Z","title":"Complexity: Knots, Colorings and Counting, Cambrid ge Univ","venue":null,"work_id":"5d8e8502-6530-4ae9-a61a-c76901523502","year":1993},"citing_paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:19:15.223151Z"},"links":{"citing_paper":"/paper/1908.04292"},"observation_digest":"sha256:8a4d490f86a86e46e48a2ff43d41ab839007e06b99fdfd325e2bcaddb51f259e","observation_id":"8ec17bbe-8e17-416f-880e-483884d8e18d","resolution":{"observed_at":"2026-08-14T14:19:15.326259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04292","last_updated":"2019-08-10T12:44:39Z","latest_version":1,"primary_category":"math.GT","snapshot_observed_at":"2026-08-16T06:07:01.537882Z","submitted_at":"2019-08-10T12:44:39Z","title":"A simple algorithm to compute link polynomials defined by using skein relations"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":10},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"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."}