{"as_of":"2026-08-16T19:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98efee915321aa8e1160ac45c6ae8e28f8b4c1ae1639c38a9d6379935da7f5f3","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:44:00.114160Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2505.18014/citation-record","integrity":"/paper/2505.18014/integrity","json":"/paper/2505.18014/citation-record.json","paper":"/paper/2505.18014"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-012-9403-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"On ≤ k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn","venue":"Discrete & Computational Geometry","work_id":"baf759c4-0bf9-43dc-92c7-12ef2ef5f2f1","year":2011},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:57.743371Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:80835be4807cb749300d9431b04633942d351ad055811a5738e531837265df36","observation_id":"bf6246e7-5c00-4415-b87b-2e8e37b4c9ed","resolution":{"observed_at":"2026-08-07T14:44:02.065049Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcta.2006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:01.680125Z","title":"Geometric Drawings ofKn with Few Crossings","venue":null,"work_id":"5aa6f27f-09ae-4114-a696-05b2fda71a80","year":2007},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:57.813098Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:675f2d708782eb75a336ea6e0476da9be7c0e074034319e71ff73a2e5dd796f1","observation_id":"5f933d9a-6f47-4c03-8144-130f8c8b76c6","resolution":{"observed_at":"2026-08-07T14:44:01.794844Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:57.876099Z","title":"On Topological Graphs with at Most Four Crossings per Edge","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:57.876099Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:0edd45f7637873c2da233a21e14d2ea24b36fe52b91d23c1071d23486a21b26b","observation_id":"1665a07b-5e93-4fc8-aac5-d91f1fdf451c","resolution":{"observed_at":"2026-08-07T14:43:57.876099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.07796","last_updated":"2020-07-15T20:11:51Z","snapshot_observed_at":"2026-08-16T08:27:12.204364Z","submitted_at":"2019-07-17T22:13:28Z","title":"An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants","version":5},"cited_work":{"arxiv_id":"1907.07796","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.07796","snapshot_observed_at":"2026-08-07T14:44:02.877458Z","title":"An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants","venue":"math.CO","work_id":"f6aed8de-9789-47b9-8e6b-93709fb18556","year":2019},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.013561Z"},"links":{"cited_paper":"/paper/1907.07796","citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:aa0918bcd68b07d1a3a2f83d37f7c79f4bc8b1510464cc91fc82ae84a5328f2e","observation_id":"db47ff55-6b82-4977-a6b2-2234fd29edb4","resolution":{"observed_at":"2026-08-07T14:44:02.956485Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-35802-0_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On the 2-Colored Crossing Number","venue":"Lecture notes in computer science","work_id":"f87d3323-5089-4594-9943-d0886fac4491","year":2019},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.100178Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:d310598ac971ba5a6977eae905f367c2b3202bb4dcb6b0ff3d123ab0a25c87fc","observation_id":"b3b9dbc8-bb26-4288-acf2-56c114a51a24","resolution":{"observed_at":"2026-08-07T14:44:01.587443Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-007-1325-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn","venue":"Discrete & Computational Geometry","work_id":"ab38bfe6-7360-46c5-ad97-45d579a4c847","year":2007},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.213910Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:df7be4936794cf2bacf7d20547fb711935bbbc9c3a02708721f521162ab76499","observation_id":"d2b49c22-10ee-4c5e-9e24-c3b6833ab178","resolution":{"observed_at":"2026-08-07T14:44:01.340041Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:58.309585Z","title":"Polynomial Time Approximation Schemes for Dense Instances of N P-Hard Problems","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.309585Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:6075a8493c91a6dfcc523c6c8f5320ad9aaacd428e22f8081a49bd6c17616dcb","observation_id":"6832c792-32f9-4155-9eae-4c040d8afaed","resolution":{"observed_at":"2026-08-07T14:43:58.309585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:58.427075Z","title":"Some Provably Hard Crossing Number Problems","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.427075Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:e19be827b1aa8d41e86cb9c53e75235fa3eecbf3a607d28ed758930710e0fd58","observation_id":"e8a57e96-8c5c-4e01-815a-eda2c470d8f4","resolution":{"observed_at":"2026-08-07T14:43:58.427075Z","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":"10.1007/s10474-024-01436-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","work_id":"b5afb91b-c5bc-4765-9b44-4e586444161e","year":2024},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.529833Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:9b30b64940d99a4f3d0a496428dd98f0ceafe56185c864e98a4ce3bc4c54b9d0","observation_id":"81dc7717-7a0c-4d87-9ba9-44dd241b5c72","resolution":{"observed_at":"2026-08-07T14:44:01.149989Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.993507Z","title":"An Upper Bound to the Crossing Number of the Complete Graph Drawn on the Pages of a Book","venue":null,"work_id":"62f1ddff-147c-4eda-a0d3-58e93d2da125","year":1994},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.638589Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:86a9d5d3010f13a8544a1e89c0ee9d1a66e9e7d5c7dc8b2831fc4f34b42d5d19","observation_id":"b847f34c-3f9d-4092-8873-00d9a032f97f","resolution":{"observed_at":"2026-08-07T14:44:04.125227Z","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":"10.1137/120886777","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Improved Lower Bounds on Book Crossing Numbers of Complete Graphs","venue":"SIAM Journal on Discrete Mathematics","work_id":"1517de2a-6f4b-4318-a521-0346fe8aef29","year":2013},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.712820Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:8cb3d5c84600b09ac72ee66656f95d725b57ca83d4a6676d45083e97d4624e1b","observation_id":"c5bba66c-66d6-42f5-85a3-169bee8f4e32","resolution":{"observed_at":"2026-08-07T14:44:00.924333Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.815377Z","title":"Mathematical Programming Formulation of Rectilinear Crossing Minimization","venue":null,"work_id":"97e651bf-b7e8-4c1c-ae2d-d4b74c26e17c","year":2002},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.819381Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:3d373751eccfbf673fb7ea1e228fcede6dec6ddf1fad8fe188edc2c3a2495063","observation_id":"f9c4fc7a-f205-4ef4-8eb2-ee04e69f6e7f","resolution":{"observed_at":"2026-08-07T14:44:03.886434Z","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":"2024.10212","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:02.515098Z","title":"A Note on the k -Colored Crossing Ratio of Dense Geometric Graphs","venue":null,"work_id":"e9115f71-3d70-487e-8fbd-3560bf0e3520","year":2025},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:58.924351Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:27a91d2b5782965aa075357e0694b02823fe8bd9ecbdd092e1f51befe9995c32","observation_id":"438f6946-aa82-475c-b696-98d5c0dcfc74","resolution":{"observed_at":"2026-08-07T14:44:02.670861Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:59.017456Z","title":"Some Simplified NP -Complete Graph Problems","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.017456Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:602a3784d3aacb30ff47647a13338831dd1c215141940f1004d59bb71ea4aa42","observation_id":"6394758c-fefd-4a71-8947-8f4447eaad8f","resolution":{"observed_at":"2026-08-07T14:43:59.017456Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3217/tw2dv-87653","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Instances with Low Geometric k-Colored Crossing Number","venue":"TUGraz OPEN Library (Graz University of Technology)","work_id":"196fe660-e502-4b2c-87db-a8fd00147f4b","year":2025},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.111714Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:d2a165b3a4eaaad4846aa2632f9add96e4338b9377e419ac621e6feab1002b66","observation_id":"cab591f5-8348-43e3-90ce-b1d3659cbf88","resolution":{"observed_at":"2026-08-07T14:44:00.741627Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:03.558955Z","title":"On the Hardness of Approximating Max k -Cut and Its Dual","venue":null,"work_id":"f7b0bb81-1bac-4ff5-8d30-37c959857481","year":1996},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.193693Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:df5132bad6bf9fe4a5bec461d7c87883bd0bddf2e9bc68f55e94774328db3607","observation_id":"16f8bf94-845c-47f6-bd2f-0a20d8054b11","resolution":{"observed_at":"2026-08-07T14:44:03.671140Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:59.281722Z","title":"The Hungarian Method for the Assignment Problem","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.281722Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:b67c79aa2ab9fa9602c2a648c589429eb3672c90b05f1c8efc98f542b6e3300a","observation_id":"b816ea6b-0c66-4b27-8361-a3672e0e12e8","resolution":{"observed_at":"2026-08-07T14:43:59.281722Z","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":"10.1109/12.46286","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Crossing Minimization in Linear Embeddings of Graphs","venue":"IEEE Transactions on Computers","work_id":"cfff25e9-1164-4705-bfff-abed40ae0f8b","year":1990},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.371048Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:52a78d2661bbd32ede022982d5cbfb7270a9b4940c0a013d3436eac7963ad252","observation_id":"150b57f1-5a79-454a-8d45-0a6db3a6df94","resolution":{"observed_at":"2026-08-07T14:44:00.548582Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.comgeo.2017.06.015","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Note onk -Planar Crossing Numbers","venue":"Computational Geometry","work_id":"4a33e2ed-e197-4cd4-80fd-e4389612d746","year":2018},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.484792Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:5be1a905c9ecf9bfb6e88992999f43d4ef8b5ab9b5f34648c3888d523b1e9e93","observation_id":"be83c4ad-1681-4f0c-a15e-927d3aeaec69","resolution":{"observed_at":"2026-08-07T14:44:00.325682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:59.614110Z","title":"Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.614110Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:38afd5d6a4637f81f1f817895d83eca224fa765a97e975975ac243b604656b60","observation_id":"a7a56ecf-083b-4a65-9626-f0f76ebc27ab","resolution":{"observed_at":"2026-08-07T14:43:59.614110Z","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-07T14:44:03.339907Z","title":null,"venue":null,"work_id":"cd0f6592-fe32-4a1b-99d4-8a1278053934","year":2020},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.708833Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:a97079f83c92f8f04599c6bd494b66d8bd22f97ea921eede6640c2cfd80c0b19","observation_id":"1748a9d1-979d-4fc9-83a3-79d0e3c68800","resolution":{"observed_at":"2026-08-07T14:44:03.405535Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:59.821797Z","title":"Computational Study of a Branching Algorithm for the Maximum k -Cut Problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.821797Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:61276229101726d3ef88dd563cb574f12eec315411de9877f13897ee7a7bf072","observation_id":"207361e0-4904-4162-bfba-1036b24abcc6","resolution":{"observed_at":"2026-08-07T14:43:59.821797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:43:59.927904Z","title":"The Graph Crossing Number and Its Variants: A Survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:43:59.927904Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:d0304012331f53406966b0ba9b5fd8f8552da1840a0e879e0a9bd37a77c38734","observation_id":"ba8f03f5-faa8-4dfb-a168-aecc53c647a3","resolution":{"observed_at":"2026-08-07T14:43:59.927904Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:44:00.027770Z","title":"The Book Crossing Number of a Graph","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:00.027770Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:167ab466cfd5bbb119810c19ad95f4e21bd048ed904345a97ecc61a74fd19ba4","observation_id":"2712d596-4e7c-4573-8e7d-167e668ba8a0","resolution":{"observed_at":"2026-08-07T14:44:00.027770Z","resolver_source":null,"status":"malformed_identifier"},"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-07T14:44:03.121767Z","title":"On the Biplanar and k-Planar Crossing Numbers","venue":null,"work_id":"f7a31a32-4e55-440f-bc63-2a2654953b7b","year":2022},"citing_paper":{"arxiv_id":"2505.18014","last_updated":"2025-05-23T15:15:27Z","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:00.114160Z"},"links":{"citing_paper":"/paper/2505.18014"},"observation_digest":"sha256:884386683909724b48520269b8d32c92947f225c97af9f47cf543fe10b2d46d1","observation_id":"cffd4f08-e110-4796-ab06-a2348e8ac8be","resolution":{"observed_at":"2026-08-07T14:44:03.202827Z","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":"2505.18014","last_updated":"2025-05-23T15:15:27Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-13T17:06:49.671736Z","submitted_at":"2025-05-23T15:15:27Z","title":"On the geometric $k$-colored crossing number of $K_n$"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":3,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":10,"verified_fuzzy":4},"total_outbound_references":25},"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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2505.18014."}