{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7EQ5MGO5USXNLLMHX6ATCMXS7E","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1315e87d5a1ed82163b118d6d78163a9de0217bf6f221e4c8849caa978858cdd","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-08-18T15:18:09Z","title_canon_sha256":"fc0b8c1b7c583d52f509874eacfe987202b5874317e490de300837212c8412f4"},"schema_version":"1.0","source":{"id":"1908.06461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06461","created_at":"2026-07-05T00:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06461v2","created_at":"2026-07-05T00:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06461","created_at":"2026-07-05T00:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"7EQ5MGO5USXN","created_at":"2026-07-05T00:04:10Z"},{"alias_kind":"pith_short_16","alias_value":"7EQ5MGO5USXNLLMH","created_at":"2026-07-05T00:04:10Z"},{"alias_kind":"pith_short_8","alias_value":"7EQ5MGO5","created_at":"2026-07-05T00:04:10Z"}],"graph_snapshots":[{"event_id":"sha256:2b586853b0ddf64db645a17a5934f70ee304e2e8208844ada414dcdc8e585e53","target":"graph","created_at":"2026-07-05T00:04:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adrian Fuchs, Birgit Vogtenhuber, Carlos Hidalgo-Toscano, Francisco Zaragoza, Irene Parada, Oswin Aichholzer, Ruy Fabila-Monroy","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-08-18T15:18:09Z","title":"On the 2-colored crossing number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06461","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f104c886f22d83e38b9b2d29a9c97dac8f61c57dace02dccc2efe1190e6e055e","target":"record","created_at":"2026-07-05T00:04:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1315e87d5a1ed82163b118d6d78163a9de0217bf6f221e4c8849caa978858cdd","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-08-18T15:18:09Z","title_canon_sha256":"fc0b8c1b7c583d52f509874eacfe987202b5874317e490de300837212c8412f4"},"schema_version":"1.0","source":{"id":"1908.06461","kind":"arxiv","version":2}},"canonical_sha256":"f921d619dda4aed5ad87bf813132f2f90ad9351e79e939ce834625d1bc6b8748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f921d619dda4aed5ad87bf813132f2f90ad9351e79e939ce834625d1bc6b8748","first_computed_at":"2026-07-05T00:04:10.228556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:10.228556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bdSfE22O6QpDdOPXBJJpnzKilgGpb1SnCS7QCpnRc64iug9TIHLGQ1IAFPN1sCKIoEEo4dSgugV2YTodPmhCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:10.228966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f104c886f22d83e38b9b2d29a9c97dac8f61c57dace02dccc2efe1190e6e055e","sha256:2b586853b0ddf64db645a17a5934f70ee304e2e8208844ada414dcdc8e585e53"],"state_sha256":"59109174e715382a5e30d8be0c6e4f5e206ccc796f7eacd054db5669835e1700"}