{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C7VQ5QQA7HFBMEL4XDPD2VZHZO","short_pith_number":"pith:C7VQ5QQA","canonical_record":{"source":{"id":"1403.6705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-26T14:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"cfc4736545a41be4309bf6f6fe4137635c4827f1659f46f7749c14d75cdebab8","abstract_canon_sha256":"e2ebf481a0d2ed66562e6b622ef69318f2a4db45c1d78eb35085e8023e0dad77"},"schema_version":"1.0"},"canonical_sha256":"17eb0ec200f9ca16117cb8de3d5727cbaf6e1773a1da40c7708c9c6ba2cf1178","source":{"kind":"arxiv","id":"1403.6705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6705","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6705v1","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6705","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"C7VQ5QQA7HFB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C7VQ5QQA7HFBMEL4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C7VQ5QQA","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C7VQ5QQA7HFBMEL4XDPD2VZHZO","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-26T14:58:15Z","cross_cats_sorted":[],"title_canon_sha256":"cfc4736545a41be4309bf6f6fe4137635c4827f1659f46f7749c14d75cdebab8","abstract_canon_sha256":"e2ebf481a0d2ed66562e6b622ef69318f2a4db45c1d78eb35085e8023e0dad77"},"schema_version":"1.0"},"canonical_sha256":"17eb0ec200f9ca16117cb8de3d5727cbaf6e1773a1da40c7708c9c6ba2cf1178","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.468169Z","signature_b64":"uzt0j0mK5LhT44NICx7iHL8dU16EHn3lv3/UdKscJqMEcAOjK3Fw09uVeJCT6yc47mSzM4LDFLgC7z7MNNTwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17eb0ec200f9ca16117cb8de3d5727cbaf6e1773a1da40c7708c9c6ba2cf1178","last_reissued_at":"2026-05-18T00:48:43.467634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.467634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6705","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":"VVrmjjntcHOp1DO/JHFFJNyDnCtDqOeXzePDKZThDDkZjpXg6LmuvblUnBKhhVUa+s6kf1DSjtcF8BDNtzd7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:22:59.150094Z"},"content_sha256":"f900b92bf96e8fd408aa68928db01d1118e1e1ddaf6ea56e45a9ef45a1d07a9d","schema_version":"1.0","event_id":"sha256:f900b92bf96e8fd408aa68928db01d1118e1e1ddaf6ea56e45a9ef45a1d07a9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C7VQ5QQA7HFBMEL4XDPD2VZHZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joins of 1-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'avid Hud\\'ak, J\\'ulius Czap, Tom\\'a\\v{s} Madaras","submitted_at":"2014-03-26T14:58:15Z","abstract_excerpt":"A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the join $G+H$ is 1-planar if and only if the pair $[G,H]$ is subgraph-majorized (that is, both $G$ and $H$ are subgraphs of graphs of the major pair) by one of pairs $[C_3 \\cup C_3,C_3], [C_4,C_4], [C_4,C_3], [K_{2,1,1},P_3]$ in the case when both factors of the graph join have at least three vertices. If one factor has at most two vertices, then we give several necessary/sufficient conditions for the bigger factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6705","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":"gg8ukEDeGKxa/i1E/i0IcWo1EnYl4L2qM4v/FBjujiwoHPatabwLp5WtCcPioIuHHspVMCcC3jf6cs+a6zCmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:22:59.150455Z"},"content_sha256":"1ff1dda9cd4feea3d9ced9793a89bc448895c6557930024e84a119ffe18f90cb","schema_version":"1.0","event_id":"sha256:1ff1dda9cd4feea3d9ced9793a89bc448895c6557930024e84a119ffe18f90cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/bundle.json","state_url":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/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-03T19:22:59Z","links":{"resolver":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO","bundle":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/bundle.json","state":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C7VQ5QQA7HFBMEL4XDPD2VZHZO","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":"e2ebf481a0d2ed66562e6b622ef69318f2a4db45c1d78eb35085e8023e0dad77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-26T14:58:15Z","title_canon_sha256":"cfc4736545a41be4309bf6f6fe4137635c4827f1659f46f7749c14d75cdebab8"},"schema_version":"1.0","source":{"id":"1403.6705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6705","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6705v1","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6705","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"C7VQ5QQA7HFB","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C7VQ5QQA7HFBMEL4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C7VQ5QQA","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:1ff1dda9cd4feea3d9ced9793a89bc448895c6557930024e84a119ffe18f90cb","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 there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the join $G+H$ is 1-planar if and only if the pair $[G,H]$ is subgraph-majorized (that is, both $G$ and $H$ are subgraphs of graphs of the major pair) by one of pairs $[C_3 \\cup C_3,C_3], [C_4,C_4], [C_4,C_3], [K_{2,1,1},P_3]$ in the case when both factors of the graph join have at least three vertices. If one factor has at most two vertices, then we give several necessary/sufficient conditions for the bigger factor.","authors_text":"D\\'avid Hud\\'ak, J\\'ulius Czap, Tom\\'a\\v{s} Madaras","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-26T14:58:15Z","title":"Joins of 1-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6705","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:f900b92bf96e8fd408aa68928db01d1118e1e1ddaf6ea56e45a9ef45a1d07a9d","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":"e2ebf481a0d2ed66562e6b622ef69318f2a4db45c1d78eb35085e8023e0dad77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-26T14:58:15Z","title_canon_sha256":"cfc4736545a41be4309bf6f6fe4137635c4827f1659f46f7749c14d75cdebab8"},"schema_version":"1.0","source":{"id":"1403.6705","kind":"arxiv","version":1}},"canonical_sha256":"17eb0ec200f9ca16117cb8de3d5727cbaf6e1773a1da40c7708c9c6ba2cf1178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17eb0ec200f9ca16117cb8de3d5727cbaf6e1773a1da40c7708c9c6ba2cf1178","first_computed_at":"2026-05-18T00:48:43.467634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:43.467634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uzt0j0mK5LhT44NICx7iHL8dU16EHn3lv3/UdKscJqMEcAOjK3Fw09uVeJCT6yc47mSzM4LDFLgC7z7MNNTwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:43.468169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f900b92bf96e8fd408aa68928db01d1118e1e1ddaf6ea56e45a9ef45a1d07a9d","sha256:1ff1dda9cd4feea3d9ced9793a89bc448895c6557930024e84a119ffe18f90cb"],"state_sha256":"1879daaa7843cc1dda42b01d4543ee9d7cfa38d114ccf861baad11da7e75ba81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"megLMiF7LqtDDpG6CmHNXVEpqpxHUgtykoNzs7XkZ24dU6aFK5KWEU3yC1JyY+HJvmYniEQLK7Ylun9djpZCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:22:59.152384Z","bundle_sha256":"4c40ef2265dcb46b070d4ed2faaec90a319f466dbe488222c83f161ad6f363b5"}}