{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LPHQINQM7MHKLUGX7G6NPUPAU6","short_pith_number":"pith:LPHQINQM","canonical_record":{"source":{"id":"1501.00176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T17:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"f0651becdaa5e0cd8560cf2e3a24be3db7fadae314f22e0d95e94019cdf64077","abstract_canon_sha256":"b1a3fecb9b873fae72e46a2f6c74bdb28734eb633e1d56f40ab31b6138b042b0"},"schema_version":"1.0"},"canonical_sha256":"5bcf04360cfb0ea5d0d7f9bcd7d1e0a7851ddf2bf24e36de7716a273cbd6c077","source":{"kind":"arxiv","id":"1501.00176","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00176","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00176v2","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00176","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"LPHQINQM7MHK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LPHQINQM7MHKLUGX","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LPHQINQM","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LPHQINQM7MHKLUGX7G6NPUPAU6","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T17:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"f0651becdaa5e0cd8560cf2e3a24be3db7fadae314f22e0d95e94019cdf64077","abstract_canon_sha256":"b1a3fecb9b873fae72e46a2f6c74bdb28734eb633e1d56f40ab31b6138b042b0"},"schema_version":"1.0"},"canonical_sha256":"5bcf04360cfb0ea5d0d7f9bcd7d1e0a7851ddf2bf24e36de7716a273cbd6c077","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:40.017100Z","signature_b64":"xuUx1LqOqKuZ0+XXJrcTex3EX7R/40PeQ2M/kI66vssI0L3L/E274gI1TBW82l4WWktpG1AWCSAE+2B9IaTPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bcf04360cfb0ea5d0d7f9bcd7d1e0a7851ddf2bf24e36de7716a273cbd6c077","last_reissued_at":"2026-05-18T02:25:40.016585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:40.016585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00176","source_version":2,"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-18T02:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrRhmXGAd+gUh+vOd+xyAnEKh5r2voTPatJc0QWOpME9vcNdlnkNJgTvoy/IYt2AQi8aBFRklv7LslXsKrfTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:43.653295Z"},"content_sha256":"8481ea680bfc05dcf4e90804c6def6ac37aa5a881b2f48180bd89e9dfaceca78","schema_version":"1.0","event_id":"sha256:8481ea680bfc05dcf4e90804c6def6ac37aa5a881b2f48180bd89e9dfaceca78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LPHQINQM7MHKLUGX7G6NPUPAU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On an extremal problem in the class of 1-planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erika \\v{S}krabu\\v{l}\\'akov\\'a, Jakub Przyby{\\l}o, J\\'ulius Czap","submitted_at":"2014-12-31T17:30:38Z","abstract_excerpt":"A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most $3n-8$ edges, where $n$ denotes the order of a graph. We show that maximal-size bipartite $1$-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same is not true for unbalanced ones. We prove that maximal possible sizes of bipartite $1$-planar graphs whos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00176","kind":"arxiv","version":2},"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-18T02:25:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqpBAyvYfCe7TOTcS/Tvm8AHfqj4gMP37CXZI0xK7TERomS4w3f+fir0uj1isi5Dm4mnVwQz9L+OSGtccWPdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:43.654035Z"},"content_sha256":"23b7120e0102c9d7291a4c5d221131c107ca72263ca8c42056835893a281e975","schema_version":"1.0","event_id":"sha256:23b7120e0102c9d7291a4c5d221131c107ca72263ca8c42056835893a281e975"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPHQINQM7MHKLUGX7G6NPUPAU6/bundle.json","state_url":"https://pith.science/pith/LPHQINQM7MHKLUGX7G6NPUPAU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPHQINQM7MHKLUGX7G6NPUPAU6/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-05-30T20:03:43Z","links":{"resolver":"https://pith.science/pith/LPHQINQM7MHKLUGX7G6NPUPAU6","bundle":"https://pith.science/pith/LPHQINQM7MHKLUGX7G6NPUPAU6/bundle.json","state":"https://pith.science/pith/LPHQINQM7MHKLUGX7G6NPUPAU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPHQINQM7MHKLUGX7G6NPUPAU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LPHQINQM7MHKLUGX7G6NPUPAU6","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":"b1a3fecb9b873fae72e46a2f6c74bdb28734eb633e1d56f40ab31b6138b042b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T17:30:38Z","title_canon_sha256":"f0651becdaa5e0cd8560cf2e3a24be3db7fadae314f22e0d95e94019cdf64077"},"schema_version":"1.0","source":{"id":"1501.00176","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00176","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00176v2","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00176","created_at":"2026-05-18T02:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"LPHQINQM7MHK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LPHQINQM7MHKLUGX","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LPHQINQM","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:23b7120e0102c9d7291a4c5d221131c107ca72263ca8c42056835893a281e975","target":"graph","created_at":"2026-05-18T02:25:40Z","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 $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most $3n-8$ edges, where $n$ denotes the order of a graph. We show that maximal-size bipartite $1$-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same is not true for unbalanced ones. We prove that maximal possible sizes of bipartite $1$-planar graphs whos","authors_text":"Erika \\v{S}krabu\\v{l}\\'akov\\'a, Jakub Przyby{\\l}o, J\\'ulius Czap","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T17:30:38Z","title":"On an extremal problem in the class of 1-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00176","kind":"arxiv","version":2},"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:8481ea680bfc05dcf4e90804c6def6ac37aa5a881b2f48180bd89e9dfaceca78","target":"record","created_at":"2026-05-18T02:25:40Z","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":"b1a3fecb9b873fae72e46a2f6c74bdb28734eb633e1d56f40ab31b6138b042b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T17:30:38Z","title_canon_sha256":"f0651becdaa5e0cd8560cf2e3a24be3db7fadae314f22e0d95e94019cdf64077"},"schema_version":"1.0","source":{"id":"1501.00176","kind":"arxiv","version":2}},"canonical_sha256":"5bcf04360cfb0ea5d0d7f9bcd7d1e0a7851ddf2bf24e36de7716a273cbd6c077","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bcf04360cfb0ea5d0d7f9bcd7d1e0a7851ddf2bf24e36de7716a273cbd6c077","first_computed_at":"2026-05-18T02:25:40.016585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:40.016585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xuUx1LqOqKuZ0+XXJrcTex3EX7R/40PeQ2M/kI66vssI0L3L/E274gI1TBW82l4WWktpG1AWCSAE+2B9IaTPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:40.017100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00176","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8481ea680bfc05dcf4e90804c6def6ac37aa5a881b2f48180bd89e9dfaceca78","sha256:23b7120e0102c9d7291a4c5d221131c107ca72263ca8c42056835893a281e975"],"state_sha256":"4c58cc42759ed72b7f96da27d97f3161fc3b674631347aebbce3aa5f5b3ef525"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yl30Kep5S8nMPlv/ywKjKtE79M4R5aZZisthV8p+y9SaTGtjcYYi2EFxOaMzOgQCHd2QvjJWUV04cctbZiDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:43.657700Z","bundle_sha256":"6f5154fbac82e2bc61628f09067cb171a59aec05ba226a673f7d21f37a9c8a62"}}