{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MTACLDREAVPP4UOI5DTW3IU73T","short_pith_number":"pith:MTACLDRE","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"},"canonical_sha256":"64c0258e24055efe51c8e8e76da29fdccb74cc88e11cf81e8b204a714a0c6855","source":{"kind":"arxiv","id":"1701.08355","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08355","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08355v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08355","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"MTACLDREAVPP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MTACLDREAVPP4UOI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MTACLDRE","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MTACLDREAVPP4UOI5DTW3IU73T","target":"record","payload":{"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"},"canonical_sha256":"64c0258e24055efe51c8e8e76da29fdccb74cc88e11cf81e8b204a714a0c6855","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"},"source_kind":"arxiv","source_id":"1701.08355","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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zD5KjNvFA2JB3ltaXI+h08jOIU4QGbLBdbJs7WHtAGCDwNSfflDlLK6Fi5kLWGLG1NGQ3CotUVi0F32sHQbzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:17:29.980976Z"},"content_sha256":"84fea1dc290cef5ebf904b19868184c55bc1b1dae7f793d7e022252786728171","schema_version":"1.0","event_id":"sha256:84fea1dc290cef5ebf904b19868184c55bc1b1dae7f793d7e022252786728171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MTACLDREAVPP4UOI5DTW3IU73T","target":"graph","payload":{"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"},"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-18T00:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLJpu004NBgO0hcYSmJiCkZNYl0CmZJts20z8MAleTvCrOmHIOqhujVsTsxy7GJ0IIe/e8ebscH77RyzqS6KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:17:29.981335Z"},"content_sha256":"49619fd784a75f01357e4a6f7c923316bac0100a0e65d275b05ee0b16180361f","schema_version":"1.0","event_id":"sha256:49619fd784a75f01357e4a6f7c923316bac0100a0e65d275b05ee0b16180361f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/bundle.json","state_url":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTACLDREAVPP4UOI5DTW3IU73T/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-24T08:17:29Z","links":{"resolver":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T","bundle":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/bundle.json","state":"https://pith.science/pith/MTACLDREAVPP4UOI5DTW3IU73T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTACLDREAVPP4UOI5DTW3IU73T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MTACLDREAVPP4UOI5DTW3IU73T","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":"156eb8f2cce68bafe62b3f69f01cc19b815a89fd88ddb085905601338f154a66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T08:35:52Z","title_canon_sha256":"3e12e5a97e74966877a25bc15a97080bc2a3d8f29b2dd2c2f92177739fcce640"},"schema_version":"1.0","source":{"id":"1701.08355","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08355","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08355v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08355","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"MTACLDREAVPP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MTACLDREAVPP4UOI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MTACLDRE","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:49619fd784a75f01357e4a6f7c923316bac0100a0e65d275b05ee0b16180361f","target":"graph","created_at":"2026-05-18T00:51:54Z","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":"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$","authors_text":"Jun-Ming Xu, Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T08:35:52Z","title":"Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08355","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:84fea1dc290cef5ebf904b19868184c55bc1b1dae7f793d7e022252786728171","target":"record","created_at":"2026-05-18T00:51:54Z","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":"156eb8f2cce68bafe62b3f69f01cc19b815a89fd88ddb085905601338f154a66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T08:35:52Z","title_canon_sha256":"3e12e5a97e74966877a25bc15a97080bc2a3d8f29b2dd2c2f92177739fcce640"},"schema_version":"1.0","source":{"id":"1701.08355","kind":"arxiv","version":1}},"canonical_sha256":"64c0258e24055efe51c8e8e76da29fdccb74cc88e11cf81e8b204a714a0c6855","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64c0258e24055efe51c8e8e76da29fdccb74cc88e11cf81e8b204a714a0c6855","first_computed_at":"2026-05-18T00:51:54.422342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:54.422342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tbgo0UnKWXfyPfWeyyvWBvvN0tzts+50+lQ8qQkkzVRB+aDCNdQrRvlINON7QfmsZSc1hz2FbhVfIlej6erzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:54.423136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08355","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84fea1dc290cef5ebf904b19868184c55bc1b1dae7f793d7e022252786728171","sha256:49619fd784a75f01357e4a6f7c923316bac0100a0e65d275b05ee0b16180361f"],"state_sha256":"44f6c1a3c90f28f97658fcd2124f55816a04843f73a99a016a73b24dcae27aaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfZc9LE+6DxKRQpbrJXFUq7sbsUkjODw5nPaxFw6SHXvFeL7sq9AQ7tAtn4z5JJa+PrEKaBkdwnQ5U78sD8fDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:17:29.983203Z","bundle_sha256":"54a79bfc5e5c271c7e1f1228beb14d17e28de413cd292bb9343abdf68b00eaa9"}}