{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NMTG54GWX64TW7O6KVLDG6AD5V","short_pith_number":"pith:NMTG54GW","canonical_record":{"source":{"id":"1410.0720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-02T21:52:32Z","cross_cats_sorted":[],"title_canon_sha256":"4a65ba3d7c4e06c909be21de9492dc62f9a30461522bef2acc6700f294e6b35a","abstract_canon_sha256":"c69dcec7aca8ad956c267d0c4b2688a663debeaa148cfaf83fcd350c45d8e193"},"schema_version":"1.0"},"canonical_sha256":"6b266ef0d6bfb93b7dde5556337803ed59b3ade8f2bdb8408356ba8e09de3c26","source":{"kind":"arxiv","id":"1410.0720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0720","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0720v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0720","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"NMTG54GWX64T","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NMTG54GWX64TW7O6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NMTG54GW","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NMTG54GWX64TW7O6KVLDG6AD5V","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-02T21:52:32Z","cross_cats_sorted":[],"title_canon_sha256":"4a65ba3d7c4e06c909be21de9492dc62f9a30461522bef2acc6700f294e6b35a","abstract_canon_sha256":"c69dcec7aca8ad956c267d0c4b2688a663debeaa148cfaf83fcd350c45d8e193"},"schema_version":"1.0"},"canonical_sha256":"6b266ef0d6bfb93b7dde5556337803ed59b3ade8f2bdb8408356ba8e09de3c26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.348231Z","signature_b64":"V2zVCa+w0+0mrbpHSgEJ7mXclAK0/KchZVDiIuVYwhw+bV1m+YaZE1M98FWMiy4nSMHgFwpUFpen+BRZEa0sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b266ef0d6bfb93b7dde5556337803ed59b3ade8f2bdb8408356ba8e09de3c26","last_reissued_at":"2026-05-18T00:54:58.347751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.347751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0720","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZ3zoN97cdK9bMzZ9zjjGY6jU1iMgtLKls7LZTSFZFm5npZan7Maa5X2UbzeVbyJab4g1M6l7meamMHeyundCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:38:36.643012Z"},"content_sha256":"6185e242176d681594498cb50ebcc98689edcde7850c7585f0345b4ee861c057","schema_version":"1.0","event_id":"sha256:6185e242176d681594498cb50ebcc98689edcde7850c7585f0345b4ee861c057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NMTG54GWX64TW7O6KVLDG6AD5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Crossing numbers of complete tripartite and balanced complete multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Ruiz, Bernard Lidick\\'y, Ellen Gethner, Florian Pfender, Leslie Hogben, Michael Young","submitted_at":"2014-10-02T21:52:32Z","abstract_excerpt":"The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing (with edges as straight line segments) of G. Zarankiewicz proved in 1952 that cr'(K_{n_1,n_2})\\le Z(n_1,n_2):= n_1/2*(n_1-1)/2*n_2/2*(n_2-1)/2. We define an analogous bound A(n_1,n_2,n_3) for the complete tripartite graph K_{n_1,n_2,n_3}, and prove that cr'(K_{n_1,n_2,n_3})\\le A({n_1,n_2,n_3}). We also show that for n large enough, 0.973 A(n,n,n) \\le cr'(K_{n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0720","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTtv2i5gxEBZxrhuEXU2KjT1oe2mMEN/PFygZpWlqrK4KawFMYSW5u1KyVTJMvTmKYmAmfF8EaQtjL65gissDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:38:36.643432Z"},"content_sha256":"6a3c192d758c230a3ce935ebf3ab58ada2770c1e3e38310a820ebb8583f76339","schema_version":"1.0","event_id":"sha256:6a3c192d758c230a3ce935ebf3ab58ada2770c1e3e38310a820ebb8583f76339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMTG54GWX64TW7O6KVLDG6AD5V/bundle.json","state_url":"https://pith.science/pith/NMTG54GWX64TW7O6KVLDG6AD5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMTG54GWX64TW7O6KVLDG6AD5V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T18:38:36Z","links":{"resolver":"https://pith.science/pith/NMTG54GWX64TW7O6KVLDG6AD5V","bundle":"https://pith.science/pith/NMTG54GWX64TW7O6KVLDG6AD5V/bundle.json","state":"https://pith.science/pith/NMTG54GWX64TW7O6KVLDG6AD5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMTG54GWX64TW7O6KVLDG6AD5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NMTG54GWX64TW7O6KVLDG6AD5V","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":"c69dcec7aca8ad956c267d0c4b2688a663debeaa148cfaf83fcd350c45d8e193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-02T21:52:32Z","title_canon_sha256":"4a65ba3d7c4e06c909be21de9492dc62f9a30461522bef2acc6700f294e6b35a"},"schema_version":"1.0","source":{"id":"1410.0720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0720","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0720v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0720","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"NMTG54GWX64T","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NMTG54GWX64TW7O6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NMTG54GW","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:6a3c192d758c230a3ce935ebf3ab58ada2770c1e3e38310a820ebb8583f76339","target":"graph","created_at":"2026-05-18T00:54:58Z","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"},"paper":{"abstract_excerpt":"The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing (with edges as straight line segments) of G. Zarankiewicz proved in 1952 that cr'(K_{n_1,n_2})\\le Z(n_1,n_2):= n_1/2*(n_1-1)/2*n_2/2*(n_2-1)/2. We define an analogous bound A(n_1,n_2,n_3) for the complete tripartite graph K_{n_1,n_2,n_3}, and prove that cr'(K_{n_1,n_2,n_3})\\le A({n_1,n_2,n_3}). We also show that for n large enough, 0.973 A(n,n,n) \\le cr'(K_{n","authors_text":"Amanda Ruiz, Bernard Lidick\\'y, Ellen Gethner, Florian Pfender, Leslie Hogben, Michael Young","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-02T21:52:32Z","title":"Crossing numbers of complete tripartite and balanced complete multipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0720","kind":"arxiv","version":1},"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:6185e242176d681594498cb50ebcc98689edcde7850c7585f0345b4ee861c057","target":"record","created_at":"2026-05-18T00:54:58Z","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":"c69dcec7aca8ad956c267d0c4b2688a663debeaa148cfaf83fcd350c45d8e193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-02T21:52:32Z","title_canon_sha256":"4a65ba3d7c4e06c909be21de9492dc62f9a30461522bef2acc6700f294e6b35a"},"schema_version":"1.0","source":{"id":"1410.0720","kind":"arxiv","version":1}},"canonical_sha256":"6b266ef0d6bfb93b7dde5556337803ed59b3ade8f2bdb8408356ba8e09de3c26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b266ef0d6bfb93b7dde5556337803ed59b3ade8f2bdb8408356ba8e09de3c26","first_computed_at":"2026-05-18T00:54:58.347751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.347751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V2zVCa+w0+0mrbpHSgEJ7mXclAK0/KchZVDiIuVYwhw+bV1m+YaZE1M98FWMiy4nSMHgFwpUFpen+BRZEa0sBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.348231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6185e242176d681594498cb50ebcc98689edcde7850c7585f0345b4ee861c057","sha256:6a3c192d758c230a3ce935ebf3ab58ada2770c1e3e38310a820ebb8583f76339"],"state_sha256":"f7bd689bb7c83e798665f63befddae0f850eecccbc44713bee3588f5b87d7a61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7nOPuu7zcXVQUuShwqD1biNPAUYnNwB3m9QNywnyo44FcB/zjYR6cIcxMLzVFUilssgP8w7dYOy3Pj3yIzmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:38:36.646584Z","bundle_sha256":"cae840ba5a7b7240d0deca4560750c467b0091d156ba14f957aec9f55069985e"}}