{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MTACLDREAVPP4UOI5DTW3IU73T","short_pith_number":"pith:MTACLDRE","schema_version":"1.0","canonical_sha256":"64c0258e24055efe51c8e8e76da29fdccb74cc88e11cf81e8b204a714a0c6855","source":{"kind":"arxiv","id":"1701.08355","version":1},"attestation_state":"computed","paper":{"title":"Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng","submitted_at":"2017-01-29T08:35:52Z","abstract_excerpt":"Extra connectivity and the pessimistic diagnosis are two crucial subjects for a multiprocessor system's ability to tolerate and diagnose faulty processor. The pessimistic diagnosis strategy is a classic strategy based on the PMC model in which isolates all faulty vertices within a set containing at most one fault-free vertex. In this paper, the result that the pessimistic diagnosability $t_p(G)$ equals the extra connectivity $\\kappa_{1}(G)$ of a regular graph $G$ under some conditions are shown. Furthermore, the following new results are gotten: the pessimistic diagnosability $t_p(S_n^2)=4n-9$"},"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":"1701.08355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T08:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"3e12e5a97e74966877a25bc15a97080bc2a3d8f29b2dd2c2f92177739fcce640","abstract_canon_sha256":"156eb8f2cce68bafe62b3f69f01cc19b815a89fd88ddb085905601338f154a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:54.423136Z","signature_b64":"tbgo0UnKWXfyPfWeyyvWBvvN0tzts+50+lQ8qQkkzVRB+aDCNdQrRvlINON7QfmsZSc1hz2FbhVfIlej6erzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c0258e24055efe51c8e8e76da29fdccb74cc88e11cf81e8b204a714a0c6855","last_reissued_at":"2026-05-18T00:51:54.422342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:54.422342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng","submitted_at":"2017-01-29T08:35:52Z","abstract_excerpt":"Extra connectivity and the pessimistic diagnosis are two crucial subjects for a multiprocessor system's ability to tolerate and diagnose faulty processor. The pessimistic diagnosis strategy is a classic strategy based on the PMC model in which isolates all faulty vertices within a set containing at most one fault-free vertex. In this paper, the result that the pessimistic diagnosability $t_p(G)$ equals the extra connectivity $\\kappa_{1}(G)$ of a regular graph $G$ under some conditions are shown. Furthermore, the following new results are gotten: the pessimistic diagnosability $t_p(S_n^2)=4n-9$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08355","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":"1701.08355","created_at":"2026-05-18T00:51:54.422469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08355v1","created_at":"2026-05-18T00:51:54.422469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08355","created_at":"2026-05-18T00:51:54.422469+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTACLDREAVPP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTACLDREAVPP4UOI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTACLDRE","created_at":"2026-05-18T12:31:31.346846+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/MTACLDREAVPP4UOI5DTW3IU73T","json":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T.json","graph_json":"https://pith.science/api/pith-number/MTACLDREAVPP4UOI5DTW3IU73T/graph.json","events_json":"https://pith.science/api/pith-number/MTACLDREAVPP4UOI5DTW3IU73T/events.json","paper":"https://pith.science/paper/MTACLDRE"},"agent_actions":{"view_html":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T","download_json":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T.json","view_paper":"https://pith.science/paper/MTACLDRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08355&json=true","fetch_graph":"https://pith.science/api/pith-number/MTACLDREAVPP4UOI5DTW3IU73T/graph.json","fetch_events":"https://pith.science/api/pith-number/MTACLDREAVPP4UOI5DTW3IU73T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/action/storage_attestation","attest_author":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/action/author_attestation","sign_citation":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/action/citation_signature","submit_replication":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/action/replication_record"}},"created_at":"2026-05-18T00:51:54.422469+00:00","updated_at":"2026-05-18T00:51:54.422469+00:00"}