{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U3ONUGBTR6EYHRDOADYS7YVPZV","short_pith_number":"pith:U3ONUGBT","schema_version":"1.0","canonical_sha256":"a6dcda18338f8983c46e00f12fe2afcd6aca36a443f18e3466c9ea970797104d","source":{"kind":"arxiv","id":"1608.02154","version":1},"attestation_state":"computed","paper":{"title":"A characterization of domination weak bicritical graphs with large diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michitaka Furuya","submitted_at":"2016-08-06T20:55:14Z","abstract_excerpt":"The domination number of a graph $G$, denoted by $\\gamma (G)$, is the minimum cardinality of a dominating set of $G$. A vertex of a graph is called critical if its deletion decreases the domination number, and a graph is called critical if its all vertices are critical. A graph $G$ is called weak bicritical if for every non-critical vertex $x\\in V(G)$, $G-x$ is a critical graph with $\\gamma (G-x)=\\gamma (G)$. In this paper, we characterize the connected weak bicritical graphs $G$ whose diameter is exactly $2\\gamma (G)-2$. This is a generalization of some known results concerning the diameter o"},"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":"1608.02154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T20:55:14Z","cross_cats_sorted":[],"title_canon_sha256":"b3c0104ba7a743f0ffda13ad06710a75d17367ef606d9f1431617bda1e644d51","abstract_canon_sha256":"5d825716f3d4c7424a65e1b24a322ce72232ee8e4d25662d9636bc25187876ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:40.894751Z","signature_b64":"bUU6GP61EScxbbIlYn7f6QaKzxwWUCbg6kDx9WpY1CvYdPI3Tc2GFihK9lyRin7/JwSCRLErzm02EstrQjuNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6dcda18338f8983c46e00f12fe2afcd6aca36a443f18e3466c9ea970797104d","last_reissued_at":"2026-05-18T01:09:40.894229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:40.894229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A characterization of domination weak bicritical graphs with large diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michitaka Furuya","submitted_at":"2016-08-06T20:55:14Z","abstract_excerpt":"The domination number of a graph $G$, denoted by $\\gamma (G)$, is the minimum cardinality of a dominating set of $G$. A vertex of a graph is called critical if its deletion decreases the domination number, and a graph is called critical if its all vertices are critical. A graph $G$ is called weak bicritical if for every non-critical vertex $x\\in V(G)$, $G-x$ is a critical graph with $\\gamma (G-x)=\\gamma (G)$. In this paper, we characterize the connected weak bicritical graphs $G$ whose diameter is exactly $2\\gamma (G)-2$. This is a generalization of some known results concerning the diameter o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02154","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":"1608.02154","created_at":"2026-05-18T01:09:40.894327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02154v1","created_at":"2026-05-18T01:09:40.894327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02154","created_at":"2026-05-18T01:09:40.894327+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3ONUGBTR6EY","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3ONUGBTR6EYHRDO","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3ONUGBT","created_at":"2026-05-18T12:30:46.583412+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/U3ONUGBTR6EYHRDOADYS7YVPZV","json":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV.json","graph_json":"https://pith.science/api/pith-number/U3ONUGBTR6EYHRDOADYS7YVPZV/graph.json","events_json":"https://pith.science/api/pith-number/U3ONUGBTR6EYHRDOADYS7YVPZV/events.json","paper":"https://pith.science/paper/U3ONUGBT"},"agent_actions":{"view_html":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV","download_json":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV.json","view_paper":"https://pith.science/paper/U3ONUGBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02154&json=true","fetch_graph":"https://pith.science/api/pith-number/U3ONUGBTR6EYHRDOADYS7YVPZV/graph.json","fetch_events":"https://pith.science/api/pith-number/U3ONUGBTR6EYHRDOADYS7YVPZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/action/storage_attestation","attest_author":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/action/author_attestation","sign_citation":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/action/citation_signature","submit_replication":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/action/replication_record"}},"created_at":"2026-05-18T01:09:40.894327+00:00","updated_at":"2026-05-18T01:09:40.894327+00:00"}