{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TDJ27CA657NALKYFFRREH2P2TM","short_pith_number":"pith:TDJ27CA6","schema_version":"1.0","canonical_sha256":"98d3af881eefda05ab052c6243e9fa9b3503d7f81ebf3ba62da68a6b7f6032cd","source":{"kind":"arxiv","id":"2505.18014","version":1},"attestation_state":"computed","paper":{"title":"On the geometric $k$-colored crossing number of $K_n$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Benedikt Hahn, Bettina Klinz, Birgit Vogtenhuber","submitted_at":"2025-05-23T15:15:27Z","abstract_excerpt":"We study the \\emph{geometric $k$-colored crossing number} of complete graphs $\\overline{\\overline{\\text{cr}}}_k(K_n)$, which is the smallest number of monochromatic crossings in any $k$-edge colored straight-line drawing of $K_n$.\n  We substantially improve asymptotic upper bounds on $\\overline{\\overline{\\text{cr}}}_k(K_n)$ for $k=2,\\ldots, 10$ by developing a procedure for general $k$ that derives $k$-edge colored drawings of $K_n$ for arbitrarily large $n$ from initial drawings with a low number of monochromatic crossings.\n  We obtain the latter by heuristic search, employing a \\textsc{MAX-$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.18014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-05-23T15:15:27Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"68e284d44f8fae8cc3c5ee42b0f94dd316a2e1f4bc8f1419aecf140267fead4a","abstract_canon_sha256":"5b7df057294998fd0229d85bae610c718239d06af955641a2146d8f4e28c3338"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:35.236395Z","signature_b64":"+c2JMz7xb/x314o6RNydriljaJOKVaDuhYKn323jxb3l3rH+IzZxO44W6gWZTYsywVY0hZO2ufCT6s8Y3k6pDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98d3af881eefda05ab052c6243e9fa9b3503d7f81ebf3ba62da68a6b7f6032cd","last_reissued_at":"2026-07-05T11:08:35.235927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:35.235927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the geometric $k$-colored crossing number of $K_n$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Benedikt Hahn, Bettina Klinz, Birgit Vogtenhuber","submitted_at":"2025-05-23T15:15:27Z","abstract_excerpt":"We study the \\emph{geometric $k$-colored crossing number} of complete graphs $\\overline{\\overline{\\text{cr}}}_k(K_n)$, which is the smallest number of monochromatic crossings in any $k$-edge colored straight-line drawing of $K_n$.\n  We substantially improve asymptotic upper bounds on $\\overline{\\overline{\\text{cr}}}_k(K_n)$ for $k=2,\\ldots, 10$ by developing a procedure for general $k$ that derives $k$-edge colored drawings of $K_n$ for arbitrarily large $n$ from initial drawings with a low number of monochromatic crossings.\n  We obtain the latter by heuristic search, employing a \\textsc{MAX-$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18014","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.18014/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.18014","created_at":"2026-07-05T11:08:35.235982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18014v1","created_at":"2026-07-05T11:08:35.235982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18014","created_at":"2026-07-05T11:08:35.235982+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDJ27CA657NA","created_at":"2026-07-05T11:08:35.235982+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDJ27CA657NALKYF","created_at":"2026-07-05T11:08:35.235982+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDJ27CA6","created_at":"2026-07-05T11:08:35.235982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM","json":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM.json","graph_json":"https://pith.science/api/pith-number/TDJ27CA657NALKYFFRREH2P2TM/graph.json","events_json":"https://pith.science/api/pith-number/TDJ27CA657NALKYFFRREH2P2TM/events.json","paper":"https://pith.science/paper/TDJ27CA6"},"agent_actions":{"view_html":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM","download_json":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM.json","view_paper":"https://pith.science/paper/TDJ27CA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18014&json=true","fetch_graph":"https://pith.science/api/pith-number/TDJ27CA657NALKYFFRREH2P2TM/graph.json","fetch_events":"https://pith.science/api/pith-number/TDJ27CA657NALKYFFRREH2P2TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM/action/storage_attestation","attest_author":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM/action/author_attestation","sign_citation":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM/action/citation_signature","submit_replication":"https://pith.science/pith/TDJ27CA657NALKYFFRREH2P2TM/action/replication_record"}},"created_at":"2026-07-05T11:08:35.235982+00:00","updated_at":"2026-07-05T11:08:35.235982+00:00"}