{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PZ44S62DCHYD75LTWRCGP44TAL","short_pith_number":"pith:PZ44S62D","canonical_record":{"source":{"id":"1404.1222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T11:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"2cd5077f6ce286f9fa3cbe2dae3b8fd96f224d28d6381f5349c49469dfbcd954","abstract_canon_sha256":"e81eff4a1affa38488fbb1cba151374d391f5ae2fcdd61838f0a54e32735ffcb"},"schema_version":"1.0"},"canonical_sha256":"7e79c97b4311f03ff573b44467f39302df4184807b50b13ada4f48bc798f25ee","source":{"kind":"arxiv","id":"1404.1222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1222","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1222v1","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1222","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"PZ44S62DCHYD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PZ44S62DCHYD75LT","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PZ44S62D","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PZ44S62DCHYD75LTWRCGP44TAL","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T11:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"2cd5077f6ce286f9fa3cbe2dae3b8fd96f224d28d6381f5349c49469dfbcd954","abstract_canon_sha256":"e81eff4a1affa38488fbb1cba151374d391f5ae2fcdd61838f0a54e32735ffcb"},"schema_version":"1.0"},"canonical_sha256":"7e79c97b4311f03ff573b44467f39302df4184807b50b13ada4f48bc798f25ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.460918Z","signature_b64":"di0cLh1UrmCDI8ofCR356WNLPF+Xi/CbfS6SbKH2SptrORwrrq5bcNokwP4IiUK3f1wjDouCNX/TF2xoJJ+RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e79c97b4311f03ff573b44467f39302df4184807b50b13ada4f48bc798f25ee","last_reissued_at":"2026-05-18T00:48:43.460367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.460367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1222","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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGx2rLeRb8bjn/OjaOyuxBg+qhXseRoQ4U12Tmm0craKs7iOlKIc8e9fYpHj4ORSMFtqvinBo5fSA/FVaGs+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:48:32.282200Z"},"content_sha256":"6723e16e1f8757fc976c46c292e6fb88dc4fbbf678904bc98d07a0e2976c585d","schema_version":"1.0","event_id":"sha256:6723e16e1f8757fc976c46c292e6fb88dc4fbbf678904bc98d07a0e2976c585d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PZ44S62DCHYD75LTWRCGP44TAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Three classes of 1-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ulius Czap, Peter \\v{S}ugerek","submitted_at":"2014-04-04T11:52:31Z","abstract_excerpt":"A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\\mathcal C_0, \\mathcal C_1$ and $\\mathcal C_2$ with respect to the types of crossings and present the decomposition of 1-planar join products.\n  Zhang \\cite{z} proved that every $n$-vertex 1-planar graph of class $\\mathcal C_1$ has at most $\\frac{18}{5}n-\\frac{36}{5}$ edges and a $\\mathcal C_1$-drawing with at most $\\frac 35 n-\\frac 65$ crossings. We improve these results. We show that every $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1222","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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs4ItKYiuVC8zoOjd09v3lUch+BvXdtYLHdyD3DZFWU4sj6KYFnXMzaig5DIhjIwUeLAoqKFEeWc9/j3gxyzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:48:32.282562Z"},"content_sha256":"f942598c68f09bca224dabaeb90d30d69ae8695fbaaca8da589121006cda49e7","schema_version":"1.0","event_id":"sha256:f942598c68f09bca224dabaeb90d30d69ae8695fbaaca8da589121006cda49e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZ44S62DCHYD75LTWRCGP44TAL/bundle.json","state_url":"https://pith.science/pith/PZ44S62DCHYD75LTWRCGP44TAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZ44S62DCHYD75LTWRCGP44TAL/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-06-03T17:48:32Z","links":{"resolver":"https://pith.science/pith/PZ44S62DCHYD75LTWRCGP44TAL","bundle":"https://pith.science/pith/PZ44S62DCHYD75LTWRCGP44TAL/bundle.json","state":"https://pith.science/pith/PZ44S62DCHYD75LTWRCGP44TAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZ44S62DCHYD75LTWRCGP44TAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PZ44S62DCHYD75LTWRCGP44TAL","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":"e81eff4a1affa38488fbb1cba151374d391f5ae2fcdd61838f0a54e32735ffcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T11:52:31Z","title_canon_sha256":"2cd5077f6ce286f9fa3cbe2dae3b8fd96f224d28d6381f5349c49469dfbcd954"},"schema_version":"1.0","source":{"id":"1404.1222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1222","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1222v1","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1222","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"PZ44S62DCHYD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PZ44S62DCHYD75LT","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PZ44S62D","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:f942598c68f09bca224dabaeb90d30d69ae8695fbaaca8da589121006cda49e7","target":"graph","created_at":"2026-05-18T00:48:43Z","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":"A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\\mathcal C_0, \\mathcal C_1$ and $\\mathcal C_2$ with respect to the types of crossings and present the decomposition of 1-planar join products.\n  Zhang \\cite{z} proved that every $n$-vertex 1-planar graph of class $\\mathcal C_1$ has at most $\\frac{18}{5}n-\\frac{36}{5}$ edges and a $\\mathcal C_1$-drawing with at most $\\frac 35 n-\\frac 65$ crossings. We improve these results. We show that every $\\ma","authors_text":"J\\'ulius Czap, Peter \\v{S}ugerek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T11:52:31Z","title":"Three classes of 1-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1222","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:6723e16e1f8757fc976c46c292e6fb88dc4fbbf678904bc98d07a0e2976c585d","target":"record","created_at":"2026-05-18T00:48:43Z","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":"e81eff4a1affa38488fbb1cba151374d391f5ae2fcdd61838f0a54e32735ffcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T11:52:31Z","title_canon_sha256":"2cd5077f6ce286f9fa3cbe2dae3b8fd96f224d28d6381f5349c49469dfbcd954"},"schema_version":"1.0","source":{"id":"1404.1222","kind":"arxiv","version":1}},"canonical_sha256":"7e79c97b4311f03ff573b44467f39302df4184807b50b13ada4f48bc798f25ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e79c97b4311f03ff573b44467f39302df4184807b50b13ada4f48bc798f25ee","first_computed_at":"2026-05-18T00:48:43.460367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:43.460367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"di0cLh1UrmCDI8ofCR356WNLPF+Xi/CbfS6SbKH2SptrORwrrq5bcNokwP4IiUK3f1wjDouCNX/TF2xoJJ+RBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:43.460918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6723e16e1f8757fc976c46c292e6fb88dc4fbbf678904bc98d07a0e2976c585d","sha256:f942598c68f09bca224dabaeb90d30d69ae8695fbaaca8da589121006cda49e7"],"state_sha256":"08e4d278b3f828d83bdb89305385e1ac8e76d0182bd18824b87ed081efc2101e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YB4TX717hhgP+x5hSL0HrpbC1AiXhqfgDPZ+SlmXDUTZMIg41ItoE7fq121hzG7JFhOwabOPF4nVgx3kzQDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:48:32.284452Z","bundle_sha256":"eae47cf8f70b2b143f30c1c88c4ccbde41decc43b1680e23a20b73eb86166081"}}