{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XHKJVV667D4SQN6JIZ7RHEYUKL","short_pith_number":"pith:XHKJVV66","canonical_record":{"source":{"id":"1908.05072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:14:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e96fa6b38bc5cd1083872d5e6e8f75c452eefa8b07b7447a96ea1b20daa9cb29","abstract_canon_sha256":"4807a265c56abe2437ff8dfa24105e190d5b5854231c15dc4f1e48abb3039f5c"},"schema_version":"1.0"},"canonical_sha256":"b9d49ad7def8f92837c9467f13931452c83dc5a38bd06326b2eeae7ee154a82e","source":{"kind":"arxiv","id":"1908.05072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05072","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05072v2","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05072","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"XHKJVV667D4S","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"XHKJVV667D4SQN6J","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"XHKJVV66","created_at":"2026-07-05T00:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XHKJVV667D4SQN6JIZ7RHEYUKL","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:14:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e96fa6b38bc5cd1083872d5e6e8f75c452eefa8b07b7447a96ea1b20daa9cb29","abstract_canon_sha256":"4807a265c56abe2437ff8dfa24105e190d5b5854231c15dc4f1e48abb3039f5c"},"schema_version":"1.0"},"canonical_sha256":"b9d49ad7def8f92837c9467f13931452c83dc5a38bd06326b2eeae7ee154a82e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:09.864404Z","signature_b64":"KvdgEA77oG2pKQQK/K01Nd7jXAe5y4oJxgF6ooaR31YXMz8n5l4rcHemO7FZS+onfUVTIkXV7YSKPPtXLQxFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9d49ad7def8f92837c9467f13931452c83dc5a38bd06326b2eeae7ee154a82e","last_reissued_at":"2026-07-05T00:26:09.863908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:09.863908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05072","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-07-05T00:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrbjhzjkSJeWE8++D9XCYpB3gyfciBnRrwIDl2LlCUzvYksG1idJLW7co1L1AefzB0HFkGzq1QCRzGcflkhDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:47:37.323907Z"},"content_sha256":"477a3da49570b860089b477229ed5a818a48bc683587d01416f3508d69a43c08","schema_version":"1.0","event_id":"sha256:477a3da49570b860089b477229ed5a818a48bc683587d01416f3508d69a43c08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XHKJVV667D4SQN6JIZ7RHEYUKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Light edges in 1-planar graphs of minimum degree 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bei Niu, Xin Zhang","submitted_at":"2019-08-14T11:14:49Z","abstract_excerpt":"A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of type $(3,\\leq23)$ or $(4,\\leq11)$ or $(5,\\leq9)$ or $(6,\\leq8)$ or $(7,7)$. Moreover, the upper bounds $9,8$ and $7$ here are sharp and the upper bounds $23$ and $11$ are very close to the possible sharp ones, which may be 20 and 10, respectively. This generalizes a result of Fabrici and Madaras [Discrete Math., 307 (2007) 854--865] which says that each 3-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05072","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05072/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-05T00:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGohCdxRBw8OVIyGOAEuW0MJ0wvNiMCFRj+bMxAgp/jPmxSDL0FolEHs6Dr3aAqNRaVfxp2iThudQ0d/fbOeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:47:37.324409Z"},"content_sha256":"6230bedbb97fc07ba572e487046b6756c36c8970290a14cf95760371e09ac744","schema_version":"1.0","event_id":"sha256:6230bedbb97fc07ba572e487046b6756c36c8970290a14cf95760371e09ac744"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHKJVV667D4SQN6JIZ7RHEYUKL/bundle.json","state_url":"https://pith.science/pith/XHKJVV667D4SQN6JIZ7RHEYUKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHKJVV667D4SQN6JIZ7RHEYUKL/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-22T01:47:37Z","links":{"resolver":"https://pith.science/pith/XHKJVV667D4SQN6JIZ7RHEYUKL","bundle":"https://pith.science/pith/XHKJVV667D4SQN6JIZ7RHEYUKL/bundle.json","state":"https://pith.science/pith/XHKJVV667D4SQN6JIZ7RHEYUKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHKJVV667D4SQN6JIZ7RHEYUKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XHKJVV667D4SQN6JIZ7RHEYUKL","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":"4807a265c56abe2437ff8dfa24105e190d5b5854231c15dc4f1e48abb3039f5c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:14:49Z","title_canon_sha256":"e96fa6b38bc5cd1083872d5e6e8f75c452eefa8b07b7447a96ea1b20daa9cb29"},"schema_version":"1.0","source":{"id":"1908.05072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05072","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05072v2","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05072","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"XHKJVV667D4S","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"XHKJVV667D4SQN6J","created_at":"2026-07-05T00:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"XHKJVV66","created_at":"2026-07-05T00:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:6230bedbb97fc07ba572e487046b6756c36c8970290a14cf95760371e09ac744","target":"graph","created_at":"2026-07-05T00:26:09Z","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/1908.05072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of type $(3,\\leq23)$ or $(4,\\leq11)$ or $(5,\\leq9)$ or $(6,\\leq8)$ or $(7,7)$. Moreover, the upper bounds $9,8$ and $7$ here are sharp and the upper bounds $23$ and $11$ are very close to the possible sharp ones, which may be 20 and 10, respectively. This generalizes a result of Fabrici and Madaras [Discrete Math., 307 (2007) 854--865] which says that each 3-co","authors_text":"Bei Niu, Xin Zhang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:14:49Z","title":"Light edges in 1-planar graphs of minimum degree 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05072","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:477a3da49570b860089b477229ed5a818a48bc683587d01416f3508d69a43c08","target":"record","created_at":"2026-07-05T00:26:09Z","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":"4807a265c56abe2437ff8dfa24105e190d5b5854231c15dc4f1e48abb3039f5c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T11:14:49Z","title_canon_sha256":"e96fa6b38bc5cd1083872d5e6e8f75c452eefa8b07b7447a96ea1b20daa9cb29"},"schema_version":"1.0","source":{"id":"1908.05072","kind":"arxiv","version":2}},"canonical_sha256":"b9d49ad7def8f92837c9467f13931452c83dc5a38bd06326b2eeae7ee154a82e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9d49ad7def8f92837c9467f13931452c83dc5a38bd06326b2eeae7ee154a82e","first_computed_at":"2026-07-05T00:26:09.863908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:09.863908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvdgEA77oG2pKQQK/K01Nd7jXAe5y4oJxgF6ooaR31YXMz8n5l4rcHemO7FZS+onfUVTIkXV7YSKPPtXLQxFBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:09.864404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:477a3da49570b860089b477229ed5a818a48bc683587d01416f3508d69a43c08","sha256:6230bedbb97fc07ba572e487046b6756c36c8970290a14cf95760371e09ac744"],"state_sha256":"6f2d930f3c7ad997e0271336695ad2d613a2b0c15482352da50ac670150cc886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V96pn8e0G826wtfRYQJ0WH73tsMxPTvIs8hcyI1LrA/+doNANhU8u28HP5xb1A0F1/JyL9nrZfWNonKjg5RyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T01:47:37.327855Z","bundle_sha256":"1bee42b297cca191d2c99de769322069169a862f5b112894e6e65c8ec6c9b049"}}