{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U3ONUGBTR6EYHRDOADYS7YVPZV","short_pith_number":"pith:U3ONUGBT","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"},"canonical_sha256":"a6dcda18338f8983c46e00f12fe2afcd6aca36a443f18e3466c9ea970797104d","source":{"kind":"arxiv","id":"1608.02154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02154","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02154v1","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02154","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"U3ONUGBTR6EY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U3ONUGBTR6EYHRDO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U3ONUGBT","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U3ONUGBTR6EYHRDOADYS7YVPZV","target":"record","payload":{"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"},"canonical_sha256":"a6dcda18338f8983c46e00f12fe2afcd6aca36a443f18e3466c9ea970797104d","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"},"source_kind":"arxiv","source_id":"1608.02154","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:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+hwnKirnU34R0s08Aff1WWOM4EhNyvZo+xg+Vc9F+QhjrXz6Dzi5Bx4A+PcXSoZgzPX5Q8LEZ5HiH0QoMwMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:38:37.057881Z"},"content_sha256":"dfef919f3d7839b9c8a3fe1f0288742120b34a85ac6502244a17916dd324be00","schema_version":"1.0","event_id":"sha256:dfef919f3d7839b9c8a3fe1f0288742120b34a85ac6502244a17916dd324be00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U3ONUGBTR6EYHRDOADYS7YVPZV","target":"graph","payload":{"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"},"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:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DZyZwAgLd1BccthuubaSjNV70RnTcO5CBBf8RWA4eWJY4rNWEO+mTRJuE85UNtljrnxX8B1kfFtgn9MdIjjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:38:37.058274Z"},"content_sha256":"0ca312f7802d8687f01fee8eb243308f78b147646bdeae63e8139305773c2278","schema_version":"1.0","event_id":"sha256:0ca312f7802d8687f01fee8eb243308f78b147646bdeae63e8139305773c2278"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/bundle.json","state_url":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/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-30T16:38:37Z","links":{"resolver":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV","bundle":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/bundle.json","state":"https://pith.science/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3ONUGBTR6EYHRDOADYS7YVPZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U3ONUGBTR6EYHRDOADYS7YVPZV","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":"5d825716f3d4c7424a65e1b24a322ce72232ee8e4d25662d9636bc25187876ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T20:55:14Z","title_canon_sha256":"b3c0104ba7a743f0ffda13ad06710a75d17367ef606d9f1431617bda1e644d51"},"schema_version":"1.0","source":{"id":"1608.02154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02154","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02154v1","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02154","created_at":"2026-05-18T01:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"U3ONUGBTR6EY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U3ONUGBTR6EYHRDO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U3ONUGBT","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:0ca312f7802d8687f01fee8eb243308f78b147646bdeae63e8139305773c2278","target":"graph","created_at":"2026-05-18T01:09:40Z","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":"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","authors_text":"Michitaka Furuya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T20:55:14Z","title":"A characterization of domination weak bicritical graphs with large diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02154","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:dfef919f3d7839b9c8a3fe1f0288742120b34a85ac6502244a17916dd324be00","target":"record","created_at":"2026-05-18T01:09:40Z","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":"5d825716f3d4c7424a65e1b24a322ce72232ee8e4d25662d9636bc25187876ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-06T20:55:14Z","title_canon_sha256":"b3c0104ba7a743f0ffda13ad06710a75d17367ef606d9f1431617bda1e644d51"},"schema_version":"1.0","source":{"id":"1608.02154","kind":"arxiv","version":1}},"canonical_sha256":"a6dcda18338f8983c46e00f12fe2afcd6aca36a443f18e3466c9ea970797104d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6dcda18338f8983c46e00f12fe2afcd6aca36a443f18e3466c9ea970797104d","first_computed_at":"2026-05-18T01:09:40.894229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:40.894229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bUU6GP61EScxbbIlYn7f6QaKzxwWUCbg6kDx9WpY1CvYdPI3Tc2GFihK9lyRin7/JwSCRLErzm02EstrQjuNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:40.894751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfef919f3d7839b9c8a3fe1f0288742120b34a85ac6502244a17916dd324be00","sha256:0ca312f7802d8687f01fee8eb243308f78b147646bdeae63e8139305773c2278"],"state_sha256":"b1c7be005d215b36fd50333cc05c1d3a8509b8c4e26367f0f081d096870a9021"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWMdw+Hayznf1jq0KwChmwerMl0MqmjGWPdmXxRfXXxjve4idI2GSjEBSJBO92b7I337g6e+WBCfnL437B3fDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T16:38:37.060836Z","bundle_sha256":"9d1dbe10d16fe3b3a1db44d71138d22e7fbef332abfcf9b69eb04860d548036e"}}