{"as_of":"2026-08-16T16:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:97fac4db0dc75ef038dfb73149a8cd8dce07123a47327682ab7d7f0a70838b2b","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:55:20.887870Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.07447/citation-record","integrity":"/paper/1908.07447/integrity","json":"/paper/1908.07447/citation-record.json","paper":"/paper/1908.07447"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.411812Z","title":null,"venue":null,"work_id":"4e40bc62-2f75-49e6-aa2e-cfcee9e38bee","year":1996},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.717307Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:8f3cee906d36c1c320df4e5e6e5b0aa3b557650b4b83e4112f6e469cd11b888b","observation_id":"c8457600-1e4d-43ac-8721-cad3873865ae","resolution":{"observed_at":"2026-08-14T12:55:21.415935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.401963Z","title":"Bermond, Hamiltonian graphs, in Selected Topics in Graph Theo ry ed","venue":null,"work_id":"7e169302-f49e-4610-8fb9-6c6e9997d43d","year":1978},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.721287Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:7ac8cec78aeab86abe8bd8d00aa212920ea1350c0886eb5b82fef124f126bae3","observation_id":"6a681aa8-278d-4e63-85c6-fc332f01eddd","resolution":{"observed_at":"2026-08-14T12:55:21.405807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.391719Z","title":"Bertossi, M.A","venue":null,"work_id":"fe49eeee-0cbe-4352-8a9b-70012d3fe8e0","year":1986},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.724560Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:703371983418ee21580d46153cc62b866cdf2117b01005747e633fc94833d3dd","observation_id":"a27fcc61-dc55-4d5a-8c10-8dcf1cf56ecf","resolution":{"observed_at":"2026-08-14T12:55:21.395437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.382728Z","title":"Bondy, U.S.R","venue":null,"work_id":"6d0fa93f-f9dd-406d-88f5-1ef450186d1b","year":1976},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.728372Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:d1d63bbcffacd3a65cf939f18d3c4aa56c92572216f849b4e951c94526fda11f","observation_id":"cba5aad2-92de-4323-9c3e-fe37cdef00d3","resolution":{"observed_at":"2026-08-14T12:55:21.385838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.373856Z","title":"Bulterman, F.W","venue":null,"work_id":"10b34ab4-da54-42ec-b52f-34765aa43cea","year":null},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.732038Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:fbbfdc637115b1cb385c722e038750f411c8cf34fc27a751642b700708ec901b","observation_id":"d3ed6238-b133-43a4-b711-7ac919917b01","resolution":{"observed_at":"2026-08-14T12:55:21.377176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.364211Z","title":"Chen, J.S","venue":null,"work_id":"d1d87f81-342d-4677-bc3d-6a131b633eb7","year":2000},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.735516Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:a19cde9695ca7582060641f18048de0a9098c12b97283bce73389322db1096ff","observation_id":"e3ebef53-4212-4fe1-9f90-505a6f926e91","resolution":{"observed_at":"2026-08-14T12:55:21.367369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.355997Z","title":null,"venue":null,"work_id":"efefa852-ec5c-4135-aa87-57aa2a5410b6","year":2002},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.739281Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:667a4127a8b167acff509d29c1127e5292e90c80fdd101f2f75bcf314056be0c","observation_id":"09b56964-c421-43e2-964b-2a3bfffaf95a","resolution":{"observed_at":"2026-08-14T12:55:21.358688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.347229Z","title":"Chen, C.H","venue":null,"work_id":"5e55f6f9-fdcb-4b83-81b7-1444b4f3aa9e","year":2004},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.742698Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:79051c4ed8dcaad118d0ad53d75c90725d3cd890bd5b423b425bbf945b035822","observation_id":"c0c261b1-c88a-4b2b-8685-dfa2b9bb8a72","resolution":{"observed_at":"2026-08-14T12:55:21.350791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.337423Z","title":"Damaschke, The Hamiltonian circuit problem for circle graphs is N P-complete, Inform","venue":null,"work_id":"975fec8d-c125-4856-837a-145b6ce81275","year":1989},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.745731Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:792221be28b5623d427eed07c88878a3dfea8ab8a08b342b0869d2e1778ae9fc","observation_id":"890b4955-3a86-4995-937c-f7074dee68a0","resolution":{"observed_at":"2026-08-14T12:55:21.340922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.327930Z","title":"Ebrahimi, M","venue":null,"work_id":"897a2fe7-caaa-497f-9a36-05562d0d8584","year":2013},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.748995Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:dc717bc665bba9a7143418b60fa4cf5a42e5e6e65b6af6dc40d51356f6ba09b8","observation_id":"286b3d3a-68a7-40ef-b552-6545e2fa88d3","resolution":{"observed_at":"2026-08-14T12:55:21.331467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.318164Z","title":"Fu, Hamiltonian connectivity of the WK-recursive with faulty nodes, Inform","venue":null,"work_id":"6b8f5e06-258e-496f-97d1-80ce8979da50","year":2008},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.752200Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:94434d17ad29e9d25b8629ef291ea789214dffea9b93661b8b205207ecc7ecaa","observation_id":"b1d13832-b5e1-4328-8452-cb07308d9367","resolution":{"observed_at":"2026-08-14T12:55:21.321678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.309256Z","title":"Garey, D.S","venue":null,"work_id":"9927e6ca-eca1-490c-80e1-ef751b972615","year":1979},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.755465Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:35f8dba075bf17a673a17ea3a39a20f02715b62b1e42cf37b0c16fcdaf89085a","observation_id":"07e8c8d9-fb7f-4ed9-b08a-8cf94704c7ff","resolution":{"observed_at":"2026-08-14T12:55:21.312411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.299161Z","title":"Golumbic, Algorithmic Graph Theory and Perfect Graphs, Se cond edition, Annals of Discrete Mathematics 57, Elsevier, 2004","venue":null,"work_id":"552d3210-a6fc-4331-bad7-175c424004df","year":2004},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.758593Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:9ce783c854a08500f35afc82d93b517c844208673266d9f2a39114d2c350a048","observation_id":"d74646bf-1cbf-4c8c-9df8-7312b7ee21ec","resolution":{"observed_at":"2026-08-14T12:55:21.302638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.289887Z","title":"Gordon, Y.L","venue":null,"work_id":"aac81d05-6ceb-4b34-93a8-380aed40081b","year":2008},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.761658Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:f8358a14fdf2182373c3657f8fac97193685ed0b4f1a02ce6a8bc031bebc5700","observation_id":"c1aeb382-2283-4d17-b05b-56c96db30f8c","resolution":{"observed_at":"2026-08-14T12:55:21.293136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.281653Z","title":"Grebinski, G","venue":null,"work_id":"757131a0-933b-41bd-af0f-63db00b3a213","year":1998},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.764254Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:ec2dd1a576e4f491653dfdcf13e6cc5100914f897d6f84af2b2babd38f3ccea3","observation_id":"308f5f07-f52a-4b61-9d86-be6d239f6ddc","resolution":{"observed_at":"2026-08-14T12:55:21.284370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.272480Z","title":"Gutin, Finding a longest path in a complete multipartite digraph, SIAM J","venue":null,"work_id":"20e36df8-e17a-4e60-a1f7-6018bf3fff5a","year":1993},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.766694Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:0c8212e073253b9a66523d82c22ec32841454fdd819dd32b42a6bef5527050bd","observation_id":"c69a2a1a-d38d-4a0e-9e22-fdfcad24d3cb","resolution":{"observed_at":"2026-08-14T12:55:21.276108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.263855Z","title":"Hsieh, C.N","venue":null,"work_id":"bd09b229-95f8-4e9e-ba6f-1e87539320f3","year":2007},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.769259Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:488db9c7f62018435156bc32704511c3b3017d1b58ad3f2a1f04b6ca059f97c7","observation_id":"0d446173-299e-4163-98a2-9d73490d6926","resolution":{"observed_at":"2026-08-14T12:55:21.266838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.255412Z","title":"Huang, M.Y","venue":null,"work_id":"cead3d07-b2e8-44f9-ba2e-d48c0be63650","year":2000},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.771915Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:9831c2169d7dee0c5d40ec271b7ee6d5cc831b772b6dc5e57de5d807db960d77","observation_id":"cfa1206a-0859-4a7e-a0cb-3302d309dade","resolution":{"observed_at":"2026-08-14T12:55:21.258588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.246508Z","title":"Huang, J.J.M","venue":null,"work_id":"409157f7-63b6-476f-96dc-c9a763eafb64","year":2002},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.775305Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:df6b741ffe4067605f836581216a057f59b0a7392924c4b170c65126707ebfca","observation_id":"c5d2396e-3f83-4e81-a8ee-4add38b3916b","resolution":{"observed_at":"2026-08-14T12:55:21.249595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.237469Z","title":"Fang, The pancyclicity and the Hamiltonian-conne ctivity of the generalized base- b hypercube, Comput","venue":null,"work_id":"28436333-95c4-46bb-b494-73551284a224","year":2008},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.778078Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:1aca6026f3c2f7acf65e0263a26ce201c4a2dad85abe872db893e4cc2a716a95","observation_id":"04e8bfbb-21d3-486f-8868-1df0460c60fb","resolution":{"observed_at":"2026-08-14T12:55:21.240843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.228594Z","title":"Hung, Constructing two edge-disjoint Hamiltonian cycles an d two-equal path cover in augmented cubes, IAENG Intern","venue":null,"work_id":"066e62a2-25c1-4994-be76-2bebb5715004","year":2012},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.781166Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:8a968d8eb569072ca21cb202f9a1a76aa51995bf88cd0ef353aa783fcf196070","observation_id":"eff22c3b-1f85-4faa-959e-593dc1792cbe","resolution":{"observed_at":"2026-08-14T12:55:21.231886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.220180Z","title":"Hung, C.C","venue":null,"work_id":"b7a8d51e-9762-4ee7-a50f-ba60505ceed0","year":2015},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.784247Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:062cbd8a5abe33f8950bde3ee3c04efb58b486e76c4c994b827c0705f897a587","observation_id":"c847377a-7a49-4bfa-85e2-89b8ca5e5f63","resolution":{"observed_at":"2026-08-14T12:55:21.223021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.211673Z","title":"Hung, Hamiltonian cycles in linear-convex supergrid graphs, Discrete Appl","venue":null,"work_id":"4772664a-a1a2-4c53-833f-56028d69ca0b","year":2016},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.787311Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:a6e4d67716c35c22143ec80c07370ee64029a3957008b2efd7754fbcf5e44d66","observation_id":"04d4a916-ef7c-4f20-9105-538e94b78524","resolution":{"observed_at":"2026-08-14T12:55:21.214880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.202365Z","title":"Hung, C.F","venue":null,"work_id":"2051468d-6740-4796-a3e7-c7739ed66a22","year":2017},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.790904Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:63d7d815ab9f1d1f20b279554891b69e23774407cdc1b4d4d1d731bb87cdd134","observation_id":"9a7a575f-ba4c-4ef4-b0dc-08323bc841c9","resolution":{"observed_at":"2026-08-14T12:55:21.205730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.193318Z","title":"Hung, H.D","venue":null,"work_id":"e591cc21-d1a8-4bc6-a2fc-8919cf0cf3dc","year":2017},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.793959Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:c2648b336f22cc0fe69572dd4a8910d72246d5da5a848e3cbdf3fef0352d21d3","observation_id":"01dffdd6-5f60-4ad5-9ff9-64c2da6ae5b1","resolution":{"observed_at":"2026-08-14T12:55:21.196428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.184527Z","title":"Hung, J.L","venue":null,"work_id":"8012e9e4-bbb3-4dd2-8098-fc27738a476e","year":2017},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.797117Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:1fd0a6c21c1e894411ebf92e97ac5bfb7d6806ee60a31bc15a32f9fbf43cdc79","observation_id":"349e89b1-fc26-4366-be85-4dd8054452bb","resolution":{"observed_at":"2026-08-14T12:55:21.187618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.175709Z","title":"Hung, J.L","venue":null,"work_id":"2d511643-6d3c-485c-89b7-e85be8486295","year":2018},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.800314Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:4ad8de3ec0f51f2020b760859ab67f287407ab6e3bf3ce5c98422261c3db10a4","observation_id":"1db937b1-a301-4732-92dd-84851c9b5575","resolution":{"observed_at":"2026-08-14T12:55:21.178586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.166848Z","title":"Ioannidou, G.B","venue":null,"work_id":"8d43198d-cfe6-4b54-b2cb-6b5eba9ee396","year":2011},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.804784Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:ded59bb8c0273507ad1885b388c8812b3a6712d113bcf46f00dd7675862c6b64","observation_id":"d2bb2682-0e77-458c-8bf5-11494398bab8","resolution":{"observed_at":"2026-08-14T12:55:21.169890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.156342Z","title":"Itai, C.H","venue":null,"work_id":"18b0df0b-8946-4ac0-bb4a-7e6417ce3187","year":1982},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.808713Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:77b9daf0f8fa8211ac77fb7252d32efde73f03e119ae38c981084016bb9d29ee","observation_id":"8f8d8ce9-afc5-42cb-b1a3-7e6890ce9954","resolution":{"observed_at":"2026-08-14T12:55:21.160050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.147293Z","title":"Johnson, The NP-complete column: An ongoing guide, J","venue":null,"work_id":"3eb3f857-87cc-4395-8b50-00fae648681e","year":1985},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.811677Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:fe8e05b21b04eb2dc3b50f7ce5bf84bc2970dca22676f5b891edc6f703717548","observation_id":"d1fcffc3-97b7-45c3-b1f7-92cd9a4fae75","resolution":{"observed_at":"2026-08-14T12:55:21.150513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.138184Z","title":null,"venue":null,"work_id":"a52b2bd5-aa60-4dee-b107-16cb690ed05f","year":1993},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.814857Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:0c69a13b612b7acb5fb48e5797b98b0243f3d51de349ed1b33047a087080f30f","observation_id":"36a7ec63-2a65-45b8-b425-854eb08efae8","resolution":{"observed_at":"2026-08-14T12:55:21.141278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.129319Z","title":"Karger, R","venue":null,"work_id":"85b592f2-b67d-4ee1-9012-59bcdc83cb48","year":1997},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.818001Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:5bb590b449049de120a261d389ea7ea6120fb3532c97ce69f4dd58a41c46f256","observation_id":"5edb177b-7816-4caa-9470-eda124ecdd2a","resolution":{"observed_at":"2026-08-14T12:55:21.132079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.121451Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"967a8562-2ea9-4413-bb9c-52697657991c","year":2012},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.821132Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:15f1989c19b8fce6d0be5fc6320fdba48f66da00c2dd985aa925729954108569","observation_id":"2bbfeeb9-b51b-4ec0-aa47-932a0577b388","resolution":{"observed_at":"2026-08-14T12:55:21.124160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.112948Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"b9293f22-880b-4b1f-a4dd-35daa8c7a342","year":2012},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.824269Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:248587a5c0bbcae8358186e798d7b9d3ef41290d8f325d13e1b3144e3c651480","observation_id":"3e80c87c-37a7-4b2e-aaf4-0cb9c4b34ed5","resolution":{"observed_at":"2026-08-14T12:55:21.115966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.103414Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"e2e503df-3a76-4569-b024-492b8163f5e6","year":2013},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.827695Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:c0de9b2f1226165f6c73cc56f4197b8e5a7c15bc3274f4013247b9ff9b5ce013","observation_id":"7244d1fa-498f-4a3e-a69b-1c7df5861701","resolution":{"observed_at":"2026-08-14T12:55:21.106764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.095013Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"256b6779-880b-42e6-b22a-432f54a6526c","year":2016},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.831720Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:3dbde7738cd5a57d7a383301887859ac29fb9993c68e5c58984b0cde5b7205da","observation_id":"75d4f981-5f1d-4cd0-8209-6ff64bdf33b7","resolution":{"observed_at":"2026-08-14T12:55:21.098090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.085035Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"4beef691-edf2-4007-a184-f00d58dd8658","year":2017},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.834585Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:c0ba9c5ce90f0dfbf255c2a7c3c119df2e61bbe2f06f11ab6ecca6e0b7f355c3","observation_id":"1ddf1470-6b33-4183-9c8d-0f88c759c37b","resolution":{"observed_at":"2026-08-14T12:55:21.089246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.075779Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"2c6f108e-f4ab-4963-ba03-31c512497b1c","year":2017},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.837255Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:c8af49ff3d119e8c8f159c1b62abd5cd9a3ac7759e0cff28c9c0249f62998fc1","observation_id":"7114b41a-65ff-4c2f-a1e1-e842e78c036b","resolution":{"observed_at":"2026-08-14T12:55:21.078867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.066965Z","title":"Keshavarz-Kohjerdi, A","venue":null,"work_id":"9d6d5c42-2bd5-4a53-bd2c-619a19b67b5d","year":2018},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.839780Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:3e1c124576cdfb28c1664c836a8d1f9b0b7afcfa3e7602202671d9f4035fb99d","observation_id":"f4182d12-83ce-43a0-9fb8-13843ac44d20","resolution":{"observed_at":"2026-08-14T12:55:21.070078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.057823Z","title":"Keshavarz-Kohjerdi, R.W","venue":null,"work_id":"d03b9013-5a43-48d6-8b15-3dfca0067507","year":2019},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.842394Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:127ad74ba28ad30eb792d7816b9504c5400f726fe28235de61ac51422c10084e","observation_id":"56119bc9-2289-4d7d-abdd-93362aa9e9a9","resolution":{"observed_at":"2026-08-14T12:55:21.061294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.02581","last_updated":"2019-05-06T09:03:30Z","snapshot_observed_at":"2026-08-14T16:51:42.351469Z","submitted_at":"2019-04-04T14:32:48Z","title":"The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs","version":2},"cited_work":{"arxiv_id":"1904.02581","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.02581","snapshot_observed_at":"2026-08-14T12:55:20.915533Z","title":"The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs","venue":"cs.DM","work_id":"23f318a0-9a60-48f5-bb3f-80884b5fbbac","year":2019},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.844982Z"},"links":{"cited_paper":"/paper/1904.02581","citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:6636265ad33aabd1a819f07c0a2ac288a0556137249162917f9b34fa03d56444","observation_id":"cfa15b95-6433-40f0-a903-260a7d5b73ac","resolution":{"observed_at":"2026-08-14T12:55:20.921191Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.049173Z","title":"Krishnamoorthy, An NP-hard problem in bipartite graphs, S IGACT News 7 (1976) 26","venue":null,"work_id":"a26e7ef3-fba9-4c28-91a8-275839f29972","year":1976},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.848256Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:581ea11671a03cc2790aac3b48c5731c336e77df771654ffbb36560460cc3ef3","observation_id":"7c16be5f-04fd-49df-b0f6-e9a04c604823","resolution":{"observed_at":"2026-08-14T12:55:21.052121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.041132Z","title":"Lenhart, C","venue":null,"work_id":"110c9a42-923b-487a-b9b2-807810f6cf0c","year":1997},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.850790Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:ad9b2a80b06be4b3336ef25888cb7cc3233d0d9f935118a7011f4f4aedafef21","observation_id":"b98bd798-605e-43cf-b7fe-dc5f14b4dfd6","resolution":{"observed_at":"2026-08-14T12:55:21.043935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.033196Z","title":null,"venue":null,"work_id":"66265334-37a2-4773-ad95-ae9209d8233d","year":2009},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.853531Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:793a3a3b4fb434d5a456e0b6b0c2f195b08479af0a8919a3c01f922878c18496","observation_id":"6c012451-13e0-4358-817c-d101f3cebe5b","resolution":{"observed_at":"2026-08-14T12:55:21.035729Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.024255Z","title":"Liu, H.M","venue":null,"work_id":"5758c06a-4458-4525-8767-0f6e37527e9a","year":2011},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.856535Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:2b104cb2c2d39c83b85c78aa7f9c0b579e124e83d7d4dd2e6ebbc54d59ece71e","observation_id":"226b55e3-4a0c-43d6-a790-9c0311ec3faf","resolution":{"observed_at":"2026-08-14T12:55:21.027599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.015287Z","title":null,"venue":null,"work_id":"238f552f-92b6-4a2e-8de6-1d3ef69c2440","year":2001},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.859789Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:d3ca1970a145f95a6d5c4fe46a04160616ebf7012b04b3c04e6c090c5112f644","observation_id":"2c7a9034-cb5b-4701-897c-20744cc68b0b","resolution":{"observed_at":"2026-08-14T12:55:21.018576Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:21.006028Z","title":"Mertzios, D.G","venue":null,"work_id":"6df59a8e-b3c8-4d7e-940f-e8434247acad","year":2012},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.862791Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:12d50a089b4f6d956eb16d54eafd83a43bb9d87b84e3370989233911d6b2d6ea","observation_id":"7bbf0360-1de1-4130-bdc8-f7519b40a277","resolution":{"observed_at":"2026-08-14T12:55:21.009343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.996926Z","title":"O’Callaghan, Computing the perceptual boundaries of dot p atterns, Comput","venue":null,"work_id":"ed90aa7d-648f-497a-9480-47f4a167300a","year":1974},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.865673Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:32d3d24086e73e38c99f3b7eaa1beb8303170ce62c20aba77151d5c2a28eb489","observation_id":"65435d60-f9e2-4195-8395-9138ef372f70","resolution":{"observed_at":"2026-08-14T12:55:21.000374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.987481Z","title":"Park, K.Y","venue":null,"work_id":"8f1d65b9-f273-4b4c-9eda-d38539bf79a1","year":2004},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.868922Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:d69cca7481d59cfe7689ac0bba466308c60fd3df7c59167fb22d8d3d7c5dd1cc","observation_id":"32c02549-2242-40d1-bd7a-f517e4b3f7ba","resolution":{"observed_at":"2026-08-14T12:55:20.990925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.978443Z","title":"Preperata, M.I","venue":null,"work_id":"c5ad38b0-f537-4c6b-97ae-5b76c31249c7","year":1985},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.872111Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:6cac2e8471c8fa55cd5eaf88e8d1a13ef871fa595a1b8a3cab6f13ca3a08fab9","observation_id":"e47ea07b-f59f-4f79-be60-dccda7be8782","resolution":{"observed_at":"2026-08-14T12:55:20.981612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.968426Z","title":null,"venue":null,"work_id":"5e4a4dd7-a0f7-43f1-9081-c840a53839c3","year":2000},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.875331Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:e1b73ec03ed7a1356c3ad5636aa339c095724c12e3e7034e92b496e0411fcbd6","observation_id":"1ebf0fff-d8d5-4eef-99ac-cf7f70420708","resolution":{"observed_at":"2026-08-14T12:55:20.971539Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.959309Z","title":"Salman, Contributions to Graph Theory, Ph.D","venue":null,"work_id":"25f117db-c4f4-4fa2-b215-717b80a587ad","year":2005},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.878678Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:a8b2c26967013facca42824393eb96221ce8edc8d21958c1885802531c391aa3","observation_id":"07f0fc25-8fa3-4447-9818-c0f67fbdaf1a","resolution":{"observed_at":"2026-08-14T12:55:20.962409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.949747Z","title":"Toussaint, Pattern recognition and geometrical complexit y, in: Proceedings of the 5th International Confer- ence on Pattern Recognition, Miami Beach, 1980, pp","venue":null,"work_id":"683cb6a6-3302-48d2-993d-e697b1846a48","year":1980},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.881726Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:5c4dc491859a0b6875e0836bffdfd0f7dbea2fcc4300c0e9b3569efb0cdfc9e3","observation_id":"f423689c-af43-4966-98cd-21b7f60e2c51","resolution":{"observed_at":"2026-08-14T12:55:20.953367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.939386Z","title":"Uehara, Y","venue":null,"work_id":"90ad08bb-3cca-40b0-8e2c-625d4e518341","year":2007},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.884745Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:0191b390b25bf1d472314bd020c7ddd4c633f952c777ff16762102244d06af2a","observation_id":"4141d02f-87d8-41b0-a881-52858900dbb2","resolution":{"observed_at":"2026-08-14T12:55:20.942813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:55:20.928630Z","title":"Zamfirescu, T","venue":null,"work_id":"8b056f13-a0bb-4b91-8be2-8b594415a824","year":1992},"citing_paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T12:55:20.887870Z"},"links":{"citing_paper":"/paper/1908.07447"},"observation_digest":"sha256:8002c368ef34f84e5eea7c5cf9d75d2858b4bf41d2fca52c4c1abb9cf89f25b0","observation_id":"a8d69c4e-6993-4330-aac2-8d292c830649","resolution":{"observed_at":"2026-08-14T12:55:20.933112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07447","last_updated":"2019-08-17T11:41:39Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T13:21:00.483522Z","submitted_at":"2019-08-17T11:41:39Z","title":"Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":48},"total_outbound_references":55},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:1908.07447."}