{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6HMKMBUIBXXMZPZNXKL3V6JX32","short_pith_number":"pith:6HMKMBUI","canonical_record":{"source":{"id":"1903.02462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-06T16:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"0ea5e06cd380f49beac02d008830c9dcb44e313fc9a85dccdf493b599ac3aabb","abstract_canon_sha256":"f6cbfcda23c90a17070bfe46183de3bea7892e77121338ba4052cff8f528a63f"},"schema_version":"1.0"},"canonical_sha256":"f1d8a606880deeccbf2dba97baf937de853c3aacc7709e9203ccba01383d6407","source":{"kind":"arxiv","id":"1903.02462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02462","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02462v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02462","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"6HMKMBUIBXXM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6HMKMBUIBXXMZPZN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6HMKMBUI","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6HMKMBUIBXXMZPZNXKL3V6JX32","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-06T16:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"0ea5e06cd380f49beac02d008830c9dcb44e313fc9a85dccdf493b599ac3aabb","abstract_canon_sha256":"f6cbfcda23c90a17070bfe46183de3bea7892e77121338ba4052cff8f528a63f"},"schema_version":"1.0"},"canonical_sha256":"f1d8a606880deeccbf2dba97baf937de853c3aacc7709e9203ccba01383d6407","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.261962Z","signature_b64":"vsih6ndZVDhkkb04Ky+ZiGns8DcK8aFci10ymf6hI4uwwhZ0K0COW2ogNOTdUn1BrJ/ZiL/WUSgVXcLQD5FGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1d8a606880deeccbf2dba97baf937de853c3aacc7709e9203ccba01383d6407","last_reissued_at":"2026-05-17T23:51:55.261283Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.261283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02462","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5WO3rk+kYvoSl59KlrqjamCVnHH5pfRuHwOJftyaorKfQLFY8oYlJJ3qarhSQq6N8m/23UuLkJ9aDAmQpZeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:03:27.022243Z"},"content_sha256":"513503f82c0b383704e245ed67372c492644d1adc6ba5d4fa4a265749b468a9a","schema_version":"1.0","event_id":"sha256:513503f82c0b383704e245ed67372c492644d1adc6ba5d4fa4a265749b468a9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6HMKMBUIBXXMZPZNXKL3V6JX32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dominating maximal outerplane graphs and Hamiltonian plane triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Ye, Michael D. Plummer, Xiaoya Zha","submitted_at":"2019-03-06T16:07:24Z","abstract_excerpt":"Let $G$ be a graph and $\\gamma (G)$ denote the domination number of $G$, i.e. the cardinality of a smallest set of vertices $S$ such that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. Matheson and Tarjan conjectured that a plane triangulation with a sufficiently large number $n$ of vertices has $\\gamma(G)\\le n/4$. Their conjecture remains unsettled. In the present paper, we show that: (1) a maximal outerplane graph with $n$ vertices has $\\gamma(G)\\le \\lceil \\frac{n+k} 4\\rceil$ where $k$ is the number of pairs of consecutive degree 2 vertices separated by distance at leas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02462","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:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPVUqba+vT1ZDTpJW7vj0EUKF6Y2ylegYeeclBV5jzkzcgneM5E4m7pG4ipsL8D0w8DxLgcE3a6zN7UrsnDiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:03:27.022608Z"},"content_sha256":"6da20fec12e260164fd733475b9f65afb04134a72214cb1753f629e770e342c2","schema_version":"1.0","event_id":"sha256:6da20fec12e260164fd733475b9f65afb04134a72214cb1753f629e770e342c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HMKMBUIBXXMZPZNXKL3V6JX32/bundle.json","state_url":"https://pith.science/pith/6HMKMBUIBXXMZPZNXKL3V6JX32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HMKMBUIBXXMZPZNXKL3V6JX32/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-24T22:03:27Z","links":{"resolver":"https://pith.science/pith/6HMKMBUIBXXMZPZNXKL3V6JX32","bundle":"https://pith.science/pith/6HMKMBUIBXXMZPZNXKL3V6JX32/bundle.json","state":"https://pith.science/pith/6HMKMBUIBXXMZPZNXKL3V6JX32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HMKMBUIBXXMZPZNXKL3V6JX32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6HMKMBUIBXXMZPZNXKL3V6JX32","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":"f6cbfcda23c90a17070bfe46183de3bea7892e77121338ba4052cff8f528a63f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-06T16:07:24Z","title_canon_sha256":"0ea5e06cd380f49beac02d008830c9dcb44e313fc9a85dccdf493b599ac3aabb"},"schema_version":"1.0","source":{"id":"1903.02462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02462","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02462v1","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02462","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"6HMKMBUIBXXM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6HMKMBUIBXXMZPZN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6HMKMBUI","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6da20fec12e260164fd733475b9f65afb04134a72214cb1753f629e770e342c2","target":"graph","created_at":"2026-05-17T23:51:55Z","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":"Let $G$ be a graph and $\\gamma (G)$ denote the domination number of $G$, i.e. the cardinality of a smallest set of vertices $S$ such that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. Matheson and Tarjan conjectured that a plane triangulation with a sufficiently large number $n$ of vertices has $\\gamma(G)\\le n/4$. Their conjecture remains unsettled. In the present paper, we show that: (1) a maximal outerplane graph with $n$ vertices has $\\gamma(G)\\le \\lceil \\frac{n+k} 4\\rceil$ where $k$ is the number of pairs of consecutive degree 2 vertices separated by distance at leas","authors_text":"Dong Ye, Michael D. Plummer, Xiaoya Zha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-06T16:07:24Z","title":"Dominating maximal outerplane graphs and Hamiltonian plane triangulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02462","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:513503f82c0b383704e245ed67372c492644d1adc6ba5d4fa4a265749b468a9a","target":"record","created_at":"2026-05-17T23:51:55Z","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":"f6cbfcda23c90a17070bfe46183de3bea7892e77121338ba4052cff8f528a63f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-06T16:07:24Z","title_canon_sha256":"0ea5e06cd380f49beac02d008830c9dcb44e313fc9a85dccdf493b599ac3aabb"},"schema_version":"1.0","source":{"id":"1903.02462","kind":"arxiv","version":1}},"canonical_sha256":"f1d8a606880deeccbf2dba97baf937de853c3aacc7709e9203ccba01383d6407","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1d8a606880deeccbf2dba97baf937de853c3aacc7709e9203ccba01383d6407","first_computed_at":"2026-05-17T23:51:55.261283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.261283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vsih6ndZVDhkkb04Ky+ZiGns8DcK8aFci10ymf6hI4uwwhZ0K0COW2ogNOTdUn1BrJ/ZiL/WUSgVXcLQD5FGCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.261962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:513503f82c0b383704e245ed67372c492644d1adc6ba5d4fa4a265749b468a9a","sha256:6da20fec12e260164fd733475b9f65afb04134a72214cb1753f629e770e342c2"],"state_sha256":"a62f3ed6b8489f8778b4918341a29a019e9b2170530a41b18e1ea9d5b49ea5d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdtRwfhvJsL74tRMS6Hj39GaO5GtxVnnQyeRBPLPfexs7L06TPD+X0A2vEDGyQSKByZHBjuSqLltVp5MTpCMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:03:27.024478Z","bundle_sha256":"cf8d2841d61c78c2b8cd7a9e35adbb8df6916d0ed276708355d64def6016b977"}}