{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C62BHSSTLZQAKI2CGXDVNJKSS4","short_pith_number":"pith:C62BHSST","canonical_record":{"source":{"id":"2502.11696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T11:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"a369faeb22db908f3a44183db0ad46ff43f58c58a3c38691313d5db7e75115f3","abstract_canon_sha256":"45fc2eb90372c8c205dff952bc4444001ae282c44a0d21503d3a294913990dac"},"schema_version":"1.0"},"canonical_sha256":"17b413ca535e6005234235c756a552970c7557ca492946a9dcd2bac7cdba5e8f","source":{"kind":"arxiv","id":"2502.11696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11696","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11696v1","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11696","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"C62BHSSTLZQA","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_16","alias_value":"C62BHSSTLZQAKI2C","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_8","alias_value":"C62BHSST","created_at":"2026-07-05T10:15:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C62BHSSTLZQAKI2CGXDVNJKSS4","target":"record","payload":{"canonical_record":{"source":{"id":"2502.11696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T11:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"a369faeb22db908f3a44183db0ad46ff43f58c58a3c38691313d5db7e75115f3","abstract_canon_sha256":"45fc2eb90372c8c205dff952bc4444001ae282c44a0d21503d3a294913990dac"},"schema_version":"1.0"},"canonical_sha256":"17b413ca535e6005234235c756a552970c7557ca492946a9dcd2bac7cdba5e8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:32.496554Z","signature_b64":"X4pGilTDkWFov6WpeoajiFyTwlzjrfn44BUi0AvGNjTmWUJCM/NxtiL40thf++OyizxM/o60XpsPdlb341CqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17b413ca535e6005234235c756a552970c7557ca492946a9dcd2bac7cdba5e8f","last_reissued_at":"2026-07-05T10:15:32.495969Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:32.495969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.11696","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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOl9GzXZm1PQeqRWCbI72nwEzRHF1ssdtDq1wVk5/A9r5rRg79CubX0TN0x1SwiknZkeJkktUm1+wHoAGfodAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:44:04.655945Z"},"content_sha256":"fcdc8693fe983ef9580abbae6c077e75690cdbce60c2c533805f9cadf0e2a5e6","schema_version":"1.0","event_id":"sha256:fcdc8693fe983ef9580abbae6c077e75690cdbce60c2c533805f9cadf0e2a5e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C62BHSSTLZQAKI2CGXDVNJKSS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Determining the minimum size of maximal 1-plane graphs","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-02-17T11:34:22Z","abstract_excerpt":"A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote the minimum size of a maximal $1$-plane graph of order $n$. Brandenburg et al. established that\n  $m(n)\\ge 2.1n-\\frac{10}{3}$ for all $n\\ge 4$, which was improved by Bar\\'{a}t and T\\'{o}th to $m(n)\\ge \\frac{20}{9}n-\\frac{10}{3}$. In this paper, we confirm that $m(n)=\\left\\lceil\\frac{7}{3}n\\right\\rceil-3$ for all $n\\ge 5$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11696","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/2502.11696/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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tbPjgu0sXtXvtjwz8SVxgLNaIc/lL+HXs96s+cX1T3LVOKQBIYvubilWDreMJPbEg/wsMV22AQ1IgYU5UBdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:44:04.656520Z"},"content_sha256":"cf2c5e2e0cc8b01935f764e21fc9514a7bd07c94dc087592ba4653b34c9dbfbc","schema_version":"1.0","event_id":"sha256:cf2c5e2e0cc8b01935f764e21fc9514a7bd07c94dc087592ba4653b34c9dbfbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C62BHSSTLZQAKI2CGXDVNJKSS4/bundle.json","state_url":"https://pith.science/pith/C62BHSSTLZQAKI2CGXDVNJKSS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C62BHSSTLZQAKI2CGXDVNJKSS4/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-08T11:44:04Z","links":{"resolver":"https://pith.science/pith/C62BHSSTLZQAKI2CGXDVNJKSS4","bundle":"https://pith.science/pith/C62BHSSTLZQAKI2CGXDVNJKSS4/bundle.json","state":"https://pith.science/pith/C62BHSSTLZQAKI2CGXDVNJKSS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C62BHSSTLZQAKI2CGXDVNJKSS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C62BHSSTLZQAKI2CGXDVNJKSS4","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":"45fc2eb90372c8c205dff952bc4444001ae282c44a0d21503d3a294913990dac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T11:34:22Z","title_canon_sha256":"a369faeb22db908f3a44183db0ad46ff43f58c58a3c38691313d5db7e75115f3"},"schema_version":"1.0","source":{"id":"2502.11696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11696","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11696v1","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11696","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"C62BHSSTLZQA","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_16","alias_value":"C62BHSSTLZQAKI2C","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_8","alias_value":"C62BHSST","created_at":"2026-07-05T10:15:32Z"}],"graph_snapshots":[{"event_id":"sha256:cf2c5e2e0cc8b01935f764e21fc9514a7bd07c94dc087592ba4653b34c9dbfbc","target":"graph","created_at":"2026-07-05T10:15:32Z","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/2502.11696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote the minimum size of a maximal $1$-plane graph of order $n$. Brandenburg et al. established that\n  $m(n)\\ge 2.1n-\\frac{10}{3}$ for all $n\\ge 4$, which was improved by Bar\\'{a}t and T\\'{o}th to $m(n)\\ge \\frac{20}{9}n-\\frac{10}{3}$. In this paper, we confirm that $m(n)=\\left\\lceil\\frac{7}{3}n\\right\\rceil-3$ for all $n\\ge 5$.","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-02-17T11:34:22Z","title":"Determining the minimum size of maximal 1-plane graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11696","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:fcdc8693fe983ef9580abbae6c077e75690cdbce60c2c533805f9cadf0e2a5e6","target":"record","created_at":"2026-07-05T10:15:32Z","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":"45fc2eb90372c8c205dff952bc4444001ae282c44a0d21503d3a294913990dac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T11:34:22Z","title_canon_sha256":"a369faeb22db908f3a44183db0ad46ff43f58c58a3c38691313d5db7e75115f3"},"schema_version":"1.0","source":{"id":"2502.11696","kind":"arxiv","version":1}},"canonical_sha256":"17b413ca535e6005234235c756a552970c7557ca492946a9dcd2bac7cdba5e8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17b413ca535e6005234235c756a552970c7557ca492946a9dcd2bac7cdba5e8f","first_computed_at":"2026-07-05T10:15:32.495969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:32.495969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X4pGilTDkWFov6WpeoajiFyTwlzjrfn44BUi0AvGNjTmWUJCM/NxtiL40thf++OyizxM/o60XpsPdlb341CqCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:32.496554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcdc8693fe983ef9580abbae6c077e75690cdbce60c2c533805f9cadf0e2a5e6","sha256:cf2c5e2e0cc8b01935f764e21fc9514a7bd07c94dc087592ba4653b34c9dbfbc"],"state_sha256":"63d48f54d65e03f1e1f5a32fbfc683a48811e0fc08466a79eb0bd04649a413ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaWM6PK4Q5gi6FVOkBizxGCKEbPZS1qSLu47Q3iLiXvDET3j9JzOb5y7Vnwp88idUDtMh0RvPrkLKAsKsXlqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:44:04.660320Z","bundle_sha256":"15a554c2d8dc9d564aeb247a52fd8cbc32fc3286d1908a7aed4e90565033d013"}}