{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5ZJ5WQXPUFHU5DV2PZC76KEAIE","short_pith_number":"pith:5ZJ5WQXP","canonical_record":{"source":{"id":"1508.02173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-10T09:05:12Z","cross_cats_sorted":[],"title_canon_sha256":"2362973b1fc7e21fb8ca42becaec6dec0d24b8b87ece051bdbc705f81b0d7106","abstract_canon_sha256":"09baabd6aa930f7a499312384d42ded766a6e082ce3499d8ddbbe112c82ce126"},"schema_version":"1.0"},"canonical_sha256":"ee53db42efa14f4e8eba7e45ff288041343cbf88455f4949c49e0c3f22b79aee","source":{"kind":"arxiv","id":"1508.02173","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02173","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02173v1","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02173","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"5ZJ5WQXPUFHU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZJ5WQXPUFHU5DV2","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZJ5WQXP","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5ZJ5WQXPUFHU5DV2PZC76KEAIE","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-10T09:05:12Z","cross_cats_sorted":[],"title_canon_sha256":"2362973b1fc7e21fb8ca42becaec6dec0d24b8b87ece051bdbc705f81b0d7106","abstract_canon_sha256":"09baabd6aa930f7a499312384d42ded766a6e082ce3499d8ddbbe112c82ce126"},"schema_version":"1.0"},"canonical_sha256":"ee53db42efa14f4e8eba7e45ff288041343cbf88455f4949c49e0c3f22b79aee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:33.957910Z","signature_b64":"mDr+TybIqtXPOY7BrMGqwWjYqEPZLFaqF3upQRpLA7Aj3jZ4PrgJJOS1iKkvVNlAvRWRKwgLkB7dGQsEgB3pAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee53db42efa14f4e8eba7e45ff288041343cbf88455f4949c49e0c3f22b79aee","last_reissued_at":"2026-05-18T01:35:33.957365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:33.957365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02173","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:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYNARjrckZf/7Yv98SHZFiB6E4vEbZ1vl8P8TE8YPKNk7RtBZn79n6CtZ4kMfXArkxVCXhB/RWD+KXdBchl+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:23:33.634386Z"},"content_sha256":"e8d0817b11e43aaad29199d909e68ebfc5eb7d56d861b4c403c41a8a8e4ed394","schema_version":"1.0","event_id":"sha256:e8d0817b11e43aaad29199d909e68ebfc5eb7d56d861b4c403c41a8a8e4ed394"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5ZJ5WQXPUFHU5DV2PZC76KEAIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relationship between Conditional Diagnosability and 2-extra Connectivity of Symmetric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Rong-Xia Hao, Zeng-Xian Tian","submitted_at":"2015-08-10T09:05:12Z","abstract_excerpt":"The conditional diagnosability and the 2-extra connectivity are two important parameters to measure ability of diagnosing faulty processors and fault-tolerance in a multiprocessor system. The conditional diagnosability $t_c(G)$ of $G$ is the maximum number $t$ for which $G$ is conditionally $t$-diagnosable under the comparison model, while the 2-extra connectivity $\\kappa_2(G)$ of a graph $G$ is the minimum number $k$ for which there is a vertex-cut $F$ with $|F|=k$ such that every component of $G-F$ has at least $3$ vertices. A quite natural problem is what is the relationship between the max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02173","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:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fe75VGng9uz0NDpaiJiUS2ogTbxID/sB71q6VaBDzh3M3HmEeap/w/ztnehaDAL8rPbYKqs12m6wnhDH8hbqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:23:33.634748Z"},"content_sha256":"58cca770717e2252b1963624af8db0e7cf9456b45026de42f6add0175b19832c","schema_version":"1.0","event_id":"sha256:58cca770717e2252b1963624af8db0e7cf9456b45026de42f6add0175b19832c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE/bundle.json","state_url":"https://pith.science/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE/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-08T11:23:33Z","links":{"resolver":"https://pith.science/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE","bundle":"https://pith.science/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE/bundle.json","state":"https://pith.science/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZJ5WQXPUFHU5DV2PZC76KEAIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5ZJ5WQXPUFHU5DV2PZC76KEAIE","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":"09baabd6aa930f7a499312384d42ded766a6e082ce3499d8ddbbe112c82ce126","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-10T09:05:12Z","title_canon_sha256":"2362973b1fc7e21fb8ca42becaec6dec0d24b8b87ece051bdbc705f81b0d7106"},"schema_version":"1.0","source":{"id":"1508.02173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02173","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02173v1","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02173","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"5ZJ5WQXPUFHU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5ZJ5WQXPUFHU5DV2","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5ZJ5WQXP","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:58cca770717e2252b1963624af8db0e7cf9456b45026de42f6add0175b19832c","target":"graph","created_at":"2026-05-18T01:35:33Z","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 conditional diagnosability and the 2-extra connectivity are two important parameters to measure ability of diagnosing faulty processors and fault-tolerance in a multiprocessor system. The conditional diagnosability $t_c(G)$ of $G$ is the maximum number $t$ for which $G$ is conditionally $t$-diagnosable under the comparison model, while the 2-extra connectivity $\\kappa_2(G)$ of a graph $G$ is the minimum number $k$ for which there is a vertex-cut $F$ with $|F|=k$ such that every component of $G-F$ has at least $3$ vertices. A quite natural problem is what is the relationship between the max","authors_text":"Jun-Ming Xu, Rong-Xia Hao, Zeng-Xian Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-10T09:05:12Z","title":"Relationship between Conditional Diagnosability and 2-extra Connectivity of Symmetric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02173","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:e8d0817b11e43aaad29199d909e68ebfc5eb7d56d861b4c403c41a8a8e4ed394","target":"record","created_at":"2026-05-18T01:35:33Z","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":"09baabd6aa930f7a499312384d42ded766a6e082ce3499d8ddbbe112c82ce126","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-10T09:05:12Z","title_canon_sha256":"2362973b1fc7e21fb8ca42becaec6dec0d24b8b87ece051bdbc705f81b0d7106"},"schema_version":"1.0","source":{"id":"1508.02173","kind":"arxiv","version":1}},"canonical_sha256":"ee53db42efa14f4e8eba7e45ff288041343cbf88455f4949c49e0c3f22b79aee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee53db42efa14f4e8eba7e45ff288041343cbf88455f4949c49e0c3f22b79aee","first_computed_at":"2026-05-18T01:35:33.957365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:33.957365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDr+TybIqtXPOY7BrMGqwWjYqEPZLFaqF3upQRpLA7Aj3jZ4PrgJJOS1iKkvVNlAvRWRKwgLkB7dGQsEgB3pAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:33.957910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8d0817b11e43aaad29199d909e68ebfc5eb7d56d861b4c403c41a8a8e4ed394","sha256:58cca770717e2252b1963624af8db0e7cf9456b45026de42f6add0175b19832c"],"state_sha256":"568fa9b17a689941ce5893033111396bfcb34b1d003f3ee1ff01c5b8485b8f4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhmCrtxttfQJbo5V+UrsqK2Wn3FbgHAvtLFqxadHkOXDRJySSduRVUcSkab9q3qGbwzKMOn7V71FNPcpbQNkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:23:33.636739Z","bundle_sha256":"1c41475d6a358c9a3beaf1cf8b16b17ea3e8faf04197d02e1fd0b791379a5c59"}}