{"as_of":"2026-08-08T06:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:def1abe1908b7cee9bdf14707568b5cff794b19cd1814268626ee7329e4f21ff","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:00:59.704954Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2505.23101/citation-record","integrity":"/paper/2505.23101/integrity","json":"/paper/2505.23101/citation-record.json","paper":"/paper/2505.23101"},"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-07T13:01:11.749866Z","title":"The Knot Book: An elementary introduction to the mathematical theory of knots","venue":null,"work_id":"a6e76662-a3a5-485c-ac0b-d5fcfa5de1b1","year":2004},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:52.139396Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:a333cb7532e4fbacb994aa526846aac871cf5ebea159a4d9a5bc6bc5aff27705","observation_id":"991b781f-41c1-4898-ae24-48dde6399cc9","resolution":{"observed_at":"2026-08-07T13:01:11.844891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:11.531274Z","title":"The BQP-hardness of approximating the Jones polynomial","venue":null,"work_id":"22303883-6a33-421c-bcc8-9a4e5b40f53d","year":2011},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:52.416077Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:d0c939667662851cf5e1f6629da8f0140b951174f47f8767d584a18c1b8f9e60","observation_id":"909a5bee-431f-46b3-a168-9b92dd70b476","resolution":{"observed_at":"2026-08-07T13:01:11.614289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:11.280682Z","title":"A polynomial quantum algorithm for approximating the Jones polynomial","venue":null,"work_id":"dddd143b-9d4f-4c0f-b597-9cb0ccaffd56","year":2006},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:52.965343Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:51061887b022d50a5b779ef33bb040d920c1d5a29fbc4686e3158d398077b8ab","observation_id":"9a2fdf48-9e0e-44a9-850c-a737f2892251","resolution":{"observed_at":"2026-08-07T13:01:11.415450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:10.922443Z","title":"Arsuaga, M","venue":null,"work_id":"e4d17f68-93d9-427c-abdc-15f2e628f67e","year":2005},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:53.363031Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:2774a021369c2f1a1baaedf45eb14356afc268d40ff29acd95c62371717192de","observation_id":"06b4aaa4-46b7-4b92-a6c0-d042b669c0af","resolution":{"observed_at":"2026-08-07T13:01:11.120502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:53.499720Z","title":"Fast Khovanov homology computations","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:53.499720Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:865b260794c2667fdf387ca8b6b5375ce3e809aab93f2b5eb292464ee3aa3e46","observation_id":"c5ad8337-47ef-4d9b-8515-4f5720e0ce04","resolution":{"observed_at":"2026-08-07T13:00:53.499720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:01:10.604871Z","title":"Barkataki and E","venue":null,"work_id":"285ad578-4569-4a59-b726-532e5985c1a2","year":2022},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:53.619319Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:6b2f35306cbac01475c01469bd6cfa157ae5d560343d5515602149bbc3d52d9f","observation_id":"ec0aed53-94d7-4ff3-8771-886fb82c9745","resolution":{"observed_at":"2026-08-07T13:01:10.758251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:10.243818Z","title":"Barkataki and E","venue":null,"work_id":"2a9d8051-106b-409f-919b-31a8828d16c8","year":2025},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:53.738260Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:589f966dbdb4cdd0f1aa1d8954af57bb698c5bf1211f062af8e38ea8012226ba","observation_id":"f0deb0e7-9d27-4c82-99f5-23186db64b51","resolution":{"observed_at":"2026-08-07T13:01:10.422569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:09.897148Z","title":"Kauffman, and Eleni Panagiotou","venue":null,"work_id":"efead099-3b20-41bd-9615-fdc171a08806","year":2024},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:53.859581Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:e48b7083e6f20135627e522ffbce887b0ecf8f825c7e4e5df4f5df366d41c18d","observation_id":"47e99f6d-03e1-4781-a003-e6726755ad21","resolution":{"observed_at":"2026-08-07T13:01:10.038793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:09.627227Z","title":"The Jones polynomial in systems with periodic boundary conditions","venue":null,"work_id":"fc5bd906-c341-4f07-9332-6b460044f3ef","year":2024},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:53.980519Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:b0e178c944580e179cafaca366356b528d5b6f76ccdb612dee67ff853164eae1","observation_id":"95861b3f-0be8-48d7-b7ac-fd29fd9172a9","resolution":{"observed_at":"2026-08-07T13:01:09.751361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:09.273647Z","title":"Topological gelation of reconnecting polymers","venue":null,"work_id":"8a75563d-336d-4bac-8006-ce81b297d0f7","year":2022},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.105079Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:43428d14d651792c14d9ac3618b7dea44ead48291ac07c3d49f103d2b97f8ca4","observation_id":"3eda3594-ba1d-4ff2-8c8d-f6eaab4a855e","resolution":{"observed_at":"2026-08-07T13:01:09.448828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:08.903234Z","title":null,"venue":null,"work_id":"0dfb2661-a687-4b7f-a5bf-741eea26c37d","year":2018},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.273149Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:9a54dc8dfbc94c9c978f48cd4bf6f588d05ae04cc0fc333c7f5f8bccb2739c77","observation_id":"250b5db2-78da-47a8-9e2a-5219d651170f","resolution":{"observed_at":"2026-08-07T13:01:09.078225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:08.596399Z","title":"Burton, Ryan Budney, William Pettersson, et al","venue":null,"work_id":"d7efc09a-2ffe-4ed7-ae23-d8907a795a25","year":1999},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.400977Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:b216e55a67979bdb0a386440d45a81e2aaf5ebde0e982556e710c7131a4d2fe8","observation_id":"b7d5826b-b6ca-42a2-ad6f-11c41b6d1151","resolution":{"observed_at":"2026-08-07T13:01:08.774637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:08.316145Z","title":"Knot probabilities in random diagrams","venue":null,"work_id":"628a1f49-6427-4dfe-8cff-77f00fe2662f","year":2016},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.530854Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:901521ec08d6a1024e112dab42f50bf7b36a33206fb67b27b7e5ee2af7c8111a","observation_id":"5404cce3-3fa8-4d08-8443-09e2f87e7f2a","resolution":{"observed_at":"2026-08-07T13:01:08.424428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:08.307057Z","title":"Open and closed random walks with fixed edgelengths in Rd","venue":null,"work_id":"edf8343e-7974-4f2b-a22f-63cca70bf906","year":2018},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.655125Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:85c1d78de0c7986beac27e6d7758833fb03c6afefa7d624486144f4ec10b3a1f","observation_id":"d0ed776e-4023-43c7-b4ea-51de6711b42b","resolution":{"observed_at":"2026-08-07T13:01:08.310181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:08.112941Z","title":"‘Mind blowing’: quantum computer untangles the mathematics of knots","venue":null,"work_id":"6c9629ab-5b1f-40c9-a24c-58ce594d87ea","year":2025},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.828173Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:d5cb3896bec47194a50b6d52ee28d069d2eb11081674cb299ccc39959bf90e51","observation_id":"bd682932-c1dc-4e18-b52c-b0c8b87adc06","resolution":{"observed_at":"2026-08-07T13:01:08.239669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:07.747236Z","title":"Mean unknotting times of random knots and embeddings","venue":null,"work_id":"17d31097-1575-4f1b-898b-a9d08fcf14b1","year":2007},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:54.966884Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:8123bbef5a803f2af2e6c2228ae6981c5fa190cebeceef41081f7fcb1b2234e4","observation_id":"fb27e256-2964-44fc-a779-54b19ef28288","resolution":{"observed_at":"2026-08-07T13:01:07.934231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:07.603272Z","title":"The Book of Numbers","venue":null,"work_id":"a68683b5-46b6-40fe-b466-81af8f664187","year":1998},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.081807Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:b07ca4c7f8ebe95afd1b70892da54404be9ecb9af04977167d9c5fc04221c665","observation_id":"cf305850-ac6d-4a3f-97de-4cc3230ac9c0","resolution":{"observed_at":"2026-08-07T13:01:07.675151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:07.478780Z","title":"Parameterized algorithms","venue":null,"work_id":"81117dba-2b53-454e-a1e6-0d7f3d123d7c","year":2015},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.241744Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:97fcab58aeb3885992afc7e95b06276e85cce3a3d5ecf697d2f6b6e4edc50940","observation_id":"4a269cc9-3623-48f8-ba20-7317d5cf6d4a","resolution":{"observed_at":"2026-08-07T13:01:07.541300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:07.318191Z","title":null,"venue":null,"work_id":"62209c51-8200-44c0-b66b-015deee975ab","year":1995},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.410476Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:64a31a0eab9d1922154fcfd0d766fc6364c10ac6b6ed704e6cc6527145e2b79f","observation_id":"446e463c-8c4a-4fc1-87db-c1acc350b21e","resolution":{"observed_at":"2026-08-07T13:01:07.393195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:07.130298Z","title":"Jones polynomial of knots formed by repeated tangle replacement operations","venue":null,"work_id":"4f8fad73-325b-4e6f-a252-bc1d2139d13f","year":2009},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.539089Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:edc8f9995b596900dd272f9ceea68158a910a6fa85524f410a5977add3cbda9c","observation_id":"e08e2212-7425-46c7-af91-9eda8cc1b03f","resolution":{"observed_at":"2026-08-07T13:01:07.231163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:06.923032Z","title":"Crossing numbers and cutwidths","venue":null,"work_id":"4b349519-4ce0-4616-86c5-e7a13eda84ae","year":2003},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.677769Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:8caadc96683e410c0983085c292e93aca70f0417f28951eebb338c95d549f908","observation_id":"e657e77b-d25f-45df-a9cd-c8f0cd9e6ddb","resolution":{"observed_at":"2026-08-07T13:01:07.045944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:06.633383Z","title":null,"venue":null,"work_id":"7166cecc-2fdb-483b-aa14-43844e61087e","year":2009},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.844984Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:fd2de749429e5d2deae6ee1a38c5dd036307ce6c72687ace85d9739420674c14","observation_id":"61d61049-9136-4869-9717-2521841b8fb4","resolution":{"observed_at":"2026-08-07T13:01:06.755486Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:06.475351Z","title":null,"venue":null,"work_id":"e4f53455-0880-4e49-9392-896e7638f63a","year":2000},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:55.972187Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:04a0851d70acb819f56fa0998a50453b375353bdf87e8635d1a3849aac606179","observation_id":"dd0d25f3-a6ca-4be6-9046-45b4d226de70","resolution":{"observed_at":"2026-08-07T13:01:06.560388Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:06.281393Z","title":"Efficient computation of the kauffman bracket","venue":null,"work_id":"d91e0d42-6b24-4ef6-acee-c49948ba55d3","year":2014},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.084904Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:1da83b01208c42437394b6dfa130de3407b9a419748fb51f3b88a566c661cbed","observation_id":"f3e782c1-c2eb-4a00-bf7a-58b053b12fe7","resolution":{"observed_at":"2026-08-07T13:01:06.374207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:06.126706Z","title":"A polylogarithmic approximation of the minimum bisection","venue":null,"work_id":"bcc65b25-a215-40e5-b536-9fdb86b896d0","year":2002},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.203786Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:d99e0b10462215d96578c5014a477b189b5f17de04ee9de487c5965d377bf80e","observation_id":"a4feb2ec-0c3e-468e-a5ae-0b98b3de1439","resolution":{"observed_at":"2026-08-07T13:01:06.199034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:05.966753Z","title":"Planar separators and the euclidean norm","venue":null,"work_id":"edd88ede-cb9a-467b-8f26-184f10ad9b76","year":1990},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.353785Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:3f3c7c02fdfe47a6d9469242a8ab6aee393b1c22573bfe142dbe79a2f258cfe1","observation_id":"6c410b2a-6b2e-4ffb-abb0-5afe43dcf9f2","resolution":{"observed_at":"2026-08-07T13:01:06.058017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:05.773975Z","title":"G¨ ug¨ umcu and L","venue":null,"work_id":"80118ed5-785f-4e77-94e1-f3159ddfba9f","year":2017},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.482572Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:97439fbafcbd4fde6afdbb22a4966bb7f561f87344e733fae462868596d419ca","observation_id":"91172ae7-ffb7-497f-998f-872ebf22ad97","resolution":{"observed_at":"2026-08-07T13:01:05.880949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:05.650546Z","title":"G¨ ug¨ umc¨ u and L","venue":null,"work_id":"79ccefb8-89f9-46c7-99b0-8e39021273a2","year":2021},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.547646Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:086dd8875b09d50b505cd2c9ee78333e803f8970658f01cdfc69d1aceb73c47c","observation_id":"061b0090-f345-4ca6-bf87-b05113d024ef","resolution":{"observed_at":"2026-08-07T13:01:05.717269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:05.444989Z","title":"G¨ ug¨ umcu and S","venue":null,"work_id":"c829f5b5-752f-4fa8-8df1-8dcc7fa39f86","year":2017},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.672887Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:3f9268ee35012c5d5f6ab411c4bd9fafec91b460df25af9b03961bbf619d0004","observation_id":"11cfbb10-6dea-4a84-9369-b2dc60699a6c","resolution":{"observed_at":"2026-08-07T13:01:05.552091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:05.171633Z","title":"Hagberg, Daniel A","venue":null,"work_id":"ef2e368d-3d58-4a21-85e0-19c4d379c1a2","year":2008},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.815945Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:8edfb33b7eba1e3d90c7e9d10d713c60480a43aac5971c9474bda88164ffcd53","observation_id":"ba67fa8e-5dd4-401c-bbb8-fb3eb021ddd8","resolution":{"observed_at":"2026-08-07T13:01:05.295520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:04.919544Z","title":null,"venue":null,"work_id":"c384bb92-2931-4a18-bbc3-12904a65b0bf","year":1992},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.935932Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:88e27c2f05897c7ecccb9da9fd4e01ed54c2e0fc543fc71ab55230d7c81f47a4","observation_id":"b7f419ce-52f6-4287-8aaf-ca31f8fb0f06","resolution":{"observed_at":"2026-08-07T13:01:05.037513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:04.681207Z","title":"A fast algorithm for computing Jones polynomials of Montesinos links","venue":null,"work_id":"9ab7507b-3411-45cb-9a4f-54e4033fea86","year":2009},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:56.998042Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:3d36343bcc9ce9b4a6ef757f01bc319a9dd534c2619937eadb67eca4b5982550","observation_id":"81dac64d-d848-4d16-bb0e-e128f2443fcc","resolution":{"observed_at":"2026-08-07T13:01:04.792952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:04.382778Z","title":"On the computational complexity of the Jones and Tutte polynomials","venue":null,"work_id":"043e6b74-075b-4a64-8abb-39db7cd53f39","year":1990},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.101292Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:2bfeff308facae2eed71d3ede7a82101e4410b6433838d6bb613db29a4bba4fb","observation_id":"fa35c116-ab19-43ee-8a8a-6b0ef171600b","resolution":{"observed_at":"2026-08-07T13:01:04.531926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:04.102611Z","title":"On computing Kauffman bracket polynomial of Montesinos links","venue":null,"work_id":"22f2649b-f15a-4b2f-8cf2-c95473737617","year":2010},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.169563Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:80d698cd3a2009ccd384e79edeabfe01725e77b33f05025b2bb7ef5712a428da","observation_id":"e47402ef-4c67-4174-8f96-dbb6931f7772","resolution":{"observed_at":"2026-08-07T13:01:04.242106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:03.811915Z","title":null,"venue":null,"work_id":"a9eec085-1c0d-4217-af95-b742eda6df86","year":1985},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.214460Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:c5bb1d09721677022e692dff5af19fb91255cb1b5ec24ddcdf9974419c3dced9","observation_id":"c2341edf-4007-45a3-81a3-b63819c7f7bb","resolution":{"observed_at":"2026-08-07T13:01:03.940165Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:00:57.351169Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.351169Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:0f471f718030f6f6c01199b1a4254aa8ebd9afbb3f6b5dca5b5a9abd4b3c89d6","observation_id":"cc66a8fa-7929-47e1-a6ce-fb59730b7cbe","resolution":{"observed_at":"2026-08-07T13:00:57.351169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:01:03.572875Z","title":"Hard unknots and collapsing tangles","venue":null,"work_id":"7b57f98f-cddd-4be3-b1cb-0cbffa04f9e5","year":2012},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.515848Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:7b639528fefa3362ee266ebf52871113c2450ae18a57ff22e00d9feac5436b0d","observation_id":"5006d081-ccb8-4d10-b2a7-b1f97a8fe614","resolution":{"observed_at":"2026-08-07T13:01:03.683221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:03.317326Z","title":"An efficient heuristic procedure for partitioning graphs","venue":null,"work_id":"41af7429-17a0-4acb-b0a7-fbec4c6b8dc6","year":1970},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.672502Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:7fb30222db331aa5bcaab44f068d642d5f2662a8413603050b0789f8c59e993a","observation_id":"bc686760-409e-4f2f-a79b-3ea464324a55","resolution":{"observed_at":"2026-08-07T13:01:03.448032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:03.080532Z","title":"A categorification of the Jones polynomial","venue":null,"work_id":"92f9b944-21cd-4ec6-ab38-03a958d16a31","year":2000},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.783129Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:93cc64ad39b0c0c796f6652f00dad2823a3b40a071b32a8255d8df7fa5d213dc","observation_id":"e8a465d4-5410-4681-ac6e-972b13286185","resolution":{"observed_at":"2026-08-07T13:01:03.190997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:02.798848Z","title":"Treewidth: computations and approximations","venue":null,"work_id":"7453e970-5c24-4bc9-8f6c-0ba31c74693d","year":1994},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:57.923728Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:165e70a07b76af6f072ddaa21cc02457626660f017c88f7ed419720cdf8fc60a","observation_id":"2213a3b6-b11c-4af2-a53e-1742b7f3e4eb","resolution":{"observed_at":"2026-08-07T13:01:02.959982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:02.541792Z","title":"Less quantum, more advantage: An end-to-end quantum algorithm for the jones polynomial","venue":null,"work_id":"fb97fce5-c8b7-4c46-805c-4269fef180a5","year":2025},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.044817Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:2cd33cf61985f574a0aeb4adba9221f527ac4e1711ceb09db0e81c76fa037395","observation_id":"c6c4edf4-b552-470b-a42f-eacfc472c8aa","resolution":{"observed_at":"2026-08-07T13:01:02.642659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:02.313288Z","title":"A separator theorem for planar graphs","venue":null,"work_id":"08dfa7eb-e6b6-4bdd-887f-55c8bdfcc09a","year":1979},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.149351Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:8510fe5d25c4de8729e21c1ebdfacffa45503c38da8d196fbf85ee96e88204fa","observation_id":"b0aa59d3-0db2-47c7-907d-cf1473ea7080","resolution":{"observed_at":"2026-08-07T13:01:02.423926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:02.046996Z","title":null,"venue":null,"work_id":"6cc62168-d9ab-4f7c-8b45-59eacebed4f8","year":2018},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.276789Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:6656d8bcfbd101cbdaff517fa22357dd60f1ba133045fd66cacd56fd4279c92f","observation_id":"03f5d7de-469e-4c35-81c8-c3e51827c7bc","resolution":{"observed_at":"2026-08-07T13:01:02.167110Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:01.729322Z","title":"Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width","venue":null,"work_id":"7f32632a-8bf2-4df9-9153-08c5d1f99653","year":2005},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.376437Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:56fabea94349aac133f4dcbfdc8800aab3f349f9927280d8abdd5e99298e46d1","observation_id":"38cecffb-64bb-41aa-be94-de088ed9a55d","resolution":{"observed_at":"2026-08-07T13:01:01.876437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:01.487377Z","title":"Manouras, S","venue":null,"work_id":"15e61d78-d18b-4e0c-a171-d1c87b7c6cdd","year":2021},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.492014Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:92f258b7de81f1bcbfea7f0f056a2ca973b08b1cd603d4c46002f7b3a372778e","observation_id":"17f8a70b-7283-4296-8f54-bb8f6723b11b","resolution":{"observed_at":"2026-08-07T13:01:01.607524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:01.276470Z","title":"Micheletti, D","venue":null,"work_id":"e419b701-93b8-4de5-ab76-848ba766835c","year":2011},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.582397Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:6f3aaaa0856f695d95fa152572f1b014d7954c751f0e2cfd76da14a6d77aa9da","observation_id":"046a4816-197c-4708-99d0-888253d2aa97","resolution":{"observed_at":"2026-08-07T13:01:01.364698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:01.090775Z","title":"Computing the Jones polynomial on bipartite graphs","venue":null,"work_id":"06d8ce72-8364-4570-9c32-15769071f193","year":2001},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.701940Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:d88fe48b6bf321cbf52653d4f5e8428fce689fc13c50e23028c9c7fd6de936e7","observation_id":"c514b4c1-5f02-4f48-a748-6518e4eb60e8","resolution":{"observed_at":"2026-08-07T13:01:01.159765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.972017Z","title":"Calculating the 2-variable polynomial for knots presented as closed braids","venue":null,"work_id":"b06aae12-a832-459e-83e9-5063fc28a7ef","year":1990},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.780991Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:bd73891d3338701e23b1db781b549f59ed5f7b5fc419c6e2bf4826145c1319e3","observation_id":"ccb5abec-fe26-41b1-99b3-d23d516baf57","resolution":{"observed_at":"2026-08-07T13:01:01.017386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.855964Z","title":"Fast algorithms for computing Jones polynomials of certain links","venue":null,"work_id":"d17a3c09-f1df-400d-9648-1ebeb65f30a8","year":2007},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.921414Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:40a23625272a9ac732fa411619452b9f8e338dcc95d3674f0414143300f95456","observation_id":"7b2fe0d5-a542-4f3c-9877-34e5add1ae4e","resolution":{"observed_at":"2026-08-07T13:01:00.900730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.761932Z","title":"Panagiotou and L","venue":null,"work_id":"f195068b-637a-4ad9-aab9-574f385a903f","year":2020},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:58.976383Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:7c42197872829ce1c968eb3d83bf771d51b069624a5f0128203a1ccad93d08c0","observation_id":"7792a975-91b8-4474-b318-19437e62bea2","resolution":{"observed_at":"2026-08-07T13:01:00.804190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.636121Z","title":"Panagiotou, M","venue":null,"work_id":"3b3e1a37-f776-487b-b914-336eb61fec8d","year":2013},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.062556Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:746e3eddc8054398bc6678d820931e256864c4976791e5903f7923d55041f32f","observation_id":"e48e0fb8-cfeb-43d2-889f-e01be254899c","resolution":{"observed_at":"2026-08-07T13:01:00.698913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.509486Z","title":"Panagiotou, K","venue":null,"work_id":"ae216bd0-6306-41db-9744-17f339d97383","year":2019},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.135797Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:6d28e10d6bc94b2a4c9b6850aa3c3ad4ace20d1aead60b015b5a5d0c01024229","observation_id":"82364338-e535-4410-b8a8-f1783303d6f9","resolution":{"observed_at":"2026-08-07T13:01:00.552474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.399299Z","title":"Qin and S","venue":null,"work_id":"95d4c3da-7b08-4497-a484-65eb87ca4b88","year":2011},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.225470Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:749564a01b91c0a76dcf62e26a7b7bbec2486142043c8d1541ec2e8fc9bbdd9a","observation_id":"743fd3b1-906f-4e9b-a509-adb0751683dc","resolution":{"observed_at":"2026-08-07T13:01:00.437039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.288988Z","title":"Geometric learning of knot topology","venue":null,"work_id":"0a6bb2c0-edf0-4b28-b600-7e55049a7dc1","year":2024},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.314955Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:f79b3b8e3f7a2f93088131aa075c7a2bb69c2dfc012d04d13d48c90fe193addd","observation_id":"d51d029c-e185-4671-89ac-1ccde503ba9d","resolution":{"observed_at":"2026-08-07T13:01:00.332000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.159940Z","title":null,"venue":null,"work_id":"43056061-6913-4c49-8017-f5c0b40b10e5","year":2012},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.421873Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:4a6bb2980d0da64ef725025d5fa2bac387b912a248c61af03b22407619cdb30b","observation_id":"d5921ee9-e027-48a6-908f-a35e3a8947ef","resolution":{"observed_at":"2026-08-07T13:01:00.215480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:01:00.064001Z","title":null,"venue":null,"work_id":"84e924b4-909f-434f-b3bc-c2273ae3c782","year":2012},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.534182Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:14a060b4745a33e9ac5e3015012eac2bba7f814ea400f71885622a2c559a53b9","observation_id":"e1848cc5-3c3e-4dc0-bd6d-48ef6b7684ea","resolution":{"observed_at":"2026-08-07T13:01:00.106293Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:00:59.938515Z","title":"Computation of the Jones polynomials for pretzel links","venue":null,"work_id":"3b23f9ab-e3ce-4043-86a1-4d13d113c877","year":2002},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.644745Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:fd59bbddf8e5f2da70df8a94e666318017355527f21b3482206a9162f907c526","observation_id":"91682dfc-c73e-4433-8b97-f24ac07708a4","resolution":{"observed_at":"2026-08-07T13:00:59.992289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:00:59.805872Z","title":"On the universality of knot probability ratios","venue":null,"work_id":"5a100433-b8a6-461e-ba70-605c3f8b309c","year":2011},"citing_paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:00:59.704954Z"},"links":{"citing_paper":"/paper/2505.23101"},"observation_digest":"sha256:2b76481d0964ab5a963fa8001e0886c9c26b6c38dfd68a27bb7b41ebe3b36aa5","observation_id":"03f9e64b-ed85-483f-818a-3ea98a531a16","resolution":{"observed_at":"2026-08-07T13:00:59.856541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.23101","last_updated":"2025-05-29T05:07:14Z","latest_version":1,"primary_category":"math.GT","snapshot_observed_at":"2026-08-07T12:50:56.189511Z","submitted_at":"2025-05-29T05:07:14Z","title":"A parallel algorithm for the computation of the Jones polynomial"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":47},"total_outbound_references":58},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2505.23101."}