{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VSZWXNAA3ZLJHLM6I3D4RAOYJN","short_pith_number":"pith:VSZWXNAA","canonical_record":{"source":{"id":"1511.08713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T15:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"02e2846fb611a0d8050f3b542c4ae45437bbce65c809f3e8d911198368829ce5","abstract_canon_sha256":"1bb48bb06804090e6b3290f649d9f200f39aff676d0fd89446f60e41dace3c0c"},"schema_version":"1.0"},"canonical_sha256":"acb36bb400de5693ad9e46c7c881d84b6423eb23c4156e8318068825a0460317","source":{"kind":"arxiv","id":"1511.08713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08713","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08713v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08713","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"VSZWXNAA3ZLJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VSZWXNAA3ZLJHLM6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VSZWXNAA","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VSZWXNAA3ZLJHLM6I3D4RAOYJN","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T15:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"02e2846fb611a0d8050f3b542c4ae45437bbce65c809f3e8d911198368829ce5","abstract_canon_sha256":"1bb48bb06804090e6b3290f649d9f200f39aff676d0fd89446f60e41dace3c0c"},"schema_version":"1.0"},"canonical_sha256":"acb36bb400de5693ad9e46c7c881d84b6423eb23c4156e8318068825a0460317","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:48.253447Z","signature_b64":"w/sY820gkqMT9aBpfVT4fYqWTEH9eQGrhNfMTIdJka3OF29EaeQIOSJTMxwvm1xQobm8J/qb1vsOAnNZwfLsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acb36bb400de5693ad9e46c7c881d84b6423eb23c4156e8318068825a0460317","last_reissued_at":"2026-05-18T01:25:48.252942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:48.252942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08713","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:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycHsbWhd4ijqsWFN46u14hfsJv6LJvj2+7ECowjuQevzsP3VAAYkg3fDFyJSAE7Sjg8QcrlXgSi4KoPmmfL1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:57:58.876161Z"},"content_sha256":"501a20c8c6a62d1ea996e7353d32f87dedfb3da15aaa7ace64651b8446276db0","schema_version":"1.0","event_id":"sha256:501a20c8c6a62d1ea996e7353d32f87dedfb3da15aaa7ace64651b8446276db0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VSZWXNAA3ZLJHLM6I3D4RAOYJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dominating Sets inducing Large Components in Maximal Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Jos\\'e D. Alvarado, Simone Dantas","submitted_at":"2015-11-27T15:46:00Z","abstract_excerpt":"For a maximal outerplanar graph $G$ of order $n$ at least $3$, Matheson and Tarjan showed that $G$ has domination number at most $n/3$. Similarly, for a maximal outerplanar graph $G$ of order $n$ at least $5$, Dorfling, Hattingh, and Jonck showed, by a completely different approach, that $G$ has total domination number at most $2n/5$ unless $G$ is isomorphic to one of two exceptional graphs of order $12$.\n  We present a unified proof of a common generalization of these two results. For every positive integer $k$, we specify a set ${\\cal H}_k$ of graphs of order at least $4k+4$ and at most $4k^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08713","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:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7FtepBv1TFejd1twMrVZbapUJCSaVgYnGFLxfSQd2F3xPBB2hsVXgDSXNCjV4S9k0XZZkI0RMWM9TZ12GAlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:57:58.876515Z"},"content_sha256":"c32f61bacbb42179f554445811e48955e9aba0e7e29df3e83626cdad846c4bae","schema_version":"1.0","event_id":"sha256:c32f61bacbb42179f554445811e48955e9aba0e7e29df3e83626cdad846c4bae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN/bundle.json","state_url":"https://pith.science/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN/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-24T04:57:58Z","links":{"resolver":"https://pith.science/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN","bundle":"https://pith.science/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN/bundle.json","state":"https://pith.science/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSZWXNAA3ZLJHLM6I3D4RAOYJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VSZWXNAA3ZLJHLM6I3D4RAOYJN","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":"1bb48bb06804090e6b3290f649d9f200f39aff676d0fd89446f60e41dace3c0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T15:46:00Z","title_canon_sha256":"02e2846fb611a0d8050f3b542c4ae45437bbce65c809f3e8d911198368829ce5"},"schema_version":"1.0","source":{"id":"1511.08713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08713","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08713v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08713","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"VSZWXNAA3ZLJ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VSZWXNAA3ZLJHLM6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VSZWXNAA","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:c32f61bacbb42179f554445811e48955e9aba0e7e29df3e83626cdad846c4bae","target":"graph","created_at":"2026-05-18T01:25:48Z","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":"For a maximal outerplanar graph $G$ of order $n$ at least $3$, Matheson and Tarjan showed that $G$ has domination number at most $n/3$. Similarly, for a maximal outerplanar graph $G$ of order $n$ at least $5$, Dorfling, Hattingh, and Jonck showed, by a completely different approach, that $G$ has total domination number at most $2n/5$ unless $G$ is isomorphic to one of two exceptional graphs of order $12$.\n  We present a unified proof of a common generalization of these two results. For every positive integer $k$, we specify a set ${\\cal H}_k$ of graphs of order at least $4k+4$ and at most $4k^","authors_text":"Dieter Rautenbach, Jos\\'e D. Alvarado, Simone Dantas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T15:46:00Z","title":"Dominating Sets inducing Large Components in Maximal Outerplanar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08713","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:501a20c8c6a62d1ea996e7353d32f87dedfb3da15aaa7ace64651b8446276db0","target":"record","created_at":"2026-05-18T01:25:48Z","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":"1bb48bb06804090e6b3290f649d9f200f39aff676d0fd89446f60e41dace3c0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-27T15:46:00Z","title_canon_sha256":"02e2846fb611a0d8050f3b542c4ae45437bbce65c809f3e8d911198368829ce5"},"schema_version":"1.0","source":{"id":"1511.08713","kind":"arxiv","version":1}},"canonical_sha256":"acb36bb400de5693ad9e46c7c881d84b6423eb23c4156e8318068825a0460317","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acb36bb400de5693ad9e46c7c881d84b6423eb23c4156e8318068825a0460317","first_computed_at":"2026-05-18T01:25:48.252942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:48.252942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w/sY820gkqMT9aBpfVT4fYqWTEH9eQGrhNfMTIdJka3OF29EaeQIOSJTMxwvm1xQobm8J/qb1vsOAnNZwfLsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:48.253447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:501a20c8c6a62d1ea996e7353d32f87dedfb3da15aaa7ace64651b8446276db0","sha256:c32f61bacbb42179f554445811e48955e9aba0e7e29df3e83626cdad846c4bae"],"state_sha256":"669cb9d7c033e1b8f53633c308ba43272b6910b96693d0a4f889a2cd712603b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+2CRI+V4xdQfxDTKS5SX8VG3RDNaQT0v0jdWLd1dPJWNMf6OHDWhgxOq9ZUV0xQr5dROycHOZtXZJcNK1qJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:57:58.878680Z","bundle_sha256":"6a55dbd3125c7e77b1b47dad93ce9baa2321756472abcf849c9dec36281f390f"}}