{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KUKLLTPOFMCEX72LD2JRRSNBVU","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":"537397ae33a97b45da7bdb953e6a40aa806bc8ebd069e1ca4a34584d576f8ad5","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T11:06:33Z","title_canon_sha256":"3ab48b0cf1b417be162d73458aed68fc976aa9480cb55e8fd9490b0ceb46623e"},"schema_version":"1.0","source":{"id":"1812.00004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00004","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00004v1","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00004","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"KUKLLTPOFMCE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KUKLLTPOFMCEX72L","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KUKLLTPO","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:c8b6ff97967e977fd6f5c74713e0136bef1b66361a884048e7ffa9aa5f55ce5b","target":"graph","created_at":"2026-05-17T23:59:27Z","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=(V, E)$ be a connected graph, a subset $S\\subseteq V(G)$ is called an $R^{g}$-vertex-cut of $G$ if $G-F$ is disconnected and any vertex in $G-F$ has at least $g$ neighbours in $G-F$. The $R^{g}$-vertex-connectivity is the size of the minimum $R^{g}$-vertex-cut and denoted by $\\kappa^{g}(G)$. Many large-scale multiprocessor or multi-computer systems take interconnection networks as underlying topologies. Fault diagnosis is especially important to identify fault tolerability of such systems. The $g$-good-neighbor diagnosability such that every fault-free node has at least $g$ fault-free n","authors_text":"Rong-Xia Hao, Shu-Li Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T11:06:33Z","title":"The $g$-good neighbour diagnosability of hierarchical cubic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00004","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:47d02fa689d766280e4bb274bff5d116916b37cac1cd400f1f6e4ae5e5d95de9","target":"record","created_at":"2026-05-17T23:59:27Z","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":"537397ae33a97b45da7bdb953e6a40aa806bc8ebd069e1ca4a34584d576f8ad5","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-30T11:06:33Z","title_canon_sha256":"3ab48b0cf1b417be162d73458aed68fc976aa9480cb55e8fd9490b0ceb46623e"},"schema_version":"1.0","source":{"id":"1812.00004","kind":"arxiv","version":1}},"canonical_sha256":"5514b5cdee2b044bff4b1e9318c9a1ad2fb84acd7178abf306d0ec9c17a204ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5514b5cdee2b044bff4b1e9318c9a1ad2fb84acd7178abf306d0ec9c17a204ca","first_computed_at":"2026-05-17T23:59:27.575231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:27.575231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JPmhFrDqQyE98vVHdrGa+dq8deBBf6ftSi42eIX5ASBJpvuz+ETXZ0SJXX7LoNpt2w7CsCpyA4yKtocDYKjmDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:27.575725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47d02fa689d766280e4bb274bff5d116916b37cac1cd400f1f6e4ae5e5d95de9","sha256:c8b6ff97967e977fd6f5c74713e0136bef1b66361a884048e7ffa9aa5f55ce5b"],"state_sha256":"6bfaaff21b650afbc19b074b8752da8a4145242921967099198e92a3e896532f"}