{"as_of":"2026-08-12T13:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b54291af604de7d89b7c996f487e95e2e3fc04eb7f3167e70b8f08577a1f857","coverage":[{"denominator":94,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":94,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:40:47.011533Z","state":"measured"},{"denominator":94,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":94,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2501.10480/citation-record","integrity":"/paper/2501.10480/integrity","json":"/paper/2501.10480/citation-record.json","paper":"/paper/2501.10480"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.634125Z","title":"”Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” The Mathematical Intelligencer (2024): 1-14","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.634125Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:73216e01ba4ab79ea1049a5d0fbfa31e90b012bbbfe8712cee2d535dde1b0ce7","observation_id":"24c693c6-038e-4fd6-9bca-354406934376","resolution":{"observed_at":"2026-08-10T19:40:46.634125Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.639683Z","title":"”New progress in real and complex polynomial root-finding.” Computers & Mathematics with Applications 61.5 (2011): 1305-1334","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.639683Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:e74c602fc8ef8f9f6d5477ffebbd2c7d6db6923ec89f01a4896ff185c7e516e8","observation_id":"2ff80145-41f4-4f73-a976-edfce5805c2b","resolution":{"observed_at":"2026-08-10T19:40:46.639683Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.644119Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.644119Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:a486e6d171eda4437182efeba5e03eb1f419eb1967f82fb3c4ad7f9af3f59b8a","observation_id":"96bfa8ee-ee51-40da-b4ab-c2bfede03466","resolution":{"observed_at":"2026-08-10T19:40:46.644119Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.648832Z","title":"A., and Joseph Frederick Traub","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.648832Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:819b7e7ee82f14f9e3f66b64806a0130aa145fe7a0aa560b2a78eb55385d4bdc","observation_id":"5db90211-c245-4a2c-bf2f-1397f95db548","resolution":{"observed_at":"2026-08-10T19:40:46.648832Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.653141Z","title":"”The history and status of the P versus NP question.” Proceedings of the twenty-fourth annual ACM symposium on Theory of computing","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.653141Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:4d63e4928381b9614a991ec8a099277d0581c485fa29595510f6d71129603c5d","observation_id":"ea4bb9c3-f446-4bdb-97a7-052004c1b886","resolution":{"observed_at":"2026-08-10T19:40:46.653141Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.657787Z","title":"”Introduction to the Theory of Computation.” ACM Sigact News 27.1 (1996): 27-29","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.657787Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:e504ce4ab8ec362e5b379a7fb2282181a39e365ee3b411c95766431412ff2fdf","observation_id":"03893946-6349-44fa-9dd1-da2cc5ffb16d","resolution":{"observed_at":"2026-08-10T19:40:46.657787Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.662655Z","title":"”Borel sets and circuit complexity.” Proceedings of the fifteenth annual ACM symposium on Theory of computing","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.662655Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:3d0d0b3cd4b3bf3064118530ea36da3ad84f2bde121a926f9e942e5585f3dbcd","observation_id":"6f88a8a7-f88d-4af5-a263-26b1b6759c0b","resolution":{"observed_at":"2026-08-10T19:40:46.662655Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.666642Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.666642Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c47e9dfb27b9e7fe8db0043bceee044e3d2d2f5e6b3c9cd61a78f2627b31311f","observation_id":"f749aed6-aa5c-4879-837a-f496057c8354","resolution":{"observed_at":"2026-08-10T19:40:46.666642Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.670909Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.670909Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:12fedc8f24d9244f2af1bd23b0b9935b7a9b9a226ffc51fb0707dd8ebb260956","observation_id":"5196420e-8975-440b-968f-e72fb9deb4b6","resolution":{"observed_at":"2026-08-10T19:40:46.670909Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.675099Z","title":"”Relativized circuit complexity.” Journal of Computer and System Sciences 31.2 (1985): 169-181","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.675099Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:2185e0d52e1ba045bb4321dcf16735fe003c43331a8c3680df8638c10f995a4a","observation_id":"dd02b0e5-be6e-447c-8ba0-857419df841c","resolution":{"observed_at":"2026-08-10T19:40:46.675099Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.679213Z","title":"Introduction to circuit complexity: a uniform approach","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.679213Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:39a179857398bb5725d0c3c3c15e8ba5228f715bd63458c7acc2485a417e885f","observation_id":"33925d82-bea5-4a72-8aae-6e83ae7cb0db","resolution":{"observed_at":"2026-08-10T19:40:46.679213Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.683281Z","title":"”Circuit complexity before the dawn of the new millennium.” International Conference on Foun- dations of Software Technology and Theoretical Computer Science","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.683281Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:3e3d1f34692510958e360454c5055c9b30afd115bf0873bdfbb06c8922ad27c4","observation_id":"4046af1f-4013-46dd-b192-32e146ff5c1c","resolution":{"observed_at":"2026-08-10T19:40:46.683281Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.687120Z","title":"”Derandomizing polynomial identity tests means proving circuit lower bounds”","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.687120Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:617d8c5088e37028668ce53f7e2ffe5c8cfe46b353a5710dd82dc0e7d0230c4a","observation_id":"d361c990-22c0-412a-8c71-ce45d92999ec","resolution":{"observed_at":"2026-08-10T19:40:46.687120Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.690944Z","title":"”Michael A","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.690944Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:a783960a702e278b8b04d47470f1de0cfdf378a9fd9910d952f1d666ee4a227e","observation_id":"5ae3d22d-9782-400f-9de7-3baa857af2c6","resolution":{"observed_at":"2026-08-10T19:40:46.690944Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:46.695041Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.695041Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ba5ce18a54e14b06825ef33e43052a00626bcfbbfb17a0a2b7ee3d3cca60039e","observation_id":"f5e0a782-0a24-45e0-94e6-6a49ec34ce2b","resolution":{"observed_at":"2026-08-10T19:40:46.695041Z","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-10T19:40:48.134674Z","title":"”A quaternion QR algorithm.” Numerische Mathematik 55 (1989): 83-95","venue":null,"work_id":"240b1b8d-8a99-42f3-8502-a4e14f528b85","year":1989},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.699155Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:8c313f3ce826b46b5c385cb376a5dca7e312952124e86fd05bd2e9cc3d128946","observation_id":"669e1373-0afc-4692-8962-442856528ddf","resolution":{"observed_at":"2026-08-10T19:40:48.138265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.123970Z","title":"”Horner’s method of approximation anticipated by Ruffini.” (1911): 409-414","venue":null,"work_id":"d7c392a5-fac9-4fb9-9d1c-e6aeec388f63","year":1911},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.702859Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:3ba29800e6d6951b21d636733df931fa637177a1c6e294711f86f234203b12a6","observation_id":"f5544025-550b-495d-af7c-987ea58acd40","resolution":{"observed_at":"2026-08-10T19:40:48.127720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.112323Z","title":"”The Fifteen Puzzle—A New Approach through Hybridizing Three Heuristics Methods.” Computers 12.1 (2023): 11","venue":null,"work_id":"1b7f708d-7cd2-42a5-a45b-b7bb44a19bc7","year":2023},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.707040Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:b712851dde3f5032971c7145f150746eb1bcb1d3a05c2d773ed974a6e8851b71","observation_id":"36f21786-e400-47a9-be83-0eb0b6f42408","resolution":{"observed_at":"2026-08-10T19:40:48.116402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.01937","last_updated":"2024-12-02T19:59:06Z","snapshot_observed_at":"2026-08-11T23:58:19.349879Z","submitted_at":"2024-12-02T19:59:06Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","version":1},"cited_work":{"arxiv_id":"2412.01937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.01937","snapshot_observed_at":"2026-08-10T19:40:47.252087Z","title":"Approximately Optimal Search on a Higher-dimensional Sliding Puzzle","venue":"cs.AI","work_id":"d6d4e7be-de4f-46d8-99a7-5083951e263b","year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.711050Z"},"links":{"cited_paper":"/paper/2412.01937","citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ca1d7aa14a9e2e8b258c7b539a910d89bfac749d222926534f76c387ad0e72d2","observation_id":"4683f929-c1df-40be-b0bb-204ecaa93c45","resolution":{"observed_at":"2026-08-10T19:40:47.256797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.100785Z","title":"Precise numerical methods using C++","venue":null,"work_id":"77ef8990-0829-4df0-a7fb-dbbde7e5eb0c","year":1998},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.715238Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:4620a7f5e6d6cbb1eae5bf9e59d075b84c74af5a035ebaca56cf5ceef3aff6ca","observation_id":"864a0386-9938-4c76-9090-8426b9af3813","resolution":{"observed_at":"2026-08-10T19:40:48.104682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.088651Z","title":"Introduction to precise numerical methods","venue":null,"work_id":"201f0dde-5b68-421c-8727-e199b335eb06","year":2007},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.719230Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:de11a8b44090ff32cc159c15d14b6235e7aa9e9adb518bb465ef214241d0b9a0","observation_id":"482161a6-8e7d-41c8-8908-c260c1faa4bb","resolution":{"observed_at":"2026-08-10T19:40:48.093143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.076741Z","title":null,"venue":null,"work_id":"fad71862-662f-4c64-8b95-9d0fb62bfbd9","year":2013},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.722810Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:da94406efbe5d8a00287711eb01e568c13f7f6527dc91a9f150954806b85bcfb","observation_id":"cbe033b4-b15a-4155-93d3-609609c269f3","resolution":{"observed_at":"2026-08-10T19:40:48.080543Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.065202Z","title":"”A new look at the fifteen puzzle.” Mathematics Magazine 40.4 (1967): 171-174","venue":null,"work_id":"db9b756a-6dc6-4061-9ed9-f800811554e0","year":1967},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.726640Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:13bb9c33377fbcbbe305225d3b05fbe1c4fc35cb38d9ed21bf53a7d28f238ed8","observation_id":"438711ed-73eb-4a6e-9634-fabc4c46b9ea","resolution":{"observed_at":"2026-08-10T19:40:48.069510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.053599Z","title":"”A modern treatment of the 15 puzzle.” The American Mathematical Monthly 106.9 (1999): 793-799","venue":null,"work_id":"36e79347-8e57-43a6-9d25-aa5f5c50e4fa","year":1999},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.730390Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:49008012b433e9ead73a9bdb6b835f146a50d91c8ed18962b12fb1292ff830c3","observation_id":"80ce20fd-506f-4e52-948b-f87554fd9981","resolution":{"observed_at":"2026-08-10T19:40:48.057691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:46.733736Z","title":"”Sliding Puzzles Gym: A Scalable Benchmark for State Representation in Visual Reinforcement Learning.” arXiv preprint arXiv:2410.14038 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.733736Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:a1e2253d865ecae10e72ec5400e5c101c1320488ebdac7c3bdd09fea27166965","observation_id":"0e14ed3a-08f8-457c-a5a0-7446f651f3d3","resolution":{"observed_at":"2026-08-10T19:40:46.733736Z","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-10T19:40:48.042157Z","title":"”Some numerical methods for locating roots of polynomials.” Quarterly of Applied Mathe- matics 3.2 (1945): 89-105","venue":null,"work_id":"4a3dc557-185a-4fca-acc4-e193ca3d798e","year":1945},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.737214Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:56d53dd06cecfe82352af434bb3af93a256080027f39d0bb36539d778d2591ad","observation_id":"a6eaa3f3-8131-4dfa-9b43-5cd08c18bd00","resolution":{"observed_at":"2026-08-10T19:40:48.046132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.030013Z","title":"”Unmasking Dunning-Kruger Effect in Visual Reasoning & Judg- ment.” IEEE Transactions on Visualization and Computer Graphics (2024)","venue":null,"work_id":"8a4e2e60-a967-4418-8c38-793051ed5e46","year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.740897Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:f377df47517c6ce6a127ad75926651aa48609343777fe3e433827f4615d1dfb5","observation_id":"5ad0b7ec-e829-40e4-ac6c-0d5bcd7653f2","resolution":{"observed_at":"2026-08-10T19:40:48.034353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.018502Z","title":"Numerical Methods for Roots of Polynomials-Part II","venue":null,"work_id":"5e1cabb6-467f-4907-b6d4-a01317027101","year":2013},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.744534Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c6dea5f2d757b652bbbed93c6cc2a8bfcc14c230f2f327310c0539b44e85f913","observation_id":"b8d26b4f-f84e-4877-8885-809475d53f17","resolution":{"observed_at":"2026-08-10T19:40:48.022414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:48.007291Z","title":"”Global convergence of the basic QR algorithm on Hessenberg matrices.” Mathematics of Computation 22.104 (1968): 803-817","venue":null,"work_id":"80401ae5-5887-44f1-b66d-f9a7ffcfb73d","year":1968},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.747759Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:28cf611cc3403390fe7b3032050e9e06ecc0b281ce6484213224038bd6fb68c5","observation_id":"e4765f02-38b8-4322-bbdb-faafa17e3020","resolution":{"observed_at":"2026-08-10T19:40:48.011389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.994500Z","title":"”The 15 puzzle: how it drove the world crazy.” The puzzle that started the craze of (1880)","venue":null,"work_id":"b5ed77b4-13af-4a57-a867-2084bb1d8fc2","year":null},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.751267Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:0986d99e226f8cb7cbc28c7212d39f563297e3e2f3b71df2b5d5571bd33b7b63","observation_id":"f5c57411-e10c-48db-8222-c7cdebebdba2","resolution":{"observed_at":"2026-08-10T19:40:47.999466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.982758Z","title":"”Depth-first iterative-deepening: An optimal admissible tree search.” Artificial intelligence 27.1 (1985): 97-109","venue":null,"work_id":"d3268e57-28c5-4f3a-83d0-203065777d58","year":1985},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.754814Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c38456408ad2b220fde649d10b9af9dde219fef335c1b378e840455627296aaa","observation_id":"07edcb39-8fc7-43df-8ab0-a87f409c26a7","resolution":{"observed_at":"2026-08-10T19:40:47.987017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.971340Z","title":"”Computational complexity of puzzles and related topics.” Interdisciplinary Information Sciences 29.2 (2023): 119-140 28 R","venue":null,"work_id":"9c60a3eb-893d-4f0c-9a51-1715e65d08c0","year":2023},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.758356Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:7e3f260ad72ecd77956fa4ca759bb927ce0e7ce8c81ee6100ddaaa113f7112e1","observation_id":"6fa4676b-23a9-4a9a-86af-3bfbc7823ab8","resolution":{"observed_at":"2026-08-10T19:40:47.975370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.960083Z","title":"”Open problems related to quantum query complexity.” ACM Transactions on Quantum Computing 2.4 (2021): 1-9","venue":null,"work_id":"d82c7f9b-1d88-45c4-b47c-002fb46d92f6","year":2021},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.761773Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:862c41791cc034eb0c3d2b37f6a6238b8b576c24cd655641a807d7440696c696","observation_id":"e13c1060-a479-4196-a4a9-630d0ac72923","resolution":{"observed_at":"2026-08-10T19:40:47.963938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.949806Z","title":"”Quantum computational complexity from quantum information to black holes and back.” The European Physical Journal C 82.2 (2022): 128","venue":null,"work_id":"bb61919b-7d5d-43db-9f9f-c4316b361b14","year":2022},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.765958Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:7a8ba7bc63c31841bddbf3da6226312e2fb6083478364794d9986641f16eaa82","observation_id":"34cc0df0-9ea8-4bb6-9b03-d6d013e24e6c","resolution":{"observed_at":"2026-08-10T19:40:47.953227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.940165Z","title":"”DSolving: a novel and efficient intelligent algorithm for large-scale sliding puzzles.” Journal of Experimental & Theoretical Artificial Intelligence 29.4 (2017): 809-822","venue":null,"work_id":"db1fbd3b-a8cb-4758-b6d6-146a78ab7cdc","year":2017},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.770320Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:5a7b0a0f8979953000b2f37b27a5e18e156d663b4212b89f5fd9e7f0c05e9163","observation_id":"b33ba2ba-677c-400c-b868-20dc5f960346","resolution":{"observed_at":"2026-08-10T19:40:47.943671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.930024Z","title":"”Large-scale parallel breadth-first search.” AAAI","venue":null,"work_id":"841caa3a-ef98-4cd5-a047-cc9d193bd9d2","year":2005},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.774700Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:a9a9516d504f025fd32db15c23d069ebc16e480977a149becd54ff08dd61c0c5","observation_id":"f2e8bd4c-f93f-4cd6-bdc9-903ff4ce52e3","resolution":{"observed_at":"2026-08-10T19:40:47.933694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.919525Z","title":null,"venue":null,"work_id":"4c52a3cc-e782-46d9-a90f-a9dd41656c16","year":1984},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.778516Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:dbf4425e5958022909db6571f2951af2667e88979ce0306060073ffd7f1c4080","observation_id":"df720fb5-4aed-4cf1-8129-376df3f3d279","resolution":{"observed_at":"2026-08-10T19:40:47.923056Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.908348Z","title":"”On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles.” Proceedings of the AAAI Conference on Artificial Intelligence","venue":null,"work_id":"e7af9953-6d56-4749-8d7e-f2411d085f23","year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.782890Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:650f752dfd6ba57d74bb31ab9707a3ed855852d95922c43f8cb51c3eade707eb","observation_id":"ecd785f7-6ec8-44b0-953f-8e31634589da","resolution":{"observed_at":"2026-08-10T19:40:47.912588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.896585Z","title":"”Geometric complexity theory.” An approach (2007)","venue":null,"work_id":"ee98d783-209e-452a-889c-d485c9526d38","year":2007},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.786980Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:93e0e8b2ee020444eb6ec24300ed487c21bed101af1dfb38fc53c9e77f8df8e5","observation_id":"37335d3b-e4a0-4838-9055-68bc1339677c","resolution":{"observed_at":"2026-08-10T19:40:47.900661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.873052Z","title":null,"venue":null,"work_id":"a356a460-1533-49aa-9b9c-e89fbab266ba","year":1977},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.795238Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ec8a0e743eb74265a2ce46b7b1e8e1ffffc28ee22b448af6e0c5e747a9fb0be6","observation_id":"6a14c6a4-f80c-4577-8c84-62e0180e1cbc","resolution":{"observed_at":"2026-08-10T19:40:47.876884Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.861456Z","title":"”P, NP and mathematics–a computational complexity perspective.” Proceedings of the ICM","venue":null,"work_id":"c38fff0b-3eec-4693-852d-e297a61f0b9e","year":2006},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.799627Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:2e8528da8a62b38a08e2b9c497296d58d4eecb4d91b70c86ad86594cf837b9dc","observation_id":"ad79c611-d3f1-4838-a9b2-cce656b683a4","resolution":{"observed_at":"2026-08-10T19:40:47.865696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.849353Z","title":"”A short history of computational complexity.” Bulletin of the EATCS 80.01 (2003): 2003","venue":null,"work_id":"7d1ceaa3-84df-45d2-b58d-ac3c999810c2","year":2003},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.803896Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:b187bdd8f256f6dbb63ebe0dd10b5c650d8ef7cc59995f5d5790bff951f18f9c","observation_id":"b850b319-ffb9-4798-a34e-042026542fca","resolution":{"observed_at":"2026-08-10T19:40:47.853465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.837671Z","title":"”The P versus NP problem.” Clay Mathematics Institute 2.6 (2000): 3","venue":null,"work_id":"4ce89e9d-2d78-4675-9234-3b4705ab32db","year":2000},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.808382Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:1c0407f4cf1c4e44a613180f8fb85371b799b28d4a6b9d2b6d6eb3c563c10229","observation_id":"0febc4b7-3c3f-4ae4-8eee-1930e0cee30b","resolution":{"observed_at":"2026-08-10T19:40:47.842032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.826716Z","title":"”The importance of the P versus NP question.” Journal of the ACM (JACM) 50.1 (2003): 27-29","venue":null,"work_id":"146667b1-803c-446a-81cc-233286585ff2","year":2003},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.812335Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:852513c41186bc10d623f4f1c6bc0d00b1087c4fb79175e9c6fec1b69d21cedd","observation_id":"7d731974-61c1-4e65-a8b6-4722b21a2d36","resolution":{"observed_at":"2026-08-10T19:40:47.830566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.815380Z","title":"”The P versus NP Problem, April 2000.” Clay Mathematics Institute at http://www","venue":null,"work_id":"e5ccd419-dc48-44fd-8ac2-f946256e2357","year":2020},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.816401Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:6406287b23c38aa811648afb765d9eb8360edc3999f07ab47a575b181576961a","observation_id":"7ead69f8-2206-498a-94e0-334e9a49a1ac","resolution":{"observed_at":"2026-08-10T19:40:47.819328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.804561Z","title":"”Scheduled relaxation Jacobi method: improvements and applications.” Journal of Computational Physics 321 (2016): 369-413","venue":null,"work_id":"ab3db72a-f1ca-4387-becd-750d21c3d450","year":2016},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.820348Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:aa48f5cc7fbfa60621318081b5c7c0d948d26dc8b20883fb28db252522cfd57c","observation_id":"440806da-ea7e-4e50-a5a7-a77d60e1f36c","resolution":{"observed_at":"2026-08-10T19:40:47.808173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.792072Z","title":"”Parallel multigrid smoothing: polynomial versus Gauss–Seidel.” Journal of Computational Physics 188.2 (2003): 593-610","venue":null,"work_id":"b5b6f752-53ad-4ba5-bd21-6fb5bb0c0238","year":2003},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.824564Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:59d9297ea92025b3e218250ed79cd64b9a205f8bf97dc927202571ab06c82468","observation_id":"37a0fa65-4132-49cc-b351-9346f3c2eb8b","resolution":{"observed_at":"2026-08-10T19:40:47.796724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.780027Z","title":"Pulliam, and David W","venue":null,"work_id":"ccc94a61-1bb5-413d-93cc-c03cdf80bd55","year":2001},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.828684Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:00f203c86076c679603e1072b6be0e1504b1685e9487e942a032c01d0dd75595","observation_id":"1c4b58d4-ab26-4db2-bb44-3b8fa0c9dbc9","resolution":{"observed_at":"2026-08-10T19:40:47.783785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.769154Z","title":"C., and R","venue":null,"work_id":"3bb2de4e-be6a-462c-ba40-308eee2f3bb5","year":1976},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.833001Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:55b535e619500d0591973986a03570215561f490b3330507bf7b0b8fa4dd53ec","observation_id":"d9154366-a352-476c-a985-9af9407e00d1","resolution":{"observed_at":"2026-08-10T19:40:47.772899Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"ph/9507414","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:40:47.162545Z","title":"”Reheating and thermalization, linear vs","venue":null,"work_id":"54b34a61-2cc7-419d-9fd7-7c583d2641a6","year":1995},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.836809Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:0f897142bff127f5ef0d4311cf8835194119a3af042483a55ca26031c11bbc80","observation_id":"e4ab4698-11d8-430e-84bb-ef962f541f9e","resolution":{"observed_at":"2026-08-10T19:40:47.169735Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.756951Z","title":null,"venue":null,"work_id":"d872a9c6-68fd-479e-943a-9bf04d6d4f08","year":1994},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.840616Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c8821f4137781965eacd3e9b3eeafc6532bd292a50a4ed594beb21555e5a7b5d","observation_id":"952c2349-1cc4-4a2d-acda-27f738c9c4a1","resolution":{"observed_at":"2026-08-10T19:40:47.760953Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.745115Z","title":"”The general theory of relaxation methods applied to linear systems.” Proceedings of the Royal Society of London","venue":null,"work_id":"80acc272-b523-48d8-948b-95b9a92b4c40","year":1939},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.844363Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:0d03a71ba326a0719789a54a506ef7e07883e0e7cffdf9102734dc5bc45b93ee","observation_id":"2e17e959-998c-4b2d-b8ab-dbfd74c3e9e0","resolution":{"observed_at":"2026-08-10T19:40:47.749377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.732074Z","title":null,"venue":null,"work_id":"17e2c3f6-fc3a-4c96-9888-fccfd0ed8073","year":1974},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.847742Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:1980c38e63ae47e0da4f2a8e172b6382fad27f523effbc2e62a4ae92876e22a8","observation_id":"a8974b29-272b-48dd-9ae3-35f70a4b5a58","resolution":{"observed_at":"2026-08-10T19:40:47.735995Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.719749Z","title":"”Francis’s algorithm.” The American Mathematical Monthly 118.5 (2011): 387-403","venue":null,"work_id":"c6b747de-b881-416a-919b-1d9c41644653","year":2011},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.850978Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:580c915490b38d1d300797d73fcde982987ea182472a71c580edd58de98f3ee1","observation_id":"c64e6bae-679e-4aaa-a326-33107778bd37","resolution":{"observed_at":"2026-08-10T19:40:47.724436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.707029Z","title":"”The Compendious Book on Calculation by Completion and Balancing, al-Khw¯ arizm ¯ ı.” English Translation","venue":null,"work_id":"c5861d4a-384c-49a6-95ad-a85b987b04bc","year":2009},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.854134Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:cb511380892bd0af8472626816633be0dc7fc0f6b4829b015538bb6de978aec7","observation_id":"7dce5430-33d8-4486-b71d-c84955bb4f73","resolution":{"observed_at":"2026-08-10T19:40:47.711303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.694488Z","title":"Richard Witmer, and Oystein Ore","venue":null,"work_id":"59c43fd1-fe1d-4c89-8b86-a0d4a9963a30","year":2007},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.857598Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:b3617577071c18617291c32d92c0a2ef7667940855742ca99b21c9408c60f0b1","observation_id":"d50c82f2-331c-4269-938d-f46f169c5c5e","resolution":{"observed_at":"2026-08-10T19:40:47.698679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.682505Z","title":null,"venue":null,"work_id":"c6432b33-6f4b-4b6b-969c-062c191bb2e2","year":2011},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.860926Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ac49ebe321b54dafe9332843be672e03f7d9cd8d1001a5f34473e8453c838fb5","observation_id":"67f64a18-d37a-4451-b402-61d0b5ae419b","resolution":{"observed_at":"2026-08-10T19:40:47.686458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.670556Z","title":"”Sur les conditions de r´ esolubilit´ e des ´ equations par radicaux.” Journal de math´ ematiques pures et appliqu´ ees 11 (1846): 417-444","venue":null,"work_id":"4fbef43e-a040-4674-a366-2a31ef1b0adf","year":null},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.864917Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:7507e404e2b11dcfedea03d0b97677261d34865dc452f9b6961dfe2e37bc95b4","observation_id":"a8b35184-b019-4dbc-b6cd-1710a1aae3eb","resolution":{"observed_at":"2026-08-10T19:40:47.674861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.660043Z","title":"General recursion theory","venue":null,"work_id":"9cc11d5a-bb06-449f-8f14-bd683f907c8a","year":2017},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.869096Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:9f15cb45ca0df81690ccbe51774635aa1b3b45fbdc5cf6169a6dab91bf38fb43","observation_id":"5198feba-f0a6-4526-80cf-572822fb322f","resolution":{"observed_at":"2026-08-10T19:40:47.663690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.648456Z","title":"”Numerical solution of multivariate polynomial systems by homotopy continuation methods.” Acta numerica 6 (1997): 399-436","venue":null,"work_id":"6860706a-7092-4db7-ab49-210cb186c200","year":1997},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.872866Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:44485245971d05f2703cd40a6d579f889e2b05f412abed91b900efc4b9961f2c","observation_id":"853ff4a8-7646-45ba-abb8-5c31f4a3dc34","resolution":{"observed_at":"2026-08-10T19:40:47.652226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.638241Z","title":"C., and James A","venue":null,"work_id":"dbb28137-7961-420c-83c5-8211d9f472d5","year":1978},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.876588Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c94f4182277f14048b4a7da087845abaf40dac6a84fefe1c39459e3f9d91b802","observation_id":"001f9c2d-c9a2-49b0-9c27-18b1efd77cd4","resolution":{"observed_at":"2026-08-10T19:40:47.641660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.626544Z","title":"”Numerical polynomial homotopy continuation method and string vacua.” Advances in High Energy Physics 2011.1 (2011): 263937","venue":null,"work_id":"8e20ddf7-7fb8-40bb-8e70-86ff49afeb6b","year":2011},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.880347Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:a0a93caf89cde98ef1e1e06d8990bb5265b92099e2c4e251cdc866ccdee4441e","observation_id":"e30b4aa3-7662-4131-ac8d-d36a52d2a18f","resolution":{"observed_at":"2026-08-10T19:40:47.631000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.615040Z","title":"Introduction to numerical continuation methods","venue":null,"work_id":"2974439c-fe94-48a5-b447-f9a763353e4f","year":2003},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.884170Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:8646d1fbe03c7eafa85567df1b3c158d755f3dc20c3b35b8aa93d0f50cee27d7","observation_id":"352fbafe-d286-4b13-9d74-d75f1ba6aead","resolution":{"observed_at":"2026-08-10T19:40:47.619087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.603500Z","title":"”PHCPACK: A general-purpose solver for polynomial systems by homotopy continuation.” Preprint (1997)","venue":null,"work_id":"79719f0d-fc26-40ba-a01c-eee57f495f09","year":1997},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.888215Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:6463af414e20bf411aa48d2accc80919d2eb8e228ff00649d723258cd14d9261","observation_id":"f0795b90-ac13-4460-a7cc-8b9703b7df44","resolution":{"observed_at":"2026-08-10T19:40:47.607723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.590489Z","title":"”On the Ruffini–Abelian theorem.” (1896): 200-221","venue":null,"work_id":"2e5467f5-f791-4511-9f33-f766baecae64","year":null},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.891995Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c166115efddfaaf07f2e26e49d8fe471e94a7a0b99fe3cbc321c0934fa8a4680","observation_id":"6cbe1509-9cb5-4bbe-acca-09fd5db0761a","resolution":{"observed_at":"2026-08-10T19:40:47.594787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.578068Z","title":"M´ emoire sur les ´ equations alg´ ebriques, o` u on demontre l’impossibilit´ e de la r´ esolution de l’´ equation g´ en´ erale du cinqui` eme d´ egr´ e","venue":null,"work_id":"475043c8-7042-48cf-a73b-8b2b0924cb96","year":null},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.896076Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:deb588779599ff6be040f0bdfa85a8c698d1eaad143bebfe795f6ebdab7562a0","observation_id":"d35727bc-da94-4d16-990d-c80b7ae23bc4","resolution":{"observed_at":"2026-08-10T19:40:47.582565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.566178Z","title":"Sidney, et al","venue":null,"work_id":"1f1c2543-dd95-4690-950e-ce3d58db5027","year":2003},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.900903Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:a6618ca94a1c2c0067a90dce1a15ce04c86d77aee6358df6e912a8ac1eafc14d","observation_id":"1fac82ca-f8fd-4e1d-96da-fe8acfaebd46","resolution":{"observed_at":"2026-08-10T19:40:47.570305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.554004Z","title":"”Newton’s method in practice: Finding all roots of polynomials of degree one million efficiently.” Theoretical Computer Science 681 (2017): 146-166","venue":null,"work_id":"71af4ef3-ad72-4a49-9efb-b5a126aebb7f","year":2017},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.904759Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ae6ec33eb1384d4eef942732893915cb128ace3f403374fc69c9f5b8e2eab120","observation_id":"75ac4742-d548-4c84-abb9-a6fe9f6408ec","resolution":{"observed_at":"2026-08-10T19:40:47.558331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.542720Z","title":"E., and R","venue":null,"work_id":"34ad0113-6fd8-40cf-ad1e-aaee021861d7","year":1981},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.908556Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:89b99e54780a568dab20bc2ddf530ce7c729c70529130e9452a7f8ea4e697247","observation_id":"a1cf7bb1-a563-47b7-9805-8623a5521322","resolution":{"observed_at":"2026-08-10T19:40:47.546314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.531226Z","title":"”SYSTEM OF LINEAR ALGEBRAIC EQUATIONS AND METHODS OF THEIR SO- LUTION.” Multidisciplinary Journal of Science and Technology 4.1 (2024): 39-44","venue":null,"work_id":"dbb752d3-a5e3-45e2-a340-38643ec51ad2","year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.912284Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:38c45e47ffb8b0bf1ddd7b972b84fbde1e0aa4926f4d085018f4d3d627ba5160","observation_id":"eb7ab4eb-6f1b-4ed8-8664-f5486dda67b7","resolution":{"observed_at":"2026-08-10T19:40:47.535440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.519609Z","title":"”Solution of a System of Neutrosophic Linear Algebraic Equation by LU Decomposition Method.”","venue":null,"work_id":"82efe75d-71b6-4e5f-8242-4a99ddcc7f6e","year":null},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.916082Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:61043795a5e7f1c4b5918ea8b1fa0f9fbbf1edf36dd3f44b5ffaad0e9cd138b7","observation_id":"63efc47d-a78f-47aa-b30e-108cf5a3d1ec","resolution":{"observed_at":"2026-08-10T19:40:47.523891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.508737Z","title":null,"venue":null,"work_id":"12485394-baa7-4050-a992-7b280222bd8e","year":1985},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.920275Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:7f5968278a96177fb099846ca324ce400e0457cea7c16b669d20af0de8169ad9","observation_id":"cee07418-f7d2-4a11-8ece-44ce1238cd16","resolution":{"observed_at":"2026-08-10T19:40:47.512602Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.496084Z","title":"”Implicit schemes and LU decompositions.” Mathematics of Computation 37.156 (1981): 385-397","venue":null,"work_id":"f8c683ef-28da-4a32-977c-cbed8cb396c0","year":1981},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.924306Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:71b8ff98a5482da3667b13a1b09003ef15717d638513d31f2f6d7eff824eb70f","observation_id":"1488d8d6-f3fb-4e7a-92b6-45685cc734f1","resolution":{"observed_at":"2026-08-10T19:40:47.500388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.484177Z","title":"”Distributed localization using Levenberg-Marquardt algorithm.” Eurasip journal on advances in signal processing 2021 (2021): 1-26","venue":null,"work_id":"77013615-bd02-46d4-92d7-01207f5b3692","year":2021},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.928229Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:4c1f4a1f2c3b875c4c85d21331fcad57ae85cbb3066d25dec68586d9b6955d1c","observation_id":"b030979e-4a65-406d-8f4e-f78dd40ad698","resolution":{"observed_at":"2026-08-10T19:40:47.488361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.472121Z","title":"”Improved computation for Levenberg–Marquardt training.” IEEE transactions on neural networks 21.6 (2010): 930-937","venue":null,"work_id":"c88c9e3d-de69-43c3-a0ed-1d5692b328e7","year":2010},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.932547Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:afa2a495b3fd449e1ffce584e8ccd0fd8a9c3272ae0cd86ca23ffc4cdc61738a","observation_id":"97e31011-c4f7-4561-8138-c6cef14607ff","resolution":{"observed_at":"2026-08-10T19:40:47.476163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.460432Z","title":"”The levenberg-marquardt algorithm.” Tutoral on LM algorithm 11.1 (2004): 101-110","venue":null,"work_id":"bbef9ca5-5078-4cc0-8963-ac7c89194dd4","year":2004},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.940283Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:422178edbb86a66a72585d2433fcfae4b3ad1556be4ca61588277b57162b3598","observation_id":"4ee5611c-de24-4f0b-9cb3-6d24b49fc852","resolution":{"observed_at":"2026-08-10T19:40:47.464329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.448099Z","title":"”A modified Newton method for solving non-linear algebraic equations.” Journal of Marine Science and Technology 17.3 (2009): 9","venue":null,"work_id":"9f16fd6c-b281-48d7-b153-ebb5e86a0736","year":2009},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.944048Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:88ab8e34d2cf8b5ced906788889fbc3005dec6f91418fd76da6e431afd5bc336","observation_id":"01f42713-8180-45b0-a2b5-0d8a458e7532","resolution":{"observed_at":"2026-08-10T19:40:47.452417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.435474Z","title":"”Numerical experience with Newton-like methods for nonlinear algebraic systems.” Computing 58.1 (1997): 69-89","venue":null,"work_id":"805f9e61-25f4-4e3c-90a8-3bd7f21b998e","year":1997},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.947866Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:db8ca932be2ed9fe244694c891f857d9bf846cacc61af3da5f97086fbb57ed21","observation_id":"f488cfde-edb3-4b1d-a5d1-6f702ae2c295","resolution":{"observed_at":"2026-08-10T19:40:47.440356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.422705Z","title":"”Practical quasi-Newton methods for solving nonlinear systems.” Journal of computa- tional and Applied Mathematics 124.1-2 (2000): 97-121","venue":null,"work_id":"142bc03e-7363-4a53-8572-420471fe2aa0","year":2000},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.951923Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:0fd9c070f81de99eddc82036a83f7efbc6b72b9201a5dea1256e3f4da5b31343","observation_id":"4f98f1b0-02f1-483e-ad38-9d6c5d863671","resolution":{"observed_at":"2026-08-10T19:40:47.427098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08668","last_updated":"2024-03-15T23:10:15Z","snapshot_observed_at":"2026-08-12T11:57:06.024743Z","submitted_at":"2023-12-15T06:21:18Z","title":"Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem","version":3},"cited_work":{"arxiv_id":"2401.08668","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.08668","snapshot_observed_at":"2026-08-10T19:40:47.057084Z","title":"Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem","venue":"cs.IT","work_id":"78764dd6-4520-4e7c-89b2-1f299888b92b","year":2023},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.955818Z"},"links":{"cited_paper":"/paper/2401.08668","citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:1701804b4414c9921ccea7292a45d49527dd3cede983da0882806e878df64952","observation_id":"62519ee0-e810-46b0-93f3-3cd09b141a03","resolution":{"observed_at":"2026-08-10T19:40:47.063964Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.411161Z","title":"”Thermodynamic Perspectives on Computational Complexity.” Thermodynamic Perspectives on Computational Complexity","venue":null,"work_id":"e638fb1b-b364-49d6-92a6-5a505dc13c61","year":null},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.960573Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:46cb8717eb19ad80d997153c8c1dc81743d811ce2680d820d62b01883c97a713","observation_id":"66b63b59-1322-48ed-bae2-f0752ec61514","resolution":{"observed_at":"2026-08-10T19:40:47.415206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.399207Z","title":"”On computable numbers, with an application to the Entscheidungsproblem.” J","venue":null,"work_id":"78559f65-2139-41b0-987f-9c5c9010ac9b","year":1936},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.966184Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:5ca2105a17dd1f6f2555611420e0abe26acf69507bab174bef0bed6c5048c53b","observation_id":"5ae85fd6-92e3-4735-947a-93ddce399033","resolution":{"observed_at":"2026-08-10T19:40:47.403251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.388561Z","title":"”P vs NP.” (2014)","venue":null,"work_id":"1dc712a5-2ce6-4878-8247-dc3fac4dac47","year":2014},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.970511Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:463809fc4ea2e53bc21c8bab7c77427da354a8c61b960012053ebba89004f130","observation_id":"920ca36c-9539-4923-baa4-8e22e29e4487","resolution":{"observed_at":"2026-08-10T19:40:47.392288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.376905Z","title":"”On the P versus NP Problem.” (2024)","venue":null,"work_id":"3eac4dda-1d4a-4299-9f22-272d33e5b417","year":2024},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.974249Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:e2a95b8dd1117c4fa7e8392940daaf7082ddae2c2736e1d99eebc5320dea6e5f","observation_id":"678cbc47-e3a3-48b1-b633-94d540f13b79","resolution":{"observed_at":"2026-08-10T19:40:47.380894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.365037Z","title":"”NP on Logarithmic Space.” (2023)","venue":null,"work_id":"b08bcd63-0ea8-4add-8ea6-45a8086889a3","year":2023},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.978315Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:511d224e9a7eae7ced7a2f6791573de202178989b81382392b825600e08964fb","observation_id":"35b6c4ae-d636-48dd-80a6-7812cc5dabb5","resolution":{"observed_at":"2026-08-10T19:40:47.368989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.353789Z","title":"”Hard problems of algebraic geometry codes.” IEEE Transactions on Information Theory 54.1 (2008): 402-406","venue":null,"work_id":"8236a8c8-bbf8-4a8c-bcab-14385cc4e368","year":2008},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.982179Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:968b520c0e8048e5a66bec6b0f0deabc83728b21d77dc7e7689624cc8965dbdb","observation_id":"d67f28d1-a669-4da2-8af7-c4e5a89a06a9","resolution":{"observed_at":"2026-08-10T19:40:47.357716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.340431Z","title":"”Parallel computation for well-endowed rings and space-bounded probabilistic machines.” Information and control 58.1-3 (1983): 113-136","venue":null,"work_id":"f13bdb79-e099-4da0-996e-db19d996162c","year":1983},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.986146Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:1ee998bc77f537365d302fec16550260761c121d854a7507760fb85e0c427f4b","observation_id":"cb15f480-23a7-410a-b7f3-eb95c14a48e9","resolution":{"observed_at":"2026-08-10T19:40:47.345834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.884756Z","title":"P, NP, and NP-Completeness: The basics of computational complexity","venue":null,"work_id":"1ddb91ed-fe29-46ab-ac5c-61865d602dfd","year":2010},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.989751Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:f734fa01011605bec31488ab84f3a027e376a240b97667476e680cd6d8b03ab6","observation_id":"27bcb3d7-49e2-4df6-af77-00befe0c868b","resolution":{"observed_at":"2026-08-10T19:40:47.889148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.327233Z","title":"”Evaluation of polynomials by computer.” Communications of the ACM 5.12 (1962): 595-599","venue":null,"work_id":"f854b261-9a8e-476e-a83b-a0794ff66082","year":1962},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.993357Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:734a03e0d7533f65b6a4a34e8f7208915c03ae0a74fda84902b896759f91a490","observation_id":"cf445cda-ba52-43eb-a4a0-0364b532f26c","resolution":{"observed_at":"2026-08-10T19:40:47.331205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.314137Z","title":"”Another new proof of the theorem that every integral rational algebraic function of one variable can be resolved into real factors of the first or second degree.” (1983)","venue":null,"work_id":"ce322d78-fdb6-456a-a70e-bf6832b9c0f8","year":1983},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:46.997289Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ee3e82b4f2f13ea60d524ffdad295ddb43484dd56b042fb706075c7c89d32f7d","observation_id":"64fe14bb-180d-4203-ad80-cdb248efae6c","resolution":{"observed_at":"2026-08-10T19:40:47.318718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.301514Z","title":"”Gaussian elimination.” Wiley Interdisciplinary Reviews: Computational Statistics 3.3 (2011): 230-238","venue":null,"work_id":"d716dc88-c979-4269-b578-6c015b12406c","year":2011},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:47.000843Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:ef068af379de3e15d972657e9b1340a8e528ce681c3b2db1f617c9c3b52d5e6b","observation_id":"81989dca-3ef6-4c01-a8e4-91636f0c0832","resolution":{"observed_at":"2026-08-10T19:40:47.305814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.289473Z","title":"”Scaling for numerical stability in Gaussian elimination.” Journal of the ACM (JACM) 26.3 (1979): 494-526","venue":null,"work_id":"40b88082-b2e2-4cf2-89b2-0d749e385829","year":1979},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:47.004362Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:5f8a61bfddcd2cd721ced564feccd0fb6a5989e6c308d13305ce370029f7a289","observation_id":"dcaa1cd7-61de-41b1-bf27-cdead8e1548d","resolution":{"observed_at":"2026-08-10T19:40:47.293550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.276938Z","title":"”On some pivotal strategies in Gaussian elimination by sparse technique.” SIAM Journal on Numerical Analysis 17.1 (1980): 18-30","venue":null,"work_id":"ddc8c636-c0e3-4f4d-99c8-bf69f647074c","year":1980},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:47.008173Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:c2e0fd8c552fcfdc0ae986a4a3b65517da15e68956edc7b15aca66322a2ac0d7","observation_id":"7a8995e5-d100-463f-a0bd-194a4eecaa51","resolution":{"observed_at":"2026-08-10T19:40:47.281205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-10T19:40:47.264809Z","title":"”Gaussian elimination: when is scaling beneficial?.” Linear algebra and its applications 162 (1992): 309-324","venue":null,"work_id":"782e7262-a332-4c20-a1d2-6a530593df93","year":1992},"citing_paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-10T19:40:47.011533Z"},"links":{"citing_paper":"/paper/2501.10480"},"observation_digest":"sha256:646b36bb5fd3d859e8b8b506c596f78f9cc981c643bb6b8b5087ce64b550dc0a","observation_id":"ac3125f7-5178-45ae-9b94-f66d119eeaa8","resolution":{"observed_at":"2026-08-10T19:40:47.269028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.10480","last_updated":"2025-01-17T00:11:48Z","latest_version":1,"primary_category":"math.GM","snapshot_observed_at":"2026-08-10T19:53:56.511236Z","submitted_at":"2025-01-17T00:11:48Z","title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity"},"reference_resolution":{"displayed":94,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":3,"verified_fuzzy":67},"total_outbound_references":94},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 94 of 94 outbound references and 0 inbound Pith citation observations for arXiv:2501.10480."}