{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5ZKXZB7VMDYN7OJJSHCQVLKTOW","short_pith_number":"pith:5ZKXZB7V","schema_version":"1.0","canonical_sha256":"ee557c87f560f0dfb92991c50aad5375a3839b84d02691708519d32fcd770d38","source":{"kind":"arxiv","id":"2504.21558","version":1},"attestation_state":"computed","paper":{"title":"The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong, Licheng Zhang, Yuanqiu Huang, Zhangdong Ouyang","submitted_at":"2025-04-30T11:57:00Z","abstract_excerpt":"A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no additional edge can be added without violating 1-planarity or simplicity. It is known that any maximal 1-plane graph is $k$-connected for some $k$ with $2\\le k\\le 7$. Recently, Huang et al. proved that any maximal 1-plane graph with $n$ ($\\ge 5$) vertices has at least $\\lceil\\frac{7}{3}n\\rceil-3$ edges, which is tight for all integers $n\\ge 5$. In this paper"},"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":"2504.21558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T11:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"ed235f5dfb1fc239714efc196f6cdb2fe1b5d2a9a8a77a8c9963308cc328d47e","abstract_canon_sha256":"0175e0e50df91479e7f0cacd3b5a0153941f2a5eb5d55320a32af8febaadd0e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:25.873306Z","signature_b64":"55UVhiu2c4OmiKq7kv7b1bkAvjhuS16vkLPY4WYgWac5yak63n+TPev9EbxGAcKPehEbnXWmEGOKIk+3360JDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee557c87f560f0dfb92991c50aad5375a3839b84d02691708519d32fcd770d38","last_reissued_at":"2026-07-05T10:56:25.872839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:25.872839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengming Dong, Licheng Zhang, Yuanqiu Huang, Zhangdong Ouyang","submitted_at":"2025-04-30T11:57:00Z","abstract_excerpt":"A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no additional edge can be added without violating 1-planarity or simplicity. It is known that any maximal 1-plane graph is $k$-connected for some $k$ with $2\\le k\\le 7$. Recently, Huang et al. proved that any maximal 1-plane graph with $n$ ($\\ge 5$) vertices has at least $\\lceil\\frac{7}{3}n\\rceil-3$ edges, which is tight for all integers $n\\ge 5$. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21558","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.21558/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.21558","created_at":"2026-07-05T10:56:25.872892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21558v1","created_at":"2026-07-05T10:56:25.872892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21558","created_at":"2026-07-05T10:56:25.872892+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZKXZB7VMDYN","created_at":"2026-07-05T10:56:25.872892+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZKXZB7VMDYN7OJJ","created_at":"2026-07-05T10:56:25.872892+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZKXZB7V","created_at":"2026-07-05T10:56:25.872892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00878","citing_title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW","json":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW.json","graph_json":"https://pith.science/api/pith-number/5ZKXZB7VMDYN7OJJSHCQVLKTOW/graph.json","events_json":"https://pith.science/api/pith-number/5ZKXZB7VMDYN7OJJSHCQVLKTOW/events.json","paper":"https://pith.science/paper/5ZKXZB7V"},"agent_actions":{"view_html":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW","download_json":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW.json","view_paper":"https://pith.science/paper/5ZKXZB7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21558&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZKXZB7VMDYN7OJJSHCQVLKTOW/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZKXZB7VMDYN7OJJSHCQVLKTOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/action/storage_attestation","attest_author":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/action/author_attestation","sign_citation":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/action/citation_signature","submit_replication":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/action/replication_record"}},"created_at":"2026-07-05T10:56:25.872892+00:00","updated_at":"2026-07-05T10:56:25.872892+00:00"}