{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C7VQ5QQA7HFBMEL4XDPD2VZHZO","short_pith_number":"pith:C7VQ5QQA","schema_version":"1.0","canonical_sha256":"17eb0ec200f9ca16117cb8de3d5727cbaf6e1773a1da40c7708c9c6ba2cf1178","source":{"kind":"arxiv","id":"1403.6705","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.6705","created_at":"2026-05-18T00:48:43.467714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6705v1","created_at":"2026-05-18T00:48:43.467714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6705","created_at":"2026-05-18T00:48:43.467714+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7VQ5QQA7HFB","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7VQ5QQA7HFBMEL4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7VQ5QQA","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO","json":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO.json","graph_json":"https://pith.science/api/pith-number/C7VQ5QQA7HFBMEL4XDPD2VZHZO/graph.json","events_json":"https://pith.science/api/pith-number/C7VQ5QQA7HFBMEL4XDPD2VZHZO/events.json","paper":"https://pith.science/paper/C7VQ5QQA"},"agent_actions":{"view_html":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO","download_json":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO.json","view_paper":"https://pith.science/paper/C7VQ5QQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6705&json=true","fetch_graph":"https://pith.science/api/pith-number/C7VQ5QQA7HFBMEL4XDPD2VZHZO/graph.json","fetch_events":"https://pith.science/api/pith-number/C7VQ5QQA7HFBMEL4XDPD2VZHZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/action/storage_attestation","attest_author":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/action/author_attestation","sign_citation":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/action/citation_signature","submit_replication":"https://pith.science/pith/C7VQ5QQA7HFBMEL4XDPD2VZHZO/action/replication_record"}},"created_at":"2026-05-18T00:48:43.467714+00:00","updated_at":"2026-05-18T00:48:43.467714+00:00"}