{"as_of":"2026-08-20T20:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba3e96f8962956e6f99d08fb80cae2cefb3c7779e02b655cd3f7a00f1a68b517","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:31:27.525421Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2608.06255/citation-record","integrity":"/paper/2608.06255/integrity","json":"/paper/2608.06255/citation-record.json","paper":"/paper/2608.06255"},"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-07T11:31:29.509800Z","title":"Abellanas, J","venue":null,"work_id":"681be6b4-4b6a-4e56-8b48-0fbab660aeee","year":1999},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:26.604791Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:0fd9949934b2bec50532f3baf3ed1d3dbf29b689889c5c3f3468e5a3eac7694f","observation_id":"58e46738-7262-4373-a81f-c3b7cce06e75","resolution":{"observed_at":"2026-08-07T11:31:29.636418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:29.218678Z","title":"Geometric planar networks on bichromatic collinear points.Theoretical Com- puter Science, 895, 09 2021","venue":null,"work_id":"72d22844-7f39-4afc-a09a-b4f06b65eb01","year":2021},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:26.679237Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:63806e84cd56480e25cf4d74c9e3a563d35c02edc92320092c039874bf732489","observation_id":"f5b19844-7b92-4954-b7f8-23ac3302e6ec","resolution":{"observed_at":"2026-08-07T11:31:29.346152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:28.923135Z","title":"Non-crossing Hamiltonian paths and cycles in output-polynomial time","venue":null,"work_id":"9aa77f48-6918-4611-915b-cdabe243bcf7","year":2023},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:26.748346Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:e3787ecc0d15a76e85788d18efc5f63ea70e3968c681bdc5d3b0057745cdebbe","observation_id":"05bab5ff-b204-412a-ae14-75a34600f61a","resolution":{"observed_at":"2026-08-07T11:31:29.064624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:28.747600Z","title":"Garey and David S","venue":null,"work_id":"1f64e3ee-e118-4994-bc2c-898ba547a9b2","year":1979},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:26.821614Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:5e631e4461d6720bdb2957dcf9edd41fd1964749185c0baba9853c88aabc2b2c","observation_id":"330d07b4-3e73-46c8-85c3-a7c8b2198205","resolution":{"observed_at":"2026-08-07T11:31:28.819979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:28.576557Z","title":"Garey, David S","venue":null,"work_id":"074e20a8-3379-4b25-8a19-694aa08010b1","year":1974},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:26.945708Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:38e4e15b7139024e580072e213a6d242db74e6940273c87a1f55f77e47bc0c82","observation_id":"39095748-4c83-427c-a411-1490b472d8ba","resolution":{"observed_at":"2026-08-07T11:31:28.657906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:28.420220Z","title":"Garey, David S","venue":null,"work_id":"e2e59d2c-69ac-4e03-8aaa-98016ea8578a","year":1976},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:27.041158Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:cd2bbab81bdf7c05a38763078a2b514f9b8b582de3d2765c41c50037113d9fc7","observation_id":"14ff1324-6ac1-4414-b1b5-63f3c443d1a5","resolution":{"observed_at":"2026-08-07T11:31:28.499458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:28.252260Z","title":"Kano.Discrete Geometry on Red and Blue Points in the Plane — A Sur- vey —, pages 551–570","venue":null,"work_id":"b76a3d89-83b0-40da-949c-a5bc25e710c9","year":2003},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:27.153540Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:165637cce32883cf84d028a4be6f3daeaac9e2586a1d75cf4581c80c275c0a94","observation_id":"21a9b858-54dd-460f-ac2b-3ce5351e48fe","resolution":{"observed_at":"2026-08-07T11:31:28.336552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:28.066945Z","title":"Long al- ternating paths in bicolored point sets.Discrete Mathematics, 308(19):4315–4321, 2008","venue":null,"work_id":"5df9122a-374f-477b-b09f-40f8cfc74598","year":2008},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:27.246325Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:561ec5be0a7d786a13fc1152dd8de6cb434416f8053db4b967ff864484f59d3a","observation_id":"2cb1e88e-4a62-4280-830b-dddd28461cc9","resolution":{"observed_at":"2026-08-07T11:31:28.173513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T11:31:27.897327Z","title":"The NP-completeness of the Hamil- tonian cycle problem in planar digraphs with de- gree bound two.Information Processing Letters, 8(4):199–201, 1979","venue":null,"work_id":"1597f634-b06a-4308-844c-60599ffac831","year":1979},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:27.325094Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:f85824e873f9e47fb368892d88004c1edc7ba9d466231ceccec9cc5357146a13","observation_id":"4c72cc96-c1ab-4291-bee0-9c4946794040","resolution":{"observed_at":"2026-08-07T11:31:27.961144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06105","last_updated":"2024-04-09T08:17:00Z","snapshot_observed_at":"2026-08-20T15:27:06.822595Z","submitted_at":"2024-04-09T08:17:00Z","title":"Bicolored point sets admitting non-crossing alternating Hamiltonian paths","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06105","snapshot_observed_at":"2026-08-07T11:31:27.442811Z","title":"Bicolored point sets admitting non-crossing alternating Hamiltonian paths, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:27.442811Z"},"links":{"cited_paper":"/paper/2404.06105","citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:902b66a59def691df5566a2e89d4c91a9f11f7498f56a7e41c589087de77277b","observation_id":"37d1f494-cc27-4817-b240-fd69d4c31343","resolution":{"observed_at":"2026-08-07T11:31:27.442811Z","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-07T11:31:27.684661Z","title":"Enumeration of non-crossing Hamiltonian paths by reachabil- ity checks and bidirectional search","venue":null,"work_id":"55da1a0a-de89-4c8e-bf23-b11190b2c0fe","year":2025},"citing_paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:27.525421Z"},"links":{"citing_paper":"/paper/2608.06255"},"observation_digest":"sha256:175a87f0f129f743d494ccc5360ccd16ca9623714aec69d7095b4bf3ea9c7ceb","observation_id":"8ba28391-7057-45d6-b857-5278204bc65f","resolution":{"observed_at":"2026-08-07T11:31:27.771509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06255","last_updated":"2026-08-06T16:44:37Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-16T18:50:03.951046Z","submitted_at":"2026-08-06T16:44:37Z","title":"NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":11},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2608.06255."}