{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5ZKXZB7VMDYN7OJJSHCQVLKTOW","short_pith_number":"pith:5ZKXZB7V","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"},"canonical_sha256":"ee557c87f560f0dfb92991c50aad5375a3839b84d02691708519d32fcd770d38","source":{"kind":"arxiv","id":"2504.21558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21558","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21558v1","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21558","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"5ZKXZB7VMDYN","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"pith_short_16","alias_value":"5ZKXZB7VMDYN7OJJ","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"pith_short_8","alias_value":"5ZKXZB7V","created_at":"2026-07-05T10:56:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5ZKXZB7VMDYN7OJJSHCQVLKTOW","target":"record","payload":{"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"},"canonical_sha256":"ee557c87f560f0dfb92991c50aad5375a3839b84d02691708519d32fcd770d38","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"},"source_kind":"arxiv","source_id":"2504.21558","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-07-05T10:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaQvOAZmovlQKDvG7nCT5j90gwRQN5eghrr+CzyhnB9vep5AyVeGzcYjaJq6vS3WRH1UkVbzeFX15/lmp02qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:29:11.087105Z"},"content_sha256":"377f94603610396c5d6a70b1d02adb5ea66ca16894012dd74be8d56c9c839384","schema_version":"1.0","event_id":"sha256:377f94603610396c5d6a70b1d02adb5ea66ca16894012dd74be8d56c9c839384"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5ZKXZB7VMDYN7OJJSHCQVLKTOW","target":"graph","payload":{"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"},"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-07-05T10:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHpY9BQ9qrWlTYgTvZ7qqTWP7DUT1ENHJVK9f4/AJ/u5RAHoIgEQV0jtIOuuS1E2+bxa0p37rsQzj6CvkP7RAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:29:11.087590Z"},"content_sha256":"9482a657f6cd694d098fe4f21629420230a43995c8157d0a4fccfb8682a9eff1","schema_version":"1.0","event_id":"sha256:9482a657f6cd694d098fe4f21629420230a43995c8157d0a4fccfb8682a9eff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/bundle.json","state_url":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/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-08-08T15:29:11Z","links":{"resolver":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW","bundle":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/bundle.json","state":"https://pith.science/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZKXZB7VMDYN7OJJSHCQVLKTOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5ZKXZB7VMDYN7OJJSHCQVLKTOW","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":"0175e0e50df91479e7f0cacd3b5a0153941f2a5eb5d55320a32af8febaadd0e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T11:57:00Z","title_canon_sha256":"ed235f5dfb1fc239714efc196f6cdb2fe1b5d2a9a8a77a8c9963308cc328d47e"},"schema_version":"1.0","source":{"id":"2504.21558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21558","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21558v1","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21558","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"5ZKXZB7VMDYN","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"pith_short_16","alias_value":"5ZKXZB7VMDYN7OJJ","created_at":"2026-07-05T10:56:25Z"},{"alias_kind":"pith_short_8","alias_value":"5ZKXZB7V","created_at":"2026-07-05T10:56:25Z"}],"graph_snapshots":[{"event_id":"sha256:9482a657f6cd694d098fe4f21629420230a43995c8157d0a4fccfb8682a9eff1","target":"graph","created_at":"2026-07-05T10:56:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.21558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fengming Dong, Licheng Zhang, Yuanqiu Huang, Zhangdong Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T11:57:00Z","title":"The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21558","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:377f94603610396c5d6a70b1d02adb5ea66ca16894012dd74be8d56c9c839384","target":"record","created_at":"2026-07-05T10:56:25Z","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":"0175e0e50df91479e7f0cacd3b5a0153941f2a5eb5d55320a32af8febaadd0e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T11:57:00Z","title_canon_sha256":"ed235f5dfb1fc239714efc196f6cdb2fe1b5d2a9a8a77a8c9963308cc328d47e"},"schema_version":"1.0","source":{"id":"2504.21558","kind":"arxiv","version":1}},"canonical_sha256":"ee557c87f560f0dfb92991c50aad5375a3839b84d02691708519d32fcd770d38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee557c87f560f0dfb92991c50aad5375a3839b84d02691708519d32fcd770d38","first_computed_at":"2026-07-05T10:56:25.872839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:56:25.872839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55UVhiu2c4OmiKq7kv7b1bkAvjhuS16vkLPY4WYgWac5yak63n+TPev9EbxGAcKPehEbnXWmEGOKIk+3360JDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:56:25.873306Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.21558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:377f94603610396c5d6a70b1d02adb5ea66ca16894012dd74be8d56c9c839384","sha256:9482a657f6cd694d098fe4f21629420230a43995c8157d0a4fccfb8682a9eff1"],"state_sha256":"9bf97f8a948b1a1aba00dc0f6bede76095d4422bee5126396fc4dd6008a0375f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLbX2myWzM5T/mIvpEzb4h/7K1i8iyVBSbOMxchBfURa7Tn3q4wAi/Sj2elNnM+rsBOP6u3BrK4COWeLeDeBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:29:11.091147Z","bundle_sha256":"147fe0d4833344cb6244e56455688bff10ec202edd7fa5c4bd6431e05c78855b"}}