{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SOCFTDY3E4G3IIMAPFRU4XEHK5","short_pith_number":"pith:SOCFTDY3","canonical_record":{"source":{"id":"2506.00878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T07:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"f95abbacc12a7a0f2a5726e6f10091077809fdfa16df38f3c92933383fba068c","abstract_canon_sha256":"44e386ca82188bfaebdae981e9f58ab786a102f998e1a85fc938f167a21deab3"},"schema_version":"1.0"},"canonical_sha256":"9384598f1b270db4218079634e5c875740af2105c778e20f2e8547b57d0baec7","source":{"kind":"arxiv","id":"2506.00878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00878","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00878v1","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00878","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"SOCFTDY3E4G3","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"SOCFTDY3E4G3IIMA","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"SOCFTDY3","created_at":"2026-07-05T11:13:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SOCFTDY3E4G3IIMAPFRU4XEHK5","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T07:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"f95abbacc12a7a0f2a5726e6f10091077809fdfa16df38f3c92933383fba068c","abstract_canon_sha256":"44e386ca82188bfaebdae981e9f58ab786a102f998e1a85fc938f167a21deab3"},"schema_version":"1.0"},"canonical_sha256":"9384598f1b270db4218079634e5c875740af2105c778e20f2e8547b57d0baec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:42.155746Z","signature_b64":"Egc/HPhBSyN8StOZPRRNg+0qm/BZp/IDkYgRTG9K8+EBHKoR25EcyMVgtWR6BfuBJrF+5zOSk/KVzrSw5fAIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9384598f1b270db4218079634e5c875740af2105c778e20f2e8547b57d0baec7","last_reissued_at":"2026-07-05T11:13:42.155245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:42.155245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00878","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-05T11:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiCU+kc6D394/PDClMDeFgqt6sV36zpKub+vYgPh74xAP2kgUZMRCNkyun/ja/07uGQNPeoVr9xwvJ6VuYjACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:30:37.182503Z"},"content_sha256":"ffea528d0308e34efb5caab8200c3da31f27bf45acde98abb218cb406406e5cc","schema_version":"1.0","event_id":"sha256:ffea528d0308e34efb5caab8200c3da31f27bf45acde98abb218cb406406e5cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SOCFTDY3E4G3IIMAPFRU4XEHK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guiping Wang, Licheng Zhang, Yuanqiu Huang, Zhangdong Ouyang","submitted_at":"2025-06-01T07:37:34Z","abstract_excerpt":"Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph has at most 2.25n-4 edges, which implies that bipartite IC-planar graphs have vertex-connectivity at most 4. In this paper, we prove that any n-vertex maximal bipartite IC-plane graph with connectivity 2 has at least 3/2n-2 edges, and those with connectivity 3 has at least 2n-3 edges. All the above lower bounds are tight. For 4-connected maximal bipartite I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00878","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/2506.00878/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-05T11:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qI3q3Af75w+ljjFGLA3hPfNaO3cC5S5mt6dNHyRvj4MSFoVI45/6vmRClJHp58Xmn/BJaTEts3k0k9pL5YnEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:30:37.183002Z"},"content_sha256":"4a7b639eca7eea05cb4052fc9249e99634d696abb5d16fbf6ae8f14aa94d20f5","schema_version":"1.0","event_id":"sha256:4a7b639eca7eea05cb4052fc9249e99634d696abb5d16fbf6ae8f14aa94d20f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5/bundle.json","state_url":"https://pith.science/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5/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-07T21:30:37Z","links":{"resolver":"https://pith.science/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5","bundle":"https://pith.science/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5/bundle.json","state":"https://pith.science/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOCFTDY3E4G3IIMAPFRU4XEHK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SOCFTDY3E4G3IIMAPFRU4XEHK5","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":"44e386ca82188bfaebdae981e9f58ab786a102f998e1a85fc938f167a21deab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T07:37:34Z","title_canon_sha256":"f95abbacc12a7a0f2a5726e6f10091077809fdfa16df38f3c92933383fba068c"},"schema_version":"1.0","source":{"id":"2506.00878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00878","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00878v1","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00878","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"SOCFTDY3E4G3","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"SOCFTDY3E4G3IIMA","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"SOCFTDY3","created_at":"2026-07-05T11:13:42Z"}],"graph_snapshots":[{"event_id":"sha256:4a7b639eca7eea05cb4052fc9249e99634d696abb5d16fbf6ae8f14aa94d20f5","target":"graph","created_at":"2026-07-05T11:13:42Z","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/2506.00878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph has at most 2.25n-4 edges, which implies that bipartite IC-planar graphs have vertex-connectivity at most 4. In this paper, we prove that any n-vertex maximal bipartite IC-plane graph with connectivity 2 has at least 3/2n-2 edges, and those with connectivity 3 has at least 2n-3 edges. All the above lower bounds are tight. For 4-connected maximal bipartite I","authors_text":"Guiping Wang, 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-06-01T07:37:34Z","title":"The minimum size of maximal bipartite IC-plane graphs with given connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00878","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:ffea528d0308e34efb5caab8200c3da31f27bf45acde98abb218cb406406e5cc","target":"record","created_at":"2026-07-05T11:13:42Z","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":"44e386ca82188bfaebdae981e9f58ab786a102f998e1a85fc938f167a21deab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-01T07:37:34Z","title_canon_sha256":"f95abbacc12a7a0f2a5726e6f10091077809fdfa16df38f3c92933383fba068c"},"schema_version":"1.0","source":{"id":"2506.00878","kind":"arxiv","version":1}},"canonical_sha256":"9384598f1b270db4218079634e5c875740af2105c778e20f2e8547b57d0baec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9384598f1b270db4218079634e5c875740af2105c778e20f2e8547b57d0baec7","first_computed_at":"2026-07-05T11:13:42.155245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:42.155245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Egc/HPhBSyN8StOZPRRNg+0qm/BZp/IDkYgRTG9K8+EBHKoR25EcyMVgtWR6BfuBJrF+5zOSk/KVzrSw5fAIAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:42.155746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffea528d0308e34efb5caab8200c3da31f27bf45acde98abb218cb406406e5cc","sha256:4a7b639eca7eea05cb4052fc9249e99634d696abb5d16fbf6ae8f14aa94d20f5"],"state_sha256":"5cb8336af1cf7d0618a434923fdf4dedad07e3b188aabd75aaca05b79b38cc9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPpAgw1N059SkwjFo/woKoQHE5dAM0kkuoL9DcqIBI715CXwUzoCM5rDfIpTnki2ggJwJMlsj6ap3rifHWMuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:30:37.186645Z","bundle_sha256":"d4b9e552deaa7d4486f120c663fa5eacc1817a779689dc0878873116489f99a6"}}