{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:65Q37H2WJF3A2PMW7H2GDYL423","short_pith_number":"pith:65Q37H2W","schema_version":"1.0","canonical_sha256":"f761bf9f5649760d3d96f9f461e17cd6cc28f5c728eec9c9f0af763deb533c96","source":{"kind":"arxiv","id":"1806.06932","version":1},"attestation_state":"computed","paper":{"title":"The domination number of plane triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Simon Spacapan","submitted_at":"2018-06-18T20:44:10Z","abstract_excerpt":"We introduce a class of plane graphs called weak near-triangulations, and prove that this class is closed under certain graph operations. Then we use the properties of weak near-triangulations to prove that every plane triangulation on $n>6$ vertices has a dominating set of size at most $17n/53$. This improves the bound $n/3$ obtained by Matheson and Tarjan."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.06932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T20:44:10Z","cross_cats_sorted":[],"title_canon_sha256":"456e72bbf9ecce18d11f5908ba3f1518e476849efb382b9ae9bbc44460e72215","abstract_canon_sha256":"dc9c3159dad0457b652bcb61b4f1b141026bcb027f339456aa464f2539dc53c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:58.022187Z","signature_b64":"84I7mssD8mIkn82kSS1COSUbViadPTl4VXmqoO5iVxn+kaXkoSlOie2l0iROAvvxiuzzmHBfdb/vmCDvOmqPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f761bf9f5649760d3d96f9f461e17cd6cc28f5c728eec9c9f0af763deb533c96","last_reissued_at":"2026-05-18T00:12:58.021474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:58.021474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The domination number of plane triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Simon Spacapan","submitted_at":"2018-06-18T20:44:10Z","abstract_excerpt":"We introduce a class of plane graphs called weak near-triangulations, and prove that this class is closed under certain graph operations. Then we use the properties of weak near-triangulations to prove that every plane triangulation on $n>6$ vertices has a dominating set of size at most $17n/53$. This improves the bound $n/3$ obtained by Matheson and Tarjan."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06932","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.06932","created_at":"2026-05-18T00:12:58.021580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06932v1","created_at":"2026-05-18T00:12:58.021580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06932","created_at":"2026-05-18T00:12:58.021580+00:00"},{"alias_kind":"pith_short_12","alias_value":"65Q37H2WJF3A","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"65Q37H2WJF3A2PMW","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"65Q37H2W","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423","json":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423.json","graph_json":"https://pith.science/api/pith-number/65Q37H2WJF3A2PMW7H2GDYL423/graph.json","events_json":"https://pith.science/api/pith-number/65Q37H2WJF3A2PMW7H2GDYL423/events.json","paper":"https://pith.science/paper/65Q37H2W"},"agent_actions":{"view_html":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423","download_json":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423.json","view_paper":"https://pith.science/paper/65Q37H2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06932&json=true","fetch_graph":"https://pith.science/api/pith-number/65Q37H2WJF3A2PMW7H2GDYL423/graph.json","fetch_events":"https://pith.science/api/pith-number/65Q37H2WJF3A2PMW7H2GDYL423/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423/action/storage_attestation","attest_author":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423/action/author_attestation","sign_citation":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423/action/citation_signature","submit_replication":"https://pith.science/pith/65Q37H2WJF3A2PMW7H2GDYL423/action/replication_record"}},"created_at":"2026-05-18T00:12:58.021580+00:00","updated_at":"2026-05-18T00:12:58.021580+00:00"}