{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KWUQYWUPA4MI3PHNIG2N4Y2RIC","short_pith_number":"pith:KWUQYWUP","canonical_record":{"source":{"id":"1611.05746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-17T15:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"69eb3bfd64654f0ed55e6b6573c711856eb78ae59290c8907cc7955d0b53c99b","abstract_canon_sha256":"d3f0df8367758082f86fd7aea34bfe39e326ac59e85467a6d50e75ded0af597c"},"schema_version":"1.0"},"canonical_sha256":"55a90c5a8f07188dbced41b4de635140bc48b9a34a88045f8c206d0c16d891be","source":{"kind":"arxiv","id":"1611.05746","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05746","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05746v1","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05746","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"KWUQYWUPA4MI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWUQYWUPA4MI3PHN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWUQYWUP","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KWUQYWUPA4MI3PHNIG2N4Y2RIC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-17T15:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"69eb3bfd64654f0ed55e6b6573c711856eb78ae59290c8907cc7955d0b53c99b","abstract_canon_sha256":"d3f0df8367758082f86fd7aea34bfe39e326ac59e85467a6d50e75ded0af597c"},"schema_version":"1.0"},"canonical_sha256":"55a90c5a8f07188dbced41b4de635140bc48b9a34a88045f8c206d0c16d891be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:33.090789Z","signature_b64":"o/reXfYklnXr49IXzpzNYokJD1btKR4pEi76AUravib4momrBuTQ/KPrsp0XhSjodgkNdyjuQvGShPo/13oCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a90c5a8f07188dbced41b4de635140bc48b9a34a88045f8c206d0c16d891be","last_reissued_at":"2026-05-17T23:57:33.090259Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:33.090259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05746","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-17T23:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mVpgPq0Lt15GF6585CjkF/ro0YTeT1Plp2knlP9zbb0mjjihX2oCfVOVfeglubyCnC1cgqiy/IU7SIZsYsdeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:18:32.285237Z"},"content_sha256":"f39bc25c4a353b02fa7eb52a59edcfb3c491b79c228ccaebfa4e4799bd7360ec","schema_version":"1.0","event_id":"sha256:f39bc25c4a353b02fa7eb52a59edcfb3c491b79c228ccaebfa4e4799bd7360ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KWUQYWUPA4MI3PHNIG2N4Y2RIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on k-planar crossing numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csaba D. T\\'oth, G\\'eza T\\'oth, J\\'anos Pach, L\\'aszl\\'o A. Sz\\'ekely","submitted_at":"2016-11-17T15:56:33Z","abstract_excerpt":"The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of $cr(G_0)+cr(G_1)+\\ldots+cr(G_{k-1})$ over all graphs $G_0, G_1,\\ldots, G_{k-1}$ with $\\cup_{i=0}^{k-1}G_i=G$. It is shown that for every $k\\ge 1$, we have $cr_k(G)\\le \\left(\\frac{2}{k^2}-\\frac1{k^3}\\right)cr(G)$. This bound does not remain true if we replace the constant $\\frac{2}{k^2}-\\frac1{k^3}$ by any number smaller than $\\frac1{k^2}$. Some of the results extend to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05746","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-17T23:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugbjUmjC04+IxykH33E9v3RP85/2KPtpe67Lz6zB9WG+LIT+dOGVE0iiGFP5pTFneOg5KdWyee/SLheKqoyJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:18:32.285995Z"},"content_sha256":"ff257810a35a736ef594b760dbc789ade59430d56d26680a2058d9056e5972cd","schema_version":"1.0","event_id":"sha256:ff257810a35a736ef594b760dbc789ade59430d56d26680a2058d9056e5972cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC/bundle.json","state_url":"https://pith.science/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC/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-27T21:18:32Z","links":{"resolver":"https://pith.science/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC","bundle":"https://pith.science/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC/bundle.json","state":"https://pith.science/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWUQYWUPA4MI3PHNIG2N4Y2RIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KWUQYWUPA4MI3PHNIG2N4Y2RIC","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":"d3f0df8367758082f86fd7aea34bfe39e326ac59e85467a6d50e75ded0af597c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-17T15:56:33Z","title_canon_sha256":"69eb3bfd64654f0ed55e6b6573c711856eb78ae59290c8907cc7955d0b53c99b"},"schema_version":"1.0","source":{"id":"1611.05746","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05746","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05746v1","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05746","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"KWUQYWUPA4MI","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWUQYWUPA4MI3PHN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWUQYWUP","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:ff257810a35a736ef594b760dbc789ade59430d56d26680a2058d9056e5972cd","target":"graph","created_at":"2026-05-17T23:57:33Z","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=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of $cr(G_0)+cr(G_1)+\\ldots+cr(G_{k-1})$ over all graphs $G_0, G_1,\\ldots, G_{k-1}$ with $\\cup_{i=0}^{k-1}G_i=G$. It is shown that for every $k\\ge 1$, we have $cr_k(G)\\le \\left(\\frac{2}{k^2}-\\frac1{k^3}\\right)cr(G)$. This bound does not remain true if we replace the constant $\\frac{2}{k^2}-\\frac1{k^3}$ by any number smaller than $\\frac1{k^2}$. Some of the results extend to th","authors_text":"Csaba D. T\\'oth, G\\'eza T\\'oth, J\\'anos Pach, L\\'aszl\\'o A. Sz\\'ekely","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-17T15:56:33Z","title":"Note on k-planar crossing numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05746","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:f39bc25c4a353b02fa7eb52a59edcfb3c491b79c228ccaebfa4e4799bd7360ec","target":"record","created_at":"2026-05-17T23:57:33Z","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":"d3f0df8367758082f86fd7aea34bfe39e326ac59e85467a6d50e75ded0af597c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-17T15:56:33Z","title_canon_sha256":"69eb3bfd64654f0ed55e6b6573c711856eb78ae59290c8907cc7955d0b53c99b"},"schema_version":"1.0","source":{"id":"1611.05746","kind":"arxiv","version":1}},"canonical_sha256":"55a90c5a8f07188dbced41b4de635140bc48b9a34a88045f8c206d0c16d891be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55a90c5a8f07188dbced41b4de635140bc48b9a34a88045f8c206d0c16d891be","first_computed_at":"2026-05-17T23:57:33.090259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:33.090259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o/reXfYklnXr49IXzpzNYokJD1btKR4pEi76AUravib4momrBuTQ/KPrsp0XhSjodgkNdyjuQvGShPo/13oCAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:33.090789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05746","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f39bc25c4a353b02fa7eb52a59edcfb3c491b79c228ccaebfa4e4799bd7360ec","sha256:ff257810a35a736ef594b760dbc789ade59430d56d26680a2058d9056e5972cd"],"state_sha256":"be4bac08c9833930b4ce243a8aa98a37e65660a98b1dfd5ad3f8829be6438810"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dKKqeIVLtzltNkhojW4cHxYzBjCzmqjZl2948xNnuqp8OWSi4ba2O/vr0ZPe/WvDefd7Qwz65yGAWb0CcLkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:18:32.289502Z","bundle_sha256":"424ac386ec220bfe2c8311433629af18065f4f6a978033e6caed3da93847c9f3"}}