{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BL2KQQOVSZZGUYIJRCHNTSI6JC","short_pith_number":"pith:BL2KQQOV","canonical_record":{"source":{"id":"1509.05548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"95374c80053e06caf6aa97db2f7071f45fedf3dbef0c18deb680351c3fe33c28","abstract_canon_sha256":"a6c79cd1cd446ca2c13f0d3b5231b5cf662c285447a61703fcf9c63ee2f6baf6"},"schema_version":"1.0"},"canonical_sha256":"0af4a841d596726a6109888ed9c91e48a315cc97c410f7fc8ecf0a74729a68b3","source":{"kind":"arxiv","id":"1509.05548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05548","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05548v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05548","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"BL2KQQOVSZZG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BL2KQQOVSZZGUYIJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BL2KQQOV","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BL2KQQOVSZZGUYIJRCHNTSI6JC","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"95374c80053e06caf6aa97db2f7071f45fedf3dbef0c18deb680351c3fe33c28","abstract_canon_sha256":"a6c79cd1cd446ca2c13f0d3b5231b5cf662c285447a61703fcf9c63ee2f6baf6"},"schema_version":"1.0"},"canonical_sha256":"0af4a841d596726a6109888ed9c91e48a315cc97c410f7fc8ecf0a74729a68b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.869969Z","signature_b64":"F81IkDaMJ7jNZctJDVGWLvBTxB60fYuSCy8NFQgvM+8yHJ/GicE+PLkQAjWF8iccOTkc6vCpjoyOumOpJvjbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af4a841d596726a6109888ed9c91e48a315cc97c410f7fc8ecf0a74729a68b3","last_reissued_at":"2026-05-18T01:32:42.869519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.869519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05548","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-05-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxQaIxlqa1xcXLF06+AmAw9iq4cNgX0VJFRqM05vGnkeUFP8dvw7UfahMrPZdAD3Lf5A0KgLq78J6Gmkx02FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:16:47.069560Z"},"content_sha256":"2c42e9f7efca71cfde8f0337e6aa94b5ca1975f166003cc2232bfd740a6f2fec","schema_version":"1.0","event_id":"sha256:2c42e9f7efca71cfde8f0337e6aa94b5ca1975f166003cc2232bfd740a6f2fec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BL2KQQOVSZZGUYIJRCHNTSI6JC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improvements on the density of maximal 1-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'eza T\\'oth, J\\'anos Bar\\'at","submitted_at":"2015-09-18T08:50:56Z","abstract_excerpt":"A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only $\\frac{45}{17}n + O(1)\\approx 2.647n$ edges and maximal 1-plane graphs with only $\\frac{7}{3}n+O(1)\\approx 2.33n$ edges. On the other hand, they showed that a maximal 1-planar graph has at least $\\frac{28}{13}n-O(1)\\approx 2.15n-O(1)$ edges, and a maximal 1-plane graph has at least $2.1n-O(1)$ edges.\n  We improve both lower bounds to $\\frac{20n}{9}\\approx 2.22n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05548","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"},"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-05-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEO86NSEtKCU8Eftrcao7aPaITyfKulpmf9wRA7b8kW8+XfLr/PeNeUpLHFX2ZxNobk4ZvRGs5katiD0o7wGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:16:47.069900Z"},"content_sha256":"e4bffa21c412d84b1d736ac196b6ff2a6e1675dd986fdf6ba3eb94851fe6d699","schema_version":"1.0","event_id":"sha256:e4bffa21c412d84b1d736ac196b6ff2a6e1675dd986fdf6ba3eb94851fe6d699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC/bundle.json","state_url":"https://pith.science/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC/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-06-02T22:16:47Z","links":{"resolver":"https://pith.science/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC","bundle":"https://pith.science/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC/bundle.json","state":"https://pith.science/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BL2KQQOVSZZGUYIJRCHNTSI6JC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BL2KQQOVSZZGUYIJRCHNTSI6JC","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":"a6c79cd1cd446ca2c13f0d3b5231b5cf662c285447a61703fcf9c63ee2f6baf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:50:56Z","title_canon_sha256":"95374c80053e06caf6aa97db2f7071f45fedf3dbef0c18deb680351c3fe33c28"},"schema_version":"1.0","source":{"id":"1509.05548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05548","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05548v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05548","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"BL2KQQOVSZZG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BL2KQQOVSZZGUYIJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BL2KQQOV","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:e4bffa21c412d84b1d736ac196b6ff2a6e1675dd986fdf6ba3eb94851fe6d699","target":"graph","created_at":"2026-05-18T01:32: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"},"paper":{"abstract_excerpt":"A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only $\\frac{45}{17}n + O(1)\\approx 2.647n$ edges and maximal 1-plane graphs with only $\\frac{7}{3}n+O(1)\\approx 2.33n$ edges. On the other hand, they showed that a maximal 1-planar graph has at least $\\frac{28}{13}n-O(1)\\approx 2.15n-O(1)$ edges, and a maximal 1-plane graph has at least $2.1n-O(1)$ edges.\n  We improve both lower bounds to $\\frac{20n}{9}\\approx 2.22n$.","authors_text":"G\\'eza T\\'oth, J\\'anos Bar\\'at","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:50:56Z","title":"Improvements on the density of maximal 1-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05548","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:2c42e9f7efca71cfde8f0337e6aa94b5ca1975f166003cc2232bfd740a6f2fec","target":"record","created_at":"2026-05-18T01:32: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":"a6c79cd1cd446ca2c13f0d3b5231b5cf662c285447a61703fcf9c63ee2f6baf6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T08:50:56Z","title_canon_sha256":"95374c80053e06caf6aa97db2f7071f45fedf3dbef0c18deb680351c3fe33c28"},"schema_version":"1.0","source":{"id":"1509.05548","kind":"arxiv","version":1}},"canonical_sha256":"0af4a841d596726a6109888ed9c91e48a315cc97c410f7fc8ecf0a74729a68b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0af4a841d596726a6109888ed9c91e48a315cc97c410f7fc8ecf0a74729a68b3","first_computed_at":"2026-05-18T01:32:42.869519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.869519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F81IkDaMJ7jNZctJDVGWLvBTxB60fYuSCy8NFQgvM+8yHJ/GicE+PLkQAjWF8iccOTkc6vCpjoyOumOpJvjbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.869969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c42e9f7efca71cfde8f0337e6aa94b5ca1975f166003cc2232bfd740a6f2fec","sha256:e4bffa21c412d84b1d736ac196b6ff2a6e1675dd986fdf6ba3eb94851fe6d699"],"state_sha256":"73bd5cc32c112188fedb967c09f36fcf02e57d537cd2f914e4a6c80bc4b39dbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ekkff1y4EPI71GzmlH4WIz+44rnofhTcvaSfsXCD3kXJCIcIDtOxZbd5BZfkvoUhvBMIrP+lNoiyyIlw1erbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:16:47.071842Z","bundle_sha256":"2492b1e41416f6034329797e169fbc24eb39439c117f2cefaacc49984e066c1b"}}