Pith. sign in

Paper Citation Record · LEDGER

On the geometric $k$-colored crossing number of $K_n$

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.18014 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:44:00.114160Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

25 of 25 outbound references displayed

  • verified exact10
  • verified fuzzy4
  • unresolved7
  • parse uncertain0
  • malformed identifier3
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation bf6246e7-5c00-4415-b87b-2e8e37b4c9ed · outbound

This paper cites On ≤ k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn.

On the geometric $k$-colored crossing number of $K_n$ On ≤ k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn

Reference 1

Resolution
verified exact
doi, observed 2026-08-07T14:44:02.065049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:57.743371Z digest=sha256:80835be4807cb749300d9431b04633942d351ad055811a5738e531837265df36

Observation 5f933d9a-6f47-4c03-8144-130f8c8b76c6 · outbound

This paper cites Geometric Drawings ofKn with Few Crossings.

On the geometric $k$-colored crossing number of $K_n$ Geometric Drawings ofKn with Few Crossings

Reference 2

Resolution
verified exact
doi, observed 2026-08-07T14:44:01.794844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:57.813098Z digest=sha256:675f2d708782eb75a336ea6e0476da9be7c0e074034319e71ff73a2e5dd796f1

Observation 1665a07b-5e93-4fc8-aac5-d91f1fdf451c · outbound

This paper cites On Topological Graphs with at Most Four Crossings per Edge.

On the geometric $k$-colored crossing number of $K_n$ On Topological Graphs with at Most Four Crossings per Edge

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-07T14:43:57.876099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:57.876099Z digest=sha256:0edd45f7637873c2da233a21e14d2ea24b36fe52b91d23c1071d23486a21b26b

Observation db47ff55-6b82-4977-a6b2-2234fd29edb4 · outbound

This paper cites An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants.

On the geometric $k$-colored crossing number of $K_n$ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

Reference 4

Resolution
verified exact
local_arxiv, observed 2026-08-07T14:44:02.956485Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.013561Z digest=sha256:aa0918bcd68b07d1a3a2f83d37f7c79f4bc8b1510464cc91fc82ae84a5328f2e

Observation b3b9dbc8-bb26-4288-acf2-56c114a51a24 · outbound

This paper cites On the 2-Colored Crossing Number.

On the geometric $k$-colored crossing number of $K_n$ On the 2-Colored Crossing Number

Reference 5

Resolution
verified exact
doi, observed 2026-08-07T14:44:01.587443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.100178Z digest=sha256:d310598ac971ba5a6977eae905f367c2b3202bb4dcb6b0ff3d123ab0a25c87fc

Observation d2b49c22-10ee-4c5e-9e24-c3b6833ab178 · outbound

This paper cites New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn.

On the geometric $k$-colored crossing number of $K_n$ New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn

Reference 6

Resolution
verified exact
doi, observed 2026-08-07T14:44:01.340041Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.213910Z digest=sha256:df7be4936794cf2bacf7d20547fb711935bbbc9c3a02708721f521162ab76499

Observation 6832c792-32f9-4155-9eae-4c040d8afaed · outbound

This paper cites Polynomial Time Approximation Schemes for Dense Instances of N P-Hard Problems.

On the geometric $k$-colored crossing number of $K_n$ Polynomial Time Approximation Schemes for Dense Instances of N P-Hard Problems

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-07T14:43:58.309585Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:58.309585Z digest=sha256:6075a8493c91a6dfcc523c6c8f5320ad9aaacd428e22f8081a49bd6c17616dcb

Observation e8a57e96-8c5c-4e01-815a-eda2c470d8f4 · outbound

This paper cites Some Provably Hard Crossing Number Problems.

On the geometric $k$-colored crossing number of $K_n$ Some Provably Hard Crossing Number Problems

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-07T14:43:58.427075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:58.427075Z digest=sha256:e19be827b1aa8d41e86cb9c53e75235fa3eecbf3a607d28ed758930710e0fd58

Observation 81dc7717-7a0c-4d87-9ba9-44dd241b5c72 · outbound

This paper cites A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.

On the geometric $k$-colored crossing number of $K_n$ A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square

Reference 9

Resolution
verified exact
doi, observed 2026-08-07T14:44:01.149989Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.529833Z digest=sha256:9b30b64940d99a4f3d0a496428dd98f0ceafe56185c864e98a4ce3bc4c54b9d0

Observation b847f34c-3f9d-4092-8873-00d9a032f97f · outbound

This paper cites An Upper Bound to the Crossing Number of the Complete Graph Drawn on the Pages of a Book.

On the geometric $k$-colored crossing number of $K_n$ An Upper Bound to the Crossing Number of the Complete Graph Drawn on the Pages of a Book

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:44:04.125227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.638589Z digest=sha256:86a9d5d3010f13a8544a1e89c0ee9d1a66e9e7d5c7dc8b2831fc4f34b42d5d19

Observation c5bba66c-66d6-42f5-85a3-169bee8f4e32 · outbound

This paper cites Improved Lower Bounds on Book Crossing Numbers of Complete Graphs.

On the geometric $k$-colored crossing number of $K_n$ Improved Lower Bounds on Book Crossing Numbers of Complete Graphs

Reference 11

Resolution
verified exact
doi, observed 2026-08-07T14:44:00.924333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.712820Z digest=sha256:8cb3d5c84600b09ac72ee66656f95d725b57ca83d4a6676d45083e97d4624e1b

Observation f9c4fc7a-f205-4ef4-8eb2-ee04e69f6e7f · outbound

This paper cites Mathematical Programming Formulation of Rectilinear Crossing Minimization.

On the geometric $k$-colored crossing number of $K_n$ Mathematical Programming Formulation of Rectilinear Crossing Minimization

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:44:03.886434Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.819381Z digest=sha256:3d373751eccfbf673fb7ea1e228fcede6dec6ddf1fad8fe188edc2c3a2495063

Observation 438f6946-aa82-475c-b696-98d5c0dcfc74 · outbound

This paper cites A Note on the k -Colored Crossing Ratio of Dense Geometric Graphs.

On the geometric $k$-colored crossing number of $K_n$ A Note on the k -Colored Crossing Ratio of Dense Geometric Graphs

Reference 13

Resolution
metadata mismatch
raw_fallback, observed 2026-08-07T14:44:02.670861Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:58.924351Z digest=sha256:27a91d2b5782965aa075357e0694b02823fe8bd9ecbdd092e1f51befe9995c32

Observation 6394758c-fefd-4a71-8947-8f4447eaad8f · outbound

This paper cites Some Simplified NP -Complete Graph Problems.

On the geometric $k$-colored crossing number of $K_n$ Some Simplified NP -Complete Graph Problems

Reference 14

Resolution
malformed identifier
no resolver link, observed 2026-08-07T14:43:59.017456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:59.017456Z digest=sha256:602a3784d3aacb30ff47647a13338831dd1c215141940f1004d59bb71ea4aa42

Observation cab591f5-8348-43e3-90ce-b1d3659cbf88 · outbound

This paper cites Instances with Low Geometric k-Colored Crossing Number.

On the geometric $k$-colored crossing number of $K_n$ Instances with Low Geometric k-Colored Crossing Number

Reference 15

Resolution
verified exact
doi, observed 2026-08-07T14:44:00.741627Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:59.111714Z digest=sha256:d2a165b3a4eaaad4846aa2632f9add96e4338b9377e419ac621e6feab1002b66

Observation 16f8bf94-845c-47f6-bd2f-0a20d8054b11 · outbound

This paper cites On the Hardness of Approximating Max k -Cut and Its Dual.

On the geometric $k$-colored crossing number of $K_n$ On the Hardness of Approximating Max k -Cut and Its Dual

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:44:03.671140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:59.193693Z digest=sha256:df5132bad6bf9fe4a5bec461d7c87883bd0bddf2e9bc68f55e94774328db3607

Observation b816ea6b-0c66-4b27-8361-a3672e0e12e8 · outbound

This paper cites The Hungarian Method for the Assignment Problem.

On the geometric $k$-colored crossing number of $K_n$ The Hungarian Method for the Assignment Problem

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-07T14:43:59.281722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:59.281722Z digest=sha256:b67c79aa2ab9fa9602c2a648c589429eb3672c90b05f1c8efc98f542b6e3300a

Observation 150b57f1-5a79-454a-8d45-0a6db3a6df94 · outbound

This paper cites Crossing Minimization in Linear Embeddings of Graphs.

On the geometric $k$-colored crossing number of $K_n$ Crossing Minimization in Linear Embeddings of Graphs

Reference 18

Resolution
verified exact
doi, observed 2026-08-07T14:44:00.548582Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:59.371048Z digest=sha256:52a78d2661bbd32ede022982d5cbfb7270a9b4940c0a013d3436eac7963ad252

Observation be83c4ad-1681-4f0c-a15e-927d3aeaec69 · outbound

This paper cites Note onk -Planar Crossing Numbers.

On the geometric $k$-colored crossing number of $K_n$ Note onk -Planar Crossing Numbers

Reference 19

Resolution
verified exact
doi, observed 2026-08-07T14:44:00.325682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:59.484792Z digest=sha256:5be1a905c9ecf9bfb6e88992999f43d4ef8b5ab9b5f34648c3888d523b1e9e93

Observation a7a56ecf-083b-4a65-9626-f0f76ebc27ab · outbound

This paper cites Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs.

On the geometric $k$-colored crossing number of $K_n$ Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-07T14:43:59.614110Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:59.614110Z digest=sha256:38afd5d6a4637f81f1f817895d83eca224fa765a97e975975ac243b604656b60

Observation 1748a9d1-979d-4fc9-83a3-79d0e3c68800 · outbound

This paper cites an unresolved cited work.

On the geometric $k$-colored crossing number of $K_n$ Unresolved cited work

Reference 21

Resolution
unresolved
raw_fallback, observed 2026-08-07T14:44:03.405535Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:43:59.708833Z digest=sha256:a97079f83c92f8f04599c6bd494b66d8bd22f97ea921eede6640c2cfd80c0b19

Observation 207361e0-4904-4162-bfba-1036b24abcc6 · outbound

This paper cites Computational Study of a Branching Algorithm for the Maximum k -Cut Problem.

On the geometric $k$-colored crossing number of $K_n$ Computational Study of a Branching Algorithm for the Maximum k -Cut Problem

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-07T14:43:59.821797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:59.821797Z digest=sha256:61276229101726d3ef88dd563cb574f12eec315411de9877f13897ee7a7bf072

Observation ba8f03f5-faa8-4dfb-a168-aecc53c647a3 · outbound

This paper cites The Graph Crossing Number and Its Variants: A Survey.

On the geometric $k$-colored crossing number of $K_n$ The Graph Crossing Number and Its Variants: A Survey

Reference 23

Resolution
malformed identifier
no resolver link, observed 2026-08-07T14:43:59.927904Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:43:59.927904Z digest=sha256:d0304012331f53406966b0ba9b5fd8f8552da1840a0e879e0a9bd37a77c38734

Observation 2712d596-4e7c-4573-8e7d-167e668ba8a0 · outbound

This paper cites The Book Crossing Number of a Graph.

On the geometric $k$-colored crossing number of $K_n$ The Book Crossing Number of a Graph

Reference 24

Resolution
malformed identifier
no resolver link, observed 2026-08-07T14:44:00.027770Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:44:00.027770Z digest=sha256:167ab466cfd5bbb119810c19ad95f4e21bd048ed904345a97ecc61a74fd19ba4

Observation cffd4f08-e110-4796-ab06-a2348e8ac8be · outbound

This paper cites On the Biplanar and k-Planar Crossing Numbers.

On the geometric $k$-colored crossing number of $K_n$ On the Biplanar and k-Planar Crossing Numbers

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T14:44:03.202827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-07T14:44:00.114160Z digest=sha256:884386683909724b48520269b8d32c92947f225c97af9f47cf543fe10b2d46d1

Pith citing papers

No inbound Pith citation observations are available.