{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MXUOK4QXJL2RHRTCKWSJDQQ57S","short_pith_number":"pith:MXUOK4QX","canonical_record":{"source":{"id":"1907.09817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T11:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"3ab5c3e25ad322b327187607ddb7ef11ead295bcba57d648f95023c188424ab4","abstract_canon_sha256":"dc002c611f93dc9424f6bdd78861c900f19de08b93fa83d9394a3a025ebb45f7"},"schema_version":"1.0"},"canonical_sha256":"65e8e572174af513c66255a491c21dfc905fb6dc36b2d40f0d49fda6a2b125bf","source":{"kind":"arxiv","id":"1907.09817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09817","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09817v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09817","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"MXUOK4QXJL2R","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MXUOK4QXJL2RHRTC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MXUOK4QX","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MXUOK4QXJL2RHRTCKWSJDQQ57S","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T11:15:45Z","cross_cats_sorted":[],"title_canon_sha256":"3ab5c3e25ad322b327187607ddb7ef11ead295bcba57d648f95023c188424ab4","abstract_canon_sha256":"dc002c611f93dc9424f6bdd78861c900f19de08b93fa83d9394a3a025ebb45f7"},"schema_version":"1.0"},"canonical_sha256":"65e8e572174af513c66255a491c21dfc905fb6dc36b2d40f0d49fda6a2b125bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.966695Z","signature_b64":"8JbtHlcu2ktjPlLdMyfdvSRAr/cGdnXJ9REzKn64Mk5DZzi8aTGDL+dSKjVqY83p6YVlI8w63K4zQk1d1D9zBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e8e572174af513c66255a491c21dfc905fb6dc36b2d40f0d49fda6a2b125bf","last_reissued_at":"2026-05-17T23:39:49.966009Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.966009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09817","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-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OevIADZ0IrBp7kKJCBSfhMxbyyMJVVaWHmy16EEqVpwdmPm0vSPCpd7vYuj9KJRO/Zt5rHqIkiAacAjXrOHrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:36:02.763908Z"},"content_sha256":"047d1fbb2ab4ada1f56cae84504c2675845b7e71235d12a8f71edcf4746658fb","schema_version":"1.0","event_id":"sha256:047d1fbb2ab4ada1f56cae84504c2675845b7e71235d12a8f71edcf4746658fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MXUOK4QXJL2RHRTCKWSJDQQ57S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-separating Planar Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Graham Farr, Hooman R. Dehkordi","submitted_at":"2019-07-23T11:15:45Z","abstract_excerpt":"A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.\n  Non-separating planar graphs are closed under taking minors and are a subclass of planar graphs and a superclass of outerplanar graphs.\n  In this paper, we show that a graph is a non-separating planar graph if and only if it does not contain $K_1 \\cup K_4$ or $K_1 \\cup K_{2,3}$ or $K_{1,1,3}$ as a minor.\n  Furthermore, we provide a structural characterisat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09817","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-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MVKgB6ymZ9n802cc7BxwQWOkRSwgr0E0BiaOtJpb0gbdJey0VIDzRvadTKY42kB10AXuYaGGKSQhZ1dZYgc7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:36:02.764265Z"},"content_sha256":"2a3c75447b8c11971b0a96b879ac167d7063cdccfb436665e20f3fd61f1e3406","schema_version":"1.0","event_id":"sha256:2a3c75447b8c11971b0a96b879ac167d7063cdccfb436665e20f3fd61f1e3406"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S/bundle.json","state_url":"https://pith.science/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S/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-07-03T08:36:02Z","links":{"resolver":"https://pith.science/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S","bundle":"https://pith.science/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S/bundle.json","state":"https://pith.science/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXUOK4QXJL2RHRTCKWSJDQQ57S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MXUOK4QXJL2RHRTCKWSJDQQ57S","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":"dc002c611f93dc9424f6bdd78861c900f19de08b93fa83d9394a3a025ebb45f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T11:15:45Z","title_canon_sha256":"3ab5c3e25ad322b327187607ddb7ef11ead295bcba57d648f95023c188424ab4"},"schema_version":"1.0","source":{"id":"1907.09817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09817","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09817v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09817","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"MXUOK4QXJL2R","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MXUOK4QXJL2RHRTC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MXUOK4QX","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2a3c75447b8c11971b0a96b879ac167d7063cdccfb436665e20f3fd61f1e3406","target":"graph","created_at":"2026-05-17T23:39:49Z","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$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.\n  Non-separating planar graphs are closed under taking minors and are a subclass of planar graphs and a superclass of outerplanar graphs.\n  In this paper, we show that a graph is a non-separating planar graph if and only if it does not contain $K_1 \\cup K_4$ or $K_1 \\cup K_{2,3}$ or $K_{1,1,3}$ as a minor.\n  Furthermore, we provide a structural characterisat","authors_text":"Graham Farr, Hooman R. Dehkordi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T11:15:45Z","title":"Non-separating Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09817","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:047d1fbb2ab4ada1f56cae84504c2675845b7e71235d12a8f71edcf4746658fb","target":"record","created_at":"2026-05-17T23:39:49Z","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":"dc002c611f93dc9424f6bdd78861c900f19de08b93fa83d9394a3a025ebb45f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-23T11:15:45Z","title_canon_sha256":"3ab5c3e25ad322b327187607ddb7ef11ead295bcba57d648f95023c188424ab4"},"schema_version":"1.0","source":{"id":"1907.09817","kind":"arxiv","version":1}},"canonical_sha256":"65e8e572174af513c66255a491c21dfc905fb6dc36b2d40f0d49fda6a2b125bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65e8e572174af513c66255a491c21dfc905fb6dc36b2d40f0d49fda6a2b125bf","first_computed_at":"2026-05-17T23:39:49.966009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:49.966009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8JbtHlcu2ktjPlLdMyfdvSRAr/cGdnXJ9REzKn64Mk5DZzi8aTGDL+dSKjVqY83p6YVlI8w63K4zQk1d1D9zBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:49.966695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:047d1fbb2ab4ada1f56cae84504c2675845b7e71235d12a8f71edcf4746658fb","sha256:2a3c75447b8c11971b0a96b879ac167d7063cdccfb436665e20f3fd61f1e3406"],"state_sha256":"0068d2be5574bd4eab2c21dd5fb319b5d4f3378423c56a1dd89ac75db39b260b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXGvI4Fc3GYgUIGttGkqsk7XtGuxdD4RaPiSx55iHWvTb2RQzrrvHsD/ltWKjKLcHQsovhrknLHjrlP1bVqXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T08:36:02.766233Z","bundle_sha256":"d3e2691d65876cf7f5c8ca197cfbd966851d0e933ce63a2fbce2df6502b166e2"}}