{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7EQ5MGO5USXNLLMHX6ATCMXS7E","short_pith_number":"pith:7EQ5MGO5","schema_version":"1.0","canonical_sha256":"f921d619dda4aed5ad87bf813132f2f90ad9351e79e939ce834625d1bc6b8748","source":{"kind":"arxiv","id":"1908.06461","version":2},"attestation_state":"computed","paper":{"title":"On the 2-colored crossing number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Adrian Fuchs, Birgit Vogtenhuber, Carlos Hidalgo-Toscano, Francisco Zaragoza, Irene Parada, Oswin Aichholzer, Ruy Fabila-Monroy","submitted_at":"2019-08-18T15:18:09Z","abstract_excerpt":"Let $D$ be a straight-line drawing of a graph. The rectilinear 2-colored crossing number of $D$ is the minimum number of crossings between edges of the same color, taken over all possible 2-colorings of the edges of $D$. First, we show lower and upper bounds on the rectilinear 2-colored crossing number for the complete graph $K_n$. To obtain this result, we prove that asymptotic bounds can be derived from optimal and near-optimal instances with few vertices. We obtain such instances using a combination of heuristics and integer programming. Second, for any fixed drawing of $K_n$, we improve th"},"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":"1908.06461","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-08-18T15:18:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fc0b8c1b7c583d52f509874eacfe987202b5874317e490de300837212c8412f4","abstract_canon_sha256":"1315e87d5a1ed82163b118d6d78163a9de0217bf6f221e4c8849caa978858cdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:10.228966Z","signature_b64":"7bdSfE22O6QpDdOPXBJJpnzKilgGpb1SnCS7QCpnRc64iug9TIHLGQ1IAFPN1sCKIoEEo4dSgugV2YTodPmhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f921d619dda4aed5ad87bf813132f2f90ad9351e79e939ce834625d1bc6b8748","last_reissued_at":"2026-07-05T00:04:10.228556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:10.228556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the 2-colored crossing number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Adrian Fuchs, Birgit Vogtenhuber, Carlos Hidalgo-Toscano, Francisco Zaragoza, Irene Parada, Oswin Aichholzer, Ruy Fabila-Monroy","submitted_at":"2019-08-18T15:18:09Z","abstract_excerpt":"Let $D$ be a straight-line drawing of a graph. The rectilinear 2-colored crossing number of $D$ is the minimum number of crossings between edges of the same color, taken over all possible 2-colorings of the edges of $D$. First, we show lower and upper bounds on the rectilinear 2-colored crossing number for the complete graph $K_n$. To obtain this result, we prove that asymptotic bounds can be derived from optimal and near-optimal instances with few vertices. We obtain such instances using a combination of heuristics and integer programming. Second, for any fixed drawing of $K_n$, we improve th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06461","kind":"arxiv","version":2},"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/1908.06461/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":"1908.06461","created_at":"2026-07-05T00:04:10.228612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06461v2","created_at":"2026-07-05T00:04:10.228612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06461","created_at":"2026-07-05T00:04:10.228612+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EQ5MGO5USXN","created_at":"2026-07-05T00:04:10.228612+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EQ5MGO5USXNLLMH","created_at":"2026-07-05T00:04:10.228612+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EQ5MGO5","created_at":"2026-07-05T00:04:10.228612+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/7EQ5MGO5USXNLLMHX6ATCMXS7E","json":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E.json","graph_json":"https://pith.science/api/pith-number/7EQ5MGO5USXNLLMHX6ATCMXS7E/graph.json","events_json":"https://pith.science/api/pith-number/7EQ5MGO5USXNLLMHX6ATCMXS7E/events.json","paper":"https://pith.science/paper/7EQ5MGO5"},"agent_actions":{"view_html":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E","download_json":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E.json","view_paper":"https://pith.science/paper/7EQ5MGO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06461&json=true","fetch_graph":"https://pith.science/api/pith-number/7EQ5MGO5USXNLLMHX6ATCMXS7E/graph.json","fetch_events":"https://pith.science/api/pith-number/7EQ5MGO5USXNLLMHX6ATCMXS7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E/action/storage_attestation","attest_author":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E/action/author_attestation","sign_citation":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E/action/citation_signature","submit_replication":"https://pith.science/pith/7EQ5MGO5USXNLLMHX6ATCMXS7E/action/replication_record"}},"created_at":"2026-07-05T00:04:10.228612+00:00","updated_at":"2026-07-05T00:04:10.228612+00:00"}